Skip to main content

Towards Quantum Programs Verification: From Quipper Circuits to QPMC

  • Conference paper
  • First Online:
Reversible Computation (RC 2016)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9720))

Included in the following conference series:

Abstract

We present a translation from the quantum programming language Quipper to the QPMC model checker, with the main aim of verifying Quipper programs. We implemented and tested our translation on several quantum algorithms, including Grover’s quantum search.

This work has been partially supported by the GNCS group of INdAM.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Feng, Y., Hahn, E.M., Turrini, A., Zhang, L.: QPMC: a model checker for quantum programs and protocols. In: Bjørner, N., Boer, F. (eds.) FM 2015. LNCS, vol. 9109, pp. 265–272. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  2. Feng, Y., Yu, N., Ying, M.: Model checking quantum Markov chains. J. Comput. Syst. Sci. 79, 1181–1198 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  3. Gay, S., Nagarajan, R., Papanikolaou, N.: Probabilistic model-checking of quantum protocols. In: Proceedings of the 2nd International Workshop on Developments in Computational Models (2006)

    Google Scholar 

  4. Green, A.S., Lumsdaine, P.L., Ross, N.J., Selinger, P., Valiron, B.: Quipper: a scalable quantum programming language. SIGPLAN Not. 48(6), 333–342 (2013)

    Article  MATH  Google Scholar 

  5. Knill, E.: Conventions for Quantum Pseudocode. Technical report, Los Alamos National Laboratory (1996)

    Google Scholar 

  6. Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Qadeer, S., Gopalakrishnan, G. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585–591. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2011)

    MATH  Google Scholar 

  8. Smith, J.M., Ross, N.J., Selinger, P., Valiron, B.: Quipper: concrete resource estimation in quantum algorithms. In: Workshop on Quantitative Aspects of Programming Languages and Systems, QApPL, Grenoble (2014). arxiv:1412.0625

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Linda Anticoli .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Anticoli, L., Piazza, C., Taglialegne, L., Zuliani, P. (2016). Towards Quantum Programs Verification: From Quipper Circuits to QPMC. In: Devitt, S., Lanese, I. (eds) Reversible Computation. RC 2016. Lecture Notes in Computer Science(), vol 9720. Springer, Cham. https://doi.org/10.1007/978-3-319-40578-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40578-0_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40577-3

  • Online ISBN: 978-3-319-40578-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics