2017-06-19 | Quantum recursion and second quantisation



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.




Mingsheng Ying graduated from Department of Mathematics, Fuzhou Teachers College, Jiangxi, China, in 1981. He is a Distinguished Professor with and the Research Director of the Center for Quantum Computation and Intelligent Systems (QCIS), Faculty of Engineering and Information Technology, University of Technology Sydney, Australia, and Cheung Kong Professor with the State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and Technology, Tsinghua University, Beijing, China.

Mingsheng Ying's research interests are quantum computation, programming theory, and foundations of artificial intelligence. He has published more than 100 papers in top international journals and conferences. He is the author of the books "Foundations of Quantum Programming" (Elsevier - Morgan Kaufmann 2016) and "Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs" (Springer-Verlag, 2001).