Skip to main content
Springer Nature Link
Log in

ASM Specification and Refinement of a Quantum Algorithm

  • Chapter
  • First Online:
Logic, Computation and Rigorous Methods

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

Abstract

In this paper we use the Abstract State Machine (ASM) method for high-level system design and analysis created by Egon Börger to formally specify Grover’s quantum database search algorithm, stepwise refining it from its highest abstraction level down to its implementation as a quantum circuit. Our aim is to raise the question of whether the ASM method in general and quantum ASMs in particular can improve the current practices of quantum system engineering; providing accurate high-level modelling and linking the descriptions at the successive stages of quantum systems development through a chain of rigorous and coherent system models at stepwise refined levels of abstraction.

The research reported in this paper was supported by the Austrian Research Promotion Agency (FFG) through the COMET funding for the Software Competence Center Hagenberg.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook
USD 12.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    see e.g. https://www.ibm.com/quantum-computing/simulator/.

References

  1. Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms. ACM Trans. Comput. Log. 4(4), 578–651 (2003)

    Article  MathSciNet  Google Scholar 

  2. Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms: correction and extension. ACM Trans. Comput. Log. 9(3), 19:1–19:32 (2008)

    MathSciNet  MATH  Google Scholar 

  3. Börger, E.: The ASM refinement method. Formal Asp. Comput. 15(2–3), 237–257 (2003)

    Article  Google Scholar 

  4. Börger, E., Raschke, A.: Modeling Companion for Software Practitioners. Springer, Heidelberg (2018). https://doi.org/10.1007/978-3-662-56641-1

    Book  Google Scholar 

  5. Börger, E., Stärk, R.: Abstract State Machines. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-642-18216-7

    Book  MATH  Google Scholar 

  6. Chong, F.T., Franklin, D., Martonosi, M.: Programming languages and compiler design for realistic quantum hardware. Nature 549(7671), 180–187 (2017). https://doi.org/10.1038/nature23459

    Article  Google Scholar 

  7. Ferrarotti, F., Schewe, K., Tec, L., Wang, Q.: A new thesis concerning synchronised parallel computing - simplified parallel ASM thesis. Theor. Comput. Sci. 649, 25–53 (2016)

    Article  MathSciNet  Google Scholar 

  8. Grädel, E., Nowack, A.: Quantum computing and abstract state machines. In: Börger, E., Gargantini, A., Riccobene, E. (eds.) ASM 2003. LNCS, vol. 2589, pp. 309–323. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36498-6_18

    Chapter  MATH  Google Scholar 

  9. Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Miller, G.L. (ed.) Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, 22–24 May 1996, pp. 212–219. ACM (1996)

    Google Scholar 

  10. Gurevich, Y.: Sequential abstract-state machines capture sequential algorithms. ACM Trans. Comput. Log. 1(1), 77–111 (2000)

    Article  MathSciNet  Google Scholar 

  11. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information (10th Anniversary edition). Cambridge University Press, Cambridge (2016)

    Google Scholar 

  12. Schellhorn, G.: Verification of ASM refinements using generalized forward simulation. J. UCS 7(11), 952–979 (2001)

    MathSciNet  Google Scholar 

  13. Schellhorn, G.: Completeness of fair ASM refinement. Science of Computer Programming 76(9), 756–773 (2011)

    Google Scholar 

  14. Shi, Y.: Both toffoli and controlled-not need little help to do universal quantum computing. Quantum Inf. Comput. 3(1), 84–92 (2003)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Competence Center Hagenberg, Hagenberg, Austria

    Flavio Ferrarotti

  2. TM Connected, Linz, Austria

    Sénen González

Authors
  1. Flavio Ferrarotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sénen González
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Flavio Ferrarotti .

Editor information

Editors and Affiliations

  1. Institut für Softwaretechnik und Programmiersprachen, University of Ulm, Ulm, Germany

    Alexander Raschke

  2. Dipartimento di Informatica, Università degli Studi di Milano, Crema, Italy

    Elvinia Riccobene

  3. UIUC Institute, Zhejiang University, Haining, China

    Klaus-Dieter Schewe

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ferrarotti, F., González, S. (2021). ASM Specification and Refinement of a Quantum Algorithm. In: Raschke, A., Riccobene, E., Schewe, KD. (eds) Logic, Computation and Rigorous Methods. Lecture Notes in Computer Science(), vol 12750. Springer, Cham. https://doi.org/10.1007/978-3-030-76020-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-76020-5_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-76019-9

  • Online ISBN: 978-3-030-76020-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics