Towards a Pattern Language for Quantum Algorithms | SpringerLink
Skip to main content
Springer Nature Link
Log in

Towards a Pattern Language for Quantum Algorithms

  • Conference paper
  • First Online:
Quantum Technology and Optimization Problems (QTOP 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11413))

Included in the following conference series:

Abstract

Creating quantum algorithms is a difficult task, especially for computer scientist not used to quantum computing. But quantum algorithms often use similar elements. Thus, these elements provide proven solutions to recurring problems, i.e. a pattern language. Sketching such a language is a step towards establishing a software engineering discipline of quantum algorithms.

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
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 8579
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 10724
Price includes VAT (Japan)
  • 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

Similar content being viewed by others

References

  1. Alexander, Ch., Ishikawa, S., Silverstein, M.: A Pattern Language - Towns Buildings Construction. Oxford University Press, Oxford (1977)

    Google Scholar 

  2. Anschuetz, E.R., Olson, J.P., Aspuru-Guzik, A., Cao, Y.: Variational quantum factoring. arXiv:1808.08927 (2018)

  3. Biham, E., Brassard, G., Kenigsberg, D., Mor, T.: Quantum computing without entanglement. Theor. Comput. Sci. 320, 15–33 (2004)

    Article  MathSciNet  Google Scholar 

  4. Brassard, G., Hoyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. arXiv:quant-ph/0005055v1 (2000)

  5. Bruß, D., Macchiavello, C.: Multipartite entanglement in quantum algorithms. Phys. Rev. 83(5), 052313 (2011)

    Article  Google Scholar 

  6. Coles, P.J., et al.: Quantum algorithm implementations for beginners. CoRR abs/1804.03719 (2018)

    Google Scholar 

  7. Cortese, J.A., Braje, T.M.: Loading classical data into a quantum computer. arXiv:1803.01958v1 (2018)

  8. Dervovic, D., Herbster, M., Mountney, P., Severini, S., Usher, N., Wossnig, L.: Quantum linear systems algorithms: a primer. arXiv:1802.08227v1 (2018)

  9. Falkenthal, M., et al.: Leveraging pattern applications via pattern refinement. In: Proceedings of Pursuit of Pattern Languages for Societal Change - The Workshop, Krems (2016)

    Google Scholar 

  10. Falkenthal, M., Leymann, F.: Easing pattern application by means of solution languages. In: Proceedings PATTERNS (2017)

    Google Scholar 

  11. Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv:1411.4028 (2014)

  12. Fehling, Ch., Barzen, J., Falkenthal, M., Leymann, F.: PatternPedia - collaborative pattern identification and authoring. In: Proceedings of Pursuit of Pattern Languages for Societal Change - The Workshop, Krems (2014)

    Google Scholar 

  13. Fehling, Ch., Leymann, F., Retter, R., Schupeck, W., Arbitter, P.: Cloud Computing Patterns. Springer, Vienna (2014). https://doi.org/10.1007/978-3-7091-1568-8

    Book  Google Scholar 

  14. Gilyén, A., Arunachalam, S., Wiebe, N.: Optimizing quantum optimization algorithms via faster quantum gradient computation. arXiv:1711.00465v3 (2018)

  15. Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for solving linear systems of equations. arXiv:0811.3171v3 (2009)

  16. Jozsa, R.: An introduction to measurement based quantum computation. Quantum Inf. Proces. 199, 137–158 (2006)

    Google Scholar 

  17. Jozsa, R., Linden, N.: On the role of entanglement in quantum computational speed-up. arXiv:quant-ph/0201143v2 (2002)

  18. Kerenidis, I., Prakash, A.: Quantum recommendation systems. arXiv:1603.08675v3 (2016)

  19. Lipton, R.J., Regan, K.W.: Quantum Algorithms via Linear Algebra. MIT Press, Cambridge (2014)

    MATH  Google Scholar 

  20. Mosca, M.: Quantum algorithms. arXiv:0808.0369v1 (2008)

  21. Nielson, M.A., Chuang, I.L.: Quantum Computation and Quantum Information (10th Anniversary Edition). Cambridge University Press, Cambridge (2010)

    Book  Google Scholar 

  22. Preskill, J.: Quantum Computing in the NISQ era and beyond. Quantum 2, 79 (2018)

    Article  Google Scholar 

  23. Proos, J., Zalka, Ch.: Shor’s discrete logarithm quantum algorithm for elliptic curves. arXiv:quant-ph/0301141v2 (2004)

  24. Rieffel, E., Polak, W.: Quantum Computing - A Gentle Introduction. MIT Press, Cambridge (2014)

    MATH  Google Scholar 

  25. Sanders, Y.R., Low, G.H., Scherer, A., Berry, D.W.: Black-box quantum state preparation without arithmetic. arXiv:1807.03206v1 (2018)

  26. Thompson, J., Gu, M., Modi, K., Vedral, V.: Quantum computing with black-box subroutines. arXiv:1310.2927v5 (2013)

  27. Zdun, U.: Systematic pattern selection using pattern language grammars and design space analysis. Softw.: Pract. Exp. 37(9), 983–1016 (2007)

    Google Scholar 

Download references

Acknowledgements

I am very grateful to Johanna Barzen and Michael Falkenthal for the plethora of discussions about pattern languages and their use in different domains.

Author information

Authors and Affiliations

  1. IAAS, University of Stuttgart, Universitätsstr. 38, 70569, Stuttgart, Germany

    Frank Leymann

Authors
  1. Frank Leymann
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Frank Leymann .

Editor information

Editors and Affiliations

  1. Ludwig-Maximilians-Universität München, Munich, Germany

    Sebastian Feld

  2. Ludwig-Maximilians-Universität München, Munich, Germany

    Claudia Linnhoff-Popien

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Leymann, F. (2019). Towards a Pattern Language for Quantum Algorithms. In: Feld, S., Linnhoff-Popien, C. (eds) Quantum Technology and Optimization Problems. QTOP 2019. Lecture Notes in Computer Science(), vol 11413. Springer, Cham. https://doi.org/10.1007/978-3-030-14082-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-14082-3_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-14081-6

  • Online ISBN: 978-3-030-14082-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation