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

Communications in computer and information science

Patterns for Hybrid Quantum Algorithms

Manuela Weigold, Johanna Barzen, Frank Leymann, Daniel Vietz

Published Jan 1, 2021• 29 citations
Publisher
DOI
10.1007/978-3-030-87568-8_2

Related papers

Operations Patterns for Hybrid Quantum Applications

Martin Beisel, Johanna Barzen, Frank Leymann +1 more

International Conference on Cloud Computing and Services Science•Jan 1, 2025•2 citations

Quantum Enhanced Pattern Search Optimization

Colton Mikes, Ismael R. de Farias, David H. Gutman +1 more

This paper introduces a quantum-classical hybrid algorithm for generalized pattern search (GPS) algorithms. We introduce a quantum search step algorithm using amplitude amplification, which reduces the number of oracle calls needed during the search step from O(N) classical calls to O(N^(1/2)) quantum calls. This work addresses three fundamental issues with using a quantum search step with GPS. First we address the need to mark an improved mesh point, a requirement of the amplitude amplification algorithm. Second, we introduce a modified version of the amplitude amplification algorithm QSearch, which is guaranteed to terminate using a finite number of iterations. Third, we avoid disrupting the GPS algorithm's convergence by limiting the quantum algorithm to the search step.

arXiv:2305.01703•May 2, 2023•0 citations

Dataflows and Computational Patterns for Hybrid Quantum-Classical Scientific Computing

Ryan Landfield, Jordan J. Winetrout, Michael A. Sandoval

Hybrid quantum-classical computing has emerged as the dominant paradigm for near-term quantum applications, yet hybrid workflows are typically described by individual algorithms rather than their underlying execution behavior. We introduce the Quantum Execution Locality Framework (QELF), a qualitative framework for characterizing hybrid quantum-classical workflows according to recurring dataflow structures and quantum execution locality, the extent to which computation remains resident on the Quantum Processing Unit (QPU) before host intervention or classical synchronization. From a representative cross-section of applications, QELF identifies five recurring computational patterns with distinct locality characteristics and discusses their implications for communication overhead, workflow organization, and future hybrid computing architectures. By providing a common vocabulary for reasoning about hybrid workloads, QELF establishes a foundation for future quantitative validation and the co-design of algorithms, runtime systems, and hybrid computing architectures.

quant-pharXiv:2608.19348•Aug 21, 2026•0 citations

Fundamental Patterns for Composing Quantum Algorithms

Lavinia Stiliadou, Johanna Barzen, Martin Beisel +2 more

•Jan 1, 2025•1 citation

On quantum computational algorithms

이수준

•Jan 1, 2002•0 citations

Ordered Reliability Direct Error Pattern Testing Decoding Algorithm

Reza Hadavian, Xiaoting Huang, Dmitri V. Truhachev +3 more

We propose a new decoding algorithm for binary codes called ordered reliability direct error pattern testing (ORDEPT) which is based on completion of partial error patterns arranged in the order of likelihood. Based on ORDEPT we proposed a new adaptive-hybrid algorithm for decoding of product codes. The proposed algorithms outperform state-of-the-art decoders on various metrics for a variety of single and product-like codes.

•Oct 18, 2023•0 citations
This paper introduces a quantum-classical hybrid algorithm for generalized pattern search (GPS) algorithms. We introduce a quantum search step algorithm using amplitude amplification, which reduces the number of oracle calls needed during the search step from O(N) classical calls to O(N^(1/2)) quantum calls. This work addresses three fundamental issues with using a quantum search step with GPS. First we address the need to mark an improved mesh point, a requirement of the amplitude amplification algorithm. Second, we introduce a modified version of the amplitude amplification algorithm QSearch, which is guaranteed to terminate using a finite number of iterations. Third, we avoid disrupting the GPS algorithm's convergence by limiting the quantum algorithm to the search step.
Hybrid quantum-classical computing has emerged as the dominant paradigm for near-term quantum applications, yet hybrid workflows are typically described by individual algorithms rather than their underlying execution behavior. We introduce the Quantum Execution Locality Framework (QELF), a qualitative framework for characterizing hybrid quantum-classical workflows according to recurring dataflow structures and quantum execution locality, the extent to which computation remains resident on the Quantum Processing Unit (QPU) before host intervention or classical synchronization. From a representative cross-section of applications, QELF identifies five recurring computational patterns with distinct locality characteristics and discusses their implications for communication overhead, workflow organization, and future hybrid computing architectures. By providing a common vocabulary for reasoning about hybrid workloads, QELF establishes a foundation for future quantitative validation and the co-design of algorithms, runtime systems, and hybrid computing architectures.