Abstract
We introduces a new notion of quantum recursion of which the control flow of the computation is quantum rather than classical as in the notions of recursion considered in the previous studies of quantum programming. A typical example is recursive quantum walks, which are obtained by slightly modifying the construction of the ordinary quantum walks. The operational and denotational semantics of quantum recursions are defined by employing the second quantisation method, and they are proved to be equivalent.Time
2017-06-19 10:00 ~ 11:00Speaker
Mingsheng Ying, University of Technology Sydney, AustraliaRoom
Room 308,School of Information Management & Engineering, Shanghai University of Finance & Economics
