Process algebra approach to distributed quantum computation and secure quantum communication

Funding: 2011: $100,000
2012: $100,000
2013: $100,000

Project Member(s): Ying, M., Feng, Y.

Funding or Partner Organisation: Australian Research Council (ARC Discovery Projects)

Start year: 2011

Summary: This project will develop effective methods for reasoning about the behaviours of distributed quantum computing and communicating systems. The developed methods will provide effective techniques for verifying security of quantum cryptographic protocols.

Publications:

Ying, M 2016, Foundations of Quantum Programming, Morgan Kaufmann Publishers.
View/Download from: Publisher's site

Yu, N & Ying, M 2015, 'Optimal simulation of Deutsch gates and the Fredkin gate', PHYSICAL REVIEW A, vol. 91, no. 3.
View/Download from: Publisher's site

Feng, Y, Deng, Y & Ying, M 2014, 'Symbolic Bisimulation for Quantum Processes.', ACM Trans. Comput. Log., vol. 15, pp. 14:1-14:1.
View/Download from: Publisher's site

Cao, Y, Xia, L & Ying, M 2013, 'Probabilistic automata for computing with words', JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 79, no. 1, pp. 152-172.
View/Download from: Publisher's site

Yu, N, Duan, R & Ying, M 2013, 'Five two-qubit gates are necessary for implementing the Toffoli gate', PHYSICAL REVIEW A, vol. 88, no. 1.
View/Download from: Publisher's site

Feng, Y, Yu, N & Ying, M 1970, 'Reachability Analysis of Recursive Quantum Markov Chains', MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, International Symposium on Mathematical Foundations of Computer Science, Springer, IST Austria, pp. 385-396.
View/Download from: Publisher's site

Ying, S, Feng, Y, Yu, N & Ying, M 1970, 'Reachability Probabilities of Quantum Markov Chains', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), International Conference on Concurrency Theory, Springer, University of Buenos Aires, Argentina, pp. 334-348.
View/Download from: Publisher's site

Yu, N & Ying, M 1970, 'Reachability and Termination Analysis of Concurrent Quantum Programs', CONCUR 2012 - CONCURRENCY THEORY, International Conference on Concurrency Theory, Sringer-Verlag, Newcastle upon Tyne, UK, pp. 69-83.
View/Download from: Publisher's site

Ying, M 2011, 'Floyd-Hoare Logic for Quantum Programs', ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, vol. 33, no. 6, pp. 1-49.
View/Download from: Publisher's site

Ying, M, Li, Y, Yu, N & Feng, Y 2011, 'Model-Checking Linear-Time Properties of Quantum Systems'.

Ying, M 1970, 'Foundations of Quantum Programming (Extended Abstract)', PROGRAMMING LANGUAGES AND SYSTEMS, Programming Languages and Systems, Springer-Verlag, Shanghai, China, pp. 16-20.
View/Download from: Publisher's site

Ying, M 2010, 'Another Quantum Lovász Local Lemma'.

Ying, M 2009, 'Hoare Logic for Quantum Programs'.

Keywords: process algebra, formal methods, semantics, quantum computation, quantum communication

FOR Codes: Computational Logic and Formal Languages, Concurrent Programming, Expanding Knowledge in the Information and Computing Sciences, Information and Communication Services not elsewhere classified, Concurrent/parallel systems and technologies, Other information and communication services not elsewhere classified

Acknowledgement of Country

UTS acknowledges the Gadigal people of the Eora Nation, the Boorooberongal people of the Dharug Nation, the Bidiagal people and the Gamaygal people, upon whose ancestral lands our university stands. We would also like to pay respect to the Elders both past and present, acknowledging them as the traditional custodians of knowledge for these lands.