Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1906.03082

Towards a Pattern Language for Quantum Algorithms

Frank Leymann

Published Jun 5, 2019• 1 citation
arXivHTMLPDF

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.

DOI
10.48550/arxiv.1906.03082

Related papers

Quantum computing for software engineering: prospects

Andriy V. Miranskyy, Mushahid Khan, Jean Paul Latyr Faye +1 more

Quantum computers (QCs) are maturing. When QCs are powerful enough, they may be able to handle problems in chemistry, physics, and finance that are not classically solvable. However, the applicability of quantum algorithms to speed up Software Engineering (SE) tasks has not been explored. We examine eight groups of quantum algorithms that may accelerate SE tasks across the different phases of SE and sketch potential opportunities and challenges.

arXiv:2203.03575•Nov 7, 2022•13 citations

Pattern-Based Generation and Adaptation of Quantum Workflows

Martin Beisel, Johanna Barzen, Frank Leymann +3 more

Building quantum applications requires deep knowledge of quantum computing and software engineering. Hence, an abstraction layer reducing the complexity for non-experts is needed. Patterns are an established concept for the abstract description of proven solutions to recurring problems. Therefore, the quantum computing patterns, a pattern language for the quantum computing domain, can be used to define the building blocks and the structure of hybrid quantum applications. Furthermore, concrete software artifacts can be associated with patterns to solve the corresponding problem. However, these software artifacts are usually heterogeneous, e.g., using different data formats. Quantum workflows enable a robust and scalable orchestration of these heterogeneous software artifacts. However, manually modeling and configuring such quantum workflows is a complex, error-prone, and time-consuming task. To overcome this issue, we present an approach that automates the generation and adaptation of quantum workflows using the quantum computing patterns. We provide an architecture realizing our approach, a corresponding prototype, as well as an evaluation comprising different use cases, a runtime comparison, and a user study.

ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)•Apr 26, 2025•1 citation

On the Definition of Quantum Programming Modules

Pedro Sánchez, Diego Alonso

There are no doubts that quantum programming and, in general, quantum computing, is one of the most promising areas within computer science and one of the areas where most expectations are being placed in recent years. Although the days when reliable and affordable quantum computers will be available is still a long way off, the explosion of programming languages for quantum programming has grown exponentially in recent years. The software engineering community has been quick to react to the need to adopt and adapt well-known tools and methods for software development, and for the design of new ones tailored to this new programming paradigm. However, many key aspects for its success depend on the establishment of an appropriate conceptual framework for the conception and design of quantum programs. This article discusses the concept of module, key in the software engineering discipline, and establishes initial criteria for determining the cohesion and coupling levels of a module in the field of quantum programming as a first step towards a sound quantum software engineering. As detailed in the article, the conceptual differences between classical and quantum computing are so pronounced that the translation of classical concepts to the new programming approach is not straightforward.

Applied Sciences•Jun 23, 2021•17 citations

Simulation of Quantum Algorithms with a Symbolic Programming Language

Peter Nyman

This study examines the simulation of quantum algorithms on a classical computer. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational methods. The computational language will include formulations such as quantum state, superposition and quantum operator.

arXiv:0705.3333•May 23, 2007•11 citations

Harnessing Patterns to Support the Development of Hybrid Quantum Applications

Daniel Vietz, Johanna Barzen, Martin Beisel +3 more

Quantum computing provides computational advantages in various domains.To benefit from these advantages complex hybrid quantum applications must be built, which comprise both quantum and classical programs.Engineering these applications requires immense expertise in physics, mathematics, and software engineering.To facilitate the development of quantum applications, a corresponding quantum computing pattern language providing proven solutions to recurring problems has been presented.However, identifying suitable patterns for tackling a specific application scenario and subsequently combining them in an application is a time-consuming manual task.To overcome this issue, we present an approach that enables (i) the automated detection of patterns solving a given problem, (ii) the selection of suitable implementations fulfilling non-functional requirements of the user, and (iii) the automated aggregation of these solutions into an executable quantum application.

arXiv:2507.00696•International Conference on Software and Computer Applications (ICSCA)•Feb 20, 2025•2 citations

Quantum Algorithms

Ted G. Lewis

This essay was written for computer scientists seeking to understand quantum computing from an algorithmic point of view. It sacrifices rigorous physics so anyone with a computer science background can understand it. Note that it is about algorithms, not machines. This is intentional.

Ubiquity•Mar 1, 2024•0 citations
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.
Building quantum applications requires deep knowledge of quantum computing and software engineering. Hence, an abstraction layer reducing the complexity for non-experts is needed. Patterns are an established concept for the abstract description of proven solutions to recurring problems. Therefore, the quantum computing patterns, a pattern language for the quantum computing domain, can be used to define the building blocks and the structure of hybrid quantum applications. Furthermore, concrete software artifacts can be associated with patterns to solve the corresponding problem. However, these software artifacts are usually heterogeneous, e.g., using different data formats. Quantum workflows enable a robust and scalable orchestration of these heterogeneous software artifacts. However, manually modeling and configuring such quantum workflows is a complex, error-prone, and time-consuming task. To overcome this issue, we present an approach that automates the generation and adaptation of quantum workflows using the quantum computing patterns. We provide an architecture realizing our approach, a corresponding prototype, as well as an evaluation comprising different use cases, a runtime comparison, and a user study.
There are no doubts that quantum programming and, in general, quantum computing, is one of the most promising areas within computer science and one of the areas where most expectations are being placed in recent years. Although the days when reliable and affordable quantum computers will be available is still a long way off, the explosion of programming languages for quantum programming has grown exponentially in recent years. The software engineering community has been quick to react to the need to adopt and adapt well-known tools and methods for software development, and for the design of new ones tailored to this new programming paradigm. However, many key aspects for its success depend on the establishment of an appropriate conceptual framework for the conception and design of quantum programs. This article discusses the concept of module, key in the software engineering discipline, and establishes initial criteria for determining the cohesion and coupling levels of a module in the field of quantum programming as a first step towards a sound quantum software engineering. As detailed in the article, the conceptual differences between classical and quantum computing are so pronounced that the translation of classical concepts to the new programming approach is not straightforward.
Quantum computing provides computational advantages in various domains.To benefit from these advantages complex hybrid quantum applications must be built, which comprise both quantum and classical programs.Engineering these applications requires immense expertise in physics, mathematics, and software engineering.To facilitate the development of quantum applications, a corresponding quantum computing pattern language providing proven solutions to recurring problems has been presented.However, identifying suitable patterns for tackling a specific application scenario and subsequently combining them in an application is a time-consuming manual task.To overcome this issue, we present an approach that enables (i) the automated detection of patterns solving a given problem, (ii) the selection of suitable implementations fulfilling non-functional requirements of the user, and (iii) the automated aggregation of these solutions into an executable quantum application.