Advertisement

A Dynamic Logic for QASM Programs

  • Carlos TavaresEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 12005)

Abstract

We define a dynamic logic for QASM (Quantum Assembly) programming language, a language that requires the handling of quantum and probabilistic information. We provide a syntax and a model to this logic, providing a probabilistic semantics to the classical part. We exercise it with the quantum coin toss program.

Keywords

Quantum logic Quantum programming Dynamic logic 

Notes

Acknowledgements

The author wishes to thank Luís Barbosa and Leandro Gomes, for the useful discussions during the course of this work. The author was funded by an individual grant of reference SFRH/BD/116367/2016, conceded by the FCT - Fundação para a Ciência e Tecnologia under the POCH programme and MCTES national funds. This work was also supported by the KLEE project(POCI-01-0145-FEDER-030947-PTDC/CCI-COM/30947/2017), funded by ERDF by the Operational Programme for Competitiveness and Internationalisation, COMPETE2020 Programme and by National Funds through the Portuguese funding agency, FCT.

References

  1. [BBK+14]
    Baltag, A., Bergfeld, J., Kishida, K., Sack, J., Smets, S., Zhong, S.: PLQP & company: decidable logics for quantum algorithms. Int. J. Theor. Phys. 53(10), 3628–3647 (2014)MathSciNetCrossRefGoogle Scholar
  2. [BS04]
    Baltag, A., Smets, S.: The logic of quantum programs. In: Proceedings of the 2nd International Workshop on Quantum Programming Languages, pp. 39–56 (2004). https://www.mathstat.dal.ca/~selinger/qpl2004/proceedings.html
  3. [CBSG17]
    Cross, A.W., Bishop, L.S., Smolin, J.A., Gambetta, J.M.: Open quantum assembly language. arXiv preprint arXiv:1707.03429 (2017)
  4. [Deu85]
    Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. Lond. A. Math. Phys. Sci. 400(1818), 97–117 (1985)MathSciNetCrossRefGoogle Scholar
  5. [Deu89]
    Deutsch, D.E.: Quantum computational networks. Proc. Roy. Soc. Lond. A. Math. Phys. Sci. 425(1868), 73–90 (1989)MathSciNetCrossRefGoogle Scholar
  6. [HM80]
    Hennessy, M., Milner, R.: On observing nondeterminism and concurrency. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 299–309. Springer, Heidelberg (1980).  https://doi.org/10.1007/3-540-10003-2_79CrossRefGoogle Scholar
  7. [ibm18]
    IBM Q - quantum computing, June 2018. https://www.research.ibm.com/ibm-q/
  8. [Koz81]
    Kozen, D.: Semantics of probabilistic programs. J. Comput. Syst. Sci. 22(3), 328–350 (1981)MathSciNetCrossRefGoogle Scholar
  9. [Koz85]
    Kozen, D.: A probabilistic PDL. J. Comput. Syst. Sci. 30(2), 162–178 (1985)MathSciNetCrossRefGoogle Scholar
  10. [NC02]
    Nielsen, M.A., Chuang, I.: Quantum computation and quantum information (2002)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.High-Assurance Software Laboratory/INESC TECBragaPortugal

Personalised recommendations