Abstract
One important application of quantum process algebras is to formally verify quantum communication protocols. With a suitable notion of behavioural equivalence and a decision method, one can determine if an implementation of a protocol is consistent with its specification. Ground bisimulation is a convenient behavioural equivalence for quantum processes because of its associated coinduction proof technique. We exploit this technique to design and implement two on-the-fly algorithms for the strong and weak versions of ground bisimulation to check if two given processes in quantum CCS are equivalent. We then develop a tool that can verify interesting quantum protocols such as the BB84 quantum key distribution scheme.
Supported by the National Natural Science Foundation of China (61672229, 61832015) and the Inria-CAS joint project Quasar.
Chapter PDF
Similar content being viewed by others
References
Aaronson, S., Gottesman, D.: Improved simulation of stabilizer circuits.Physical Review A 70(052328) (2004)
Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols. In: Proceedings of the 19th IEEE Symposium on Logic in Computer Science. pp. 415–425. IEEE Computer Society (2004)
Ardeshir-Larijani, E., Gay, S.J., Nagarajan, R.: Automated equivalence checking of concurrent quantum systems. ACM Transactions on Computational Logic 19(4), 28:1–28:32 (2018)
Baier, C., Engelen, B., Majster-Cederbaum, M.E.: Deciding bisimilarity and similarity for probabilistic processes. Journal of Computer and System Sciences 60(1), 187–231 (2000)
Bennett, C.H., Brassard, G.: Quantum cryptography: Public-key distribution and coin tossing. In: Proceedings of the IEEE International Conference on Computer, Systems and Signal Processing. pp. 175–179 (1984)
Davidson, T.A.S.: Formal Verification Techniques using Quantum Process Calculus. Ph.D. thesis, University of Warwick (2011)
Deng, Y.: Semantics of Probabilistic Processes: An Operational Approach.Springer (2015)
Deng, Y., Du, W.: A local algorithm for checking probabilistic bisimilarity. In: Proceedings of the 4th International Conference on Frontier of Computer Science and Technology. pp. 401–407. IEEE Computer Society (2009)
Deng, Yuxin, Feng, Yuan: Open Bisimulation for Quantum Processes. In: Baeten, Jos C.M., Ball, Tom, de Boer, Frank S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 119–133. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33475-7_9
Feng, Y., Duan, R., Ji, Z., Ying, M.: Probabilistic bisimulations for quantum processes. Information and Computation 205(11), 1608–1639 (2007)
Feng, Y., Deng, Y., Ying, M.: Symbolic bisimulation for quantum processes. ACM Transactions on Computational Logic 15(2), 1–32 (2014)
Feng, Y., Duan, R., Ying, M.: Bisimulation for quantum processes. In: Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. pp. 523–534. ACM (2011)
Feng, Yuan, Hahn, Ernst Moritz, Turrini, Andrea, Zhang, Lijun: QPMC: A Model Checker for Quantum Programs and Protocols. In: Bjørner, Nikolaj, de Boer, Frank (eds.) FM 2015. LNCS, vol. 9109, pp. 265–272. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19249-9_17
Fernandez, J.C., Mounier, L.: Verifying bisimulations "on the fly". In: Proceedings of the 3rd International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols. pp. 95–110. North-Holland (1990)
Gay, S.J., Nagarajan, R.: Communicating quantum processes. In: Palsberg, J., Abadi, M. (eds.) Proceedings of the 32Nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. pp. 145–157 (2005)
Gay, Simon J., Nagarajan, Rajagopal, Papanikolaou, Nikolaos: QMC: A Model Checker for Quantum Systems. In: Gupta, Aarti, Malik, Sharad (eds.) CAV 2008. LNCS, vol. 5123, pp. 543–547. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-70545-1_51
Hennessy, M., Lin, H.: Symbolic bisimulations. Theoretical Computer Science 138(2), 353–389 (1995)
Jorrand, P., Lalire, M.: Toward a quantum process algebra. In: Proceedings of the 1st Conference on Computing Frontiers. pp. 111–119. ACM (2004)
Kissinger, A.: Pictures of Processes: Automated Graph Rewriting for Monoidal Categories and Applications to Quantum Computing. Ph.D. thesis, University of Oxford (2011)
Kubota, T., Kakutani, Y., Kato, G., Kawano, Y., Sakurada, H.: Semi-automated verification of security proofs of quantum cryptographic protocols. Journal of Symbolic Computation 73, 192–220 (2016)
Lalire, M.: Relations among quantum processes: Bisimilarity and congruence. Mathematical Structures in Computer Science 16(3), 407–428 (2006)
Liu, T., Li, Y., Wang, S., Ying, M., Zhan, N.: A theorem prover for quantum hoare logic and its applications. CoRR abs/1601.03835 (2016)
Milner, R.: Communication and Concurrency. Prentice-Hall (1989)
Qin, X., Deng, Y., Du, W.: QBisim (2020), https://github.com/MartianQXD/QBisim
Sangiorgi, D.: A theory of bisimulation for the pi-calculus. Acta Informatica 33(1), 69–97 (1996)
Selinger, P.: Towards a quantum programming language. Mathematical Structures in Computer Science 14(4), 527–586 (2004)
Shor, P., Preskill, J.: Simple proof of security of the BB84 quantum key distribution protocol. Physical Review Letters 85(2), 441–444 (2000)
Turrini, A., Hermanns, H.: Polynomial time decision algorithms for probabilistic automata. Information and Computation 244, 134–171 (2015)
Ying, M., Feng, Y., Duan, R., Ji, Z.: An algebra of quantum processes. ACMTransactions on Computational Logic 10(3), 1–36 (2009)
Ying, M.: Foundations of Quantum Programming. Morgan Kaufmann (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2020 The Author(s)
About this paper
Cite this paper
Qin, X., Deng, Y., Du, W. (2020). Verifying Quantum Communication Protocols with Ground Bisimulation. In: Biere, A., Parker, D. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2020. Lecture Notes in Computer Science(), vol 12079. Springer, Cham. https://doi.org/10.1007/978-3-030-45237-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-45237-7_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-45236-0
Online ISBN: 978-3-030-45237-7
eBook Packages: Computer ScienceComputer Science (R0)
