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

International Conference on Cloud Computing and Services Science

Analysis and Rewrite of Quantum Workflows: Improving the Execution of Hybrid Quantum Algorithms

Benjamin Weder, Johanna Barzen, Martin Beisel, Frank Leymann

Published Jan 1, 2022• 11 citations
Publisher
DOI
10.5220/0011035100003200

Related papers

A Reproducible Evaluation Framework for Quantum Algorithms and Hybrid Scientific Workflows

Softquantus

A Reproducible Evaluation Framework for QuantumAlgorithms and Hybrid Scientific Workflows

•Oct 12, 2026•0 citations

Provenance-Preserving Analysis and Rewrite of Quantum Workflows for Hybrid Quantum Algorithms

Benjamin Weder, Johanna Barzen, Martin Beisel +1 more

Abstract Quantum applications are hybrid, i.e., they comprise quantum and classical programs, which must be orchestrated. Workflows are a proven solution for orchestrating heterogeneous programs while providing benefits, such as robustness or scalability. However, the orchestration using workflows can be inefficient for some quantum algorithms, requiring the execution of quantum and classical programs in a loop. Hybrid runtimes are offered to efficiently execute these algorithms. For this, the quantum and classical programs are combined in a single hybrid program, for which the execution is optimized. However, this leads to a conceptual gap between the modeling benefits of workflow technologies, e.g., modularization, reuse, and understandability, and the efficiency improvements when using hybrid runtimes. To close this gap, we introduce a method to model all tasks explicitly in the workflow model and analyze the workflow to detect parts of the workflow that can benefit from hybrid runtimes. Furthermore, corresponding hybrid programs are automatically generated based on the quantum and classical programs, and the workflow is rewritten to invoke them. To ease the live monitoring and later analysis of workflow executions, we integrate process views into our method and collect related provenance data. Thus, the user can visualize and monitor the workflow in the original and rewritten form within the workflow engine. The practical feasibility of our approach is validated by a prototypical implementation, a case study, and a runtime evaluation.

SN Computer Science•Feb 23, 2023•18 citations

Patterns for Hybrid Quantum Algorithms

Manuela Weigold, Johanna Barzen, Frank Leymann +1 more

Communications in computer and information science•Jan 1, 2021•30 citations

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•3 citations

Observability Architecture for Quantum-Centric Supercomputing Workflows

Naoki Kanazawa, Yuto Morohoshi, Hitomi Takahashi +3 more

Quantum-centric supercomputing (QCSC) workflows often involve hybrid classical-quantum algorithms that are inherently probabilistic and executed on remote quantum hardware, making them difficult to interpret and limiting the ability to monitor runtime performance and behavior. The high cost of quantum circuit execution and large-scale high-performance computing (HPC) infrastructure further restricts the number of feasible trials, making comprehensive evaluation of execution results essential for iterative development. We propose an observability architecture tailored for QCSC workflows that decouples telemetry collection from workload execution, enabling persistent monitoring across system and algorithmic layers and retaining detailed execution data for reproducible and retrospective analysis, eliminating redundant runs. Applied to a representative workflow involving sample-based quantum diagonalization, our system reveals solver behavior across multiple iterations. This approach enhances transparency and reproducibility in QCSC environments, supporting infrastructure-aware algorithm design and systematic experimentation.

quant-pharXiv:2512.05484•Dec 8, 2025•3 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
Abstract Quantum applications are hybrid, i.e., they comprise quantum and classical programs, which must be orchestrated. Workflows are a proven solution for orchestrating heterogeneous programs while providing benefits, such as robustness or scalability. However, the orchestration using workflows can be inefficient for some quantum algorithms, requiring the execution of quantum and classical programs in a loop. Hybrid runtimes are offered to efficiently execute these algorithms. For this, the quantum and classical programs are combined in a single hybrid program, for which the execution is optimized. However, this leads to a conceptual gap between the modeling benefits of workflow technologies, e.g., modularization, reuse, and understandability, and the efficiency improvements when using hybrid runtimes. To close this gap, we introduce a method to model all tasks explicitly in the workflow model and analyze the workflow to detect parts of the workflow that can benefit from hybrid runtimes. Furthermore, corresponding hybrid programs are automatically generated based on the quantum and classical programs, and the workflow is rewritten to invoke them. To ease the live monitoring and later analysis of workflow executions, we integrate process views into our method and collect related provenance data. Thus, the user can visualize and monitor the workflow in the original and rewritten form within the workflow engine. The practical feasibility of our approach is validated by a prototypical implementation, a case study, and a runtime evaluation.
Quantum-centric supercomputing (QCSC) workflows often involve hybrid classical-quantum algorithms that are inherently probabilistic and executed on remote quantum hardware, making them difficult to interpret and limiting the ability to monitor runtime performance and behavior. The high cost of quantum circuit execution and large-scale high-performance computing (HPC) infrastructure further restricts the number of feasible trials, making comprehensive evaluation of execution results essential for iterative development. We propose an observability architecture tailored for QCSC workflows that decouples telemetry collection from workload execution, enabling persistent monitoring across system and algorithmic layers and retaining detailed execution data for reproducible and retrospective analysis, eliminating redundant runs. Applied to a representative workflow involving sample-based quantum diagonalization, our system reveals solver behavior across multiple iterations. This approach enhances transparency and reproducibility in QCSC environments, supporting infrastructure-aware algorithm design and systematic experimentation.
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.