HQPEF-Py: Metrics, Python Patterns, and Guidance for Evaluating Hybrid Quantum Programs

• URL: http://arxiv.org/abs/2511.18506v1
• Date: Sun, 23 Nov 2025 15:47:43 GMT
• Title: HQPEF-Py: Metrics, Python Patterns, and Guidance for Evaluating Hybrid Quantum Programs
• Abstract summary: We study how to evaluate hybrid quantum programs as end-to-end rather than as isolated devices or algorithms.<n>We formalize a workflow-aware Quantum Readiness Level (QRL) score; define a normalized speedup under quality constraints for the Utility of Quantumness (UQ)<n>We complement these definitions with concise Python reference implementations that illustrate how to instantiate the metrics and audit procedures.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: We study how to evaluate hybrid quantum programs as end-to-end workflows rather than as isolated devices or algorithms. Building on the Hybrid Quantum Program Evaluation Framework (HQPEF), we formalize a workflow-aware Quantum Readiness Level (QRL) score; define a normalized speedup under quality constraints for the Utility of Quantumness (UQ); and provide a timing-and-drift audit for hybrid pipelines. We complement these definitions with concise Python reference implementations that illustrate how to instantiate the metrics and audit procedures with state-of-the-art classical and quantum solvers (e.g., via Qiskit or PennyLane), while preserving matched-budget discipline and reproducibility.

Related papers

• Dataflows and Computational Patterns for Hybrid Quantum-Classical Scientific Computing [1.7125060577264746]
  Hybrid quantum-classical computing has emerged as the dominant paradigm for near-term quantum applications.<n>We introduce the Quantum Execution Locality Framework (QELF), a framework for characterizing hybrid quantum-classical computation.
  arXiv  Detail & Related papers  (2026-08-19T18:10:01Z)
• A Quantum Multi-Programming Framework to Maximize Quantum Resources for the LUCJ Ansatz [0.0]
  We propose an approach to tackle quantum chemistry problems via quantum multi-programming of the Local Unitary Cluster Jastrow (LUCJ) anstze.<n>The ground-state energy of the molecular system is obtained via Sample-based quantum diagonalization (SQD)<n>Cross-talk is a known issue in the multi-programming frameworks and can corrupt the ground-energy estimation of the simulated systems.
  arXiv  Detail & Related papers  (2026-05-12T18:04:28Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• The EU Quantum Flagship's Key Performance Indicators for Quantum Computing [0.12099984425168675]
  We present a suite of scalable quantum computing benchmarks developed as key performance indicators (KPIs) within the EU Quantum Flagship.<n>These benchmarks are designed to assess holistic system performance rather than isolated components.
  arXiv  Detail & Related papers  (2025-12-22T18:30:06Z)
• Scalable Hardware Maturity Probe for Quantum Accelerators via Harmonic Analysis of QAOA [0.2578242050187029]
  We present a hardware-maturity probe that quantifies a device's reliability.<n>We derive closed-form upper bounds on the number of stationary points in the p=1OA cost landscape for broad classes of verifiable-optimization problems.
  arXiv  Detail & Related papers  (2025-09-14T21:48:34Z)
• QFOR: A Fidelity-aware Orchestrator for Quantum Computing Environments using Deep Reinforcement Learning [19.006907700170693]
  Quantum cloud computing enables remote access to quantum processors, yet the heterogeneity and noise of quantum hardware complicates resource orchestration.<n>Here, we propose QFOR, a Quantum Fidelityaware Orchestration of tasks across heterogeneous quantum nodes in cloud-based environments using Deep Reinforcement learning.<n>Our framework balances overall quantum task execution fidelity and time, enabling adaptation to different operational priorities.
  arXiv  Detail & Related papers  (2025-08-07T02:00:50Z)
• Quantum Executor: A Unified Interface for Quantum Computing [46.36953285198747]
  Quantum Executor is a backend-agnostic execution engine designed to orchestrate quantum experiments across heterogeneous platforms.<n>Key features include support for asynchronous and distributed execution, customizable execution strategies and a unified API for managing quantum experiments.
  arXiv  Detail & Related papers  (2025-07-10T09:55:32Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Bayesian Quantum Amplitude Estimation [46.03321798937855]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Dynamic Resource Allocation with Quantum Error Detection [8.436934066461625]
  We propose a novel resource allocation framework that applies Pauli checks.<n>In this paper, we highlight their potential to infer the noise characteristics of a quantum system.<n>We show that dynamic quantum resource allocation with Pauli checks can outperform state-of-art mapping techniques.
  arXiv  Detail & Related papers  (2024-08-10T14:21:45Z)
• Mapping quantum circuits to shallow-depth measurement patterns based on graph states [0.0]
  We create a hybrid simulation technique for measurement-based quantum computing. We show that groups of fully commuting operators can be implemented using fully-parallel, i.e., non-adaptive, measurements. We discuss how such circuits can be implemented in constant quantum depths by employing quantum teleportation.
  arXiv  Detail & Related papers  (2023-11-27T19:00:00Z)
• Potential and limitations of quantum extreme learning machines [55.41644538483948]
  We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements. Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
  arXiv  Detail & Related papers  (2022-10-03T09:32:28Z)
• Estimating the degree of non-Markovianity using variational quantum circuits [0.0]
  We propose to use a qubit as a probe to estimate the degree of non-Markovianity of the environment. We find an optimal sequence of qubit-environment interactions that yield accurate estimations.
  arXiv  Detail & Related papers  (2022-02-28T17:14:46Z)
• QuaSiMo: A Composable Library to Program Hybrid Workflows for Quantum Simulation [48.341084094844746]
  We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
  arXiv  Detail & Related papers  (2021-05-17T16:17:57Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• Composable Programming of Hybrid Workflows for Quantum Simulation [48.341084094844746]
  We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
  arXiv  Detail & Related papers  (2021-01-20T14:20:14Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.