Mingsheng Ying, University of Technology, Sydney

Abstract

 In this talk, we will introduce a new scheme of quantum recursive programing with quantum if-statement. A simple programming language for supporting this kind of quantum recursion is defined, and its semantics is formally described. A series of examples are presented to show that some quantum algorithms can be elegantly written as quantum recursive programs. At the end, we will briefly discuss verification and compilation of quantum recursive programs.   

Speaker Bio: Mingsheng Ying is a Distinguished Professor at the Centre for Quantum Software and Information, University of Technology Sydney, Australia. His research interests include quantum computing, programming theory, and logics in artificial intelligence. He has authored the books Model Checking Quantum Systems: Principles and Algorithms (Cambridge University Press, 2021), Foundations of Quantum Programming (Morgan Kaufmann, 2016), and Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs (Springer-Verlag, 2001). He currently serves as the inaugural (Co-)Editor-in-Chief of the ACM Transactions on Quantum Computing.