Abstract
We present a programming language for describing and analysing concurrent quantum systems. We have an interpreter for programs in the language, using a symbolic rather than a numeric calculator, and we give its performance on examples from quantum communication and cryptography.
Chapter PDF
Similar content being viewed by others
References
Qtpi protocol simulator, https://github.com/mdxtoc/qtpi, accessed on 2020.02.13
The Q# Programming Language, https://docs.microsoft.com/en-us/quantum/quantum-qr-intro, accessed on 2020.02.13
Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. In: Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing. p. 175. India (1984)
Bennett, C.H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., Wootters, W.K.: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Physical Review Letters 70(13) (1993)
Boender, J., Kammüller, F., Nagarajan, R.: Formalization of quantum protocols using Coq. In: The 12th International Workshop on Quantum Physics and Logic. vol. 195, pp. 71–83 (2015). https://doi.org/10.4204/EPTCS.195.6
Bornat, R., Boender, J., Kammüller, F., Poly, G., Nagarajan, R.: Figshare (2020), https://doi.org/10.6084/m9.figshare.11882592, visited 2020/02/21
Ekert, A.K., Rarity, J.G., Tapster, P.R., Massimo Palma, G.: Practical quantum cryptography based on two-photon interferometry. Phys. Rev. Lett. 69, 1293–1295 (Aug 1992). https://doi.org/10.1103/PhysRevLett.69.1293
Ferracin, S., Kapourniotis, T., Datta, A.: Reducing resources for verification of quantum computations. Physical Review A 98(2), 022323 (2018)
Gay, S.J., Nagarajan, R.: Communicating quantum processes. In: 32nd Symposium on Principles of Programming Languages (POPL 2005). pp. 145–157 (2005). https://doi.org/10.1145/1040305.1040318, also arXiv:quant-ph/0409052
INRIA: The Coq Proof Assistant, https://coq.inria.fr, accessed on 2020.02.13
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Inf. Comput. 100(1), 1–40 (1992)
Turner, D.A.: Miranda: a non-strict functional language with polymorphic types. In: Proc. of a conference on Functional programming languages and computer architecture. pp. 1–16. Springer-Verlag New York, Inc., New York, NY, USA (1985)
Wegman, M.N., Carter, J.L.: New hash functions and their use in authentication and set equality. Journal of computer and system sciences 22(3), 265–279 (1981)
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
Bornat, R., Boender, J., Kammueller, F., Poly, G., Nagarajan, R. (2020). Describing and Simulating Concurrent Quantum Systems. 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_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-45237-7_16
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)