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:2605.02966

QBalance: A Reproducible Multi-Objective Workflow for Quantum Compilation, Noise Suppression, and Error-Mitigation Strategy Selection

Soumyadip Sarkar

quant-phcs.MSSubmitted May 3, 2026• Announced May 5, 2026• 1 citation
arXivHTMLPDF

Abstract

Near-term quantum workloads are shaped by coupled compilation and execution choices: qubit layout, routing, basis translation, gate suppression, measurement mitigation, shot budget, and artifact reproducibility. This paper analyzes QBalance, a Python workflow library for dataset-level selection among quantum compilation, noise-suppression, and error-mitigation strategies built on the Qiskit ecosystem. The contribution is formulated as a finite multi-objective strategy-selection problem over circuits, backends, and transformation policies. The manuscript derives the implemented weighted objective, non-dominated selection rule, survival-product error proxy, Bayesian linear candidate-ordering surrogate, and distributional diagnostics. It also positions the system relative to established work on Qiskit pass-manager compilation, SABRE-style routing, randomized compiling, dynamical decoupling, zero-noise extrapolation, matrix-free measurement mitigation, circuit cutting, and Thompson sampling. The analysis shows that QBalance provides a reproducible orchestration and artifact model for quantum workflow studies. It also establishes precise limitations: the current bandit mechanism orders candidates but does not reduce the number of candidate evaluations, the custom layout heuristic is greedy and only partially topology-aware, the implemented ZNE helper is parity-centered, and the cutting integration is a hook rather than a full reconstruction pipeline.

AI Summary

QBalance addresses how to compare coupled compilation, noise-suppression, and error-mitigation choices across circuit datasets. It presents a Python workflow built on Qiskit that evaluates finite strategy sets, selects a strategy per circuit, and saves circuits, metrics, metadata, and reports. The paper analyzes version 0.1.0 through source-code inspection and mathematical derivations; it reports no executed benchmark matrix or hardware results. The default candidate generator produces at most 23 unique strategies spanning compilation settings and optional suppression, mitigation, and cutting paths. Selection minimizes $J=\mathrm{depth}+2n_{2q}+10\widehat E+0.1t_{\mathrm{compile}}$, optionally after Pareto filtering on depth, two-qubit count, and estimated error. The error proxy is $\widehat E=1-\prod_j(1-e_j)$, using calibration-derived or fallback operation errors. The analysis derives the Bayesian linear posterior used for Thompson-style candidate ordering and establishes that both grid and bandit modes attempt every candidate: candidate-evaluation count remains $O(NC)$ for $N$ circuits and $C$ strategies. Pareto filtering has quadratic worst-case cost in the number of unique metric vectors. The stated limitations separate workflow functionality from physical-performance evidence. The built-in dataset contains only Bell, three-qubit GHZ, and four-qubit QFT-like examples. The ordering model lacks circuit features; layout is greedy and only partially topology-aware; and the error proxy omits coherent and correlated noise. ZNE extrapolates parity rather than arbitrary observables, cutting lacks end-to-end reconstruction, and Runtime primitives are not used by the main workflow. Cache keys also omit software-version and calibration provenance.

Likely largely AI-generatedIncrementalMissing comparison

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Hardware-Efficient Error Mitigation and Shot-Efficient Sampling on IBM Quantum Hardware

Sumit Chongder

We experimentally study error mitigation and finite-shot sampling on superconducting quantum hardware under a constrained execution budget. The study combines calibration-aware qubit selection, circuit-depth scaling, zero-noise extrapolation, dynamical decoupling, readout-error mitigation, and repeated-shot estimation on an IBM Quantum processor. Experiments are organized across ideal simulation, noise-model simulation, and physical-device execution to separate sampling uncertainty from device-induced error. We investigate how mitigation performance changes with circuit depth, effective noise scale, qubit connectivity, and measurement budget, and quantify accuracy using expectation-value error, mean-squared error, statistical uncertainty, and mitigation gain. A fixed hardware-execution budget is used to evaluate shot allocation strategies and repeated measurements without relying on unlimited sampling. The resulting analysis provides a hardware-aware characterization of when mitigation improves expectation-value estimation and when finite-shot fluctuations offset the benefit of additional mitigation overhead. The implementation uses contemporary Qiskit and IBM Quantum Runtime workflows and is designed to provide reproducible experimental evidence for error-mitigation studies on current quantum processors.

quant-pharXiv:2608.28535•Aug 31, 2026•0 citations

Quantum Error Mitigation: A Comprehensive Survey

Ratun Rahman, Dinh C. Nguyen

Quantum noise poses a significant challenge for current near-term quantum computing. Quantum error mitigation (QEM) has therefore emerged as a key strategy, offering a practical and effective solution to reduce error impacts and enhance the performance of near-term variational quantum circuits (VQC). Given the lack of a comprehensive survey on this important topic in the literature, this article provides a dedicated overview of QEM, including both during and after the training of VQC. Specifically, during VQC training, we explore and discuss key QEM techniques such as optimal control and dynamical decoupling. For the post-processing stage of VQC, we will examine and discuss mitigation techniques such as zero-noise extrapolation (ZNE) and probabilistic error cancellation (PEC). For each of these QEM techniques, we will investigate the fundamentals, mitigation concepts, and recent advances. Subsequently, we also explore research toolboxes, including Mitiq and Qiskit Aer, as well as provide a case study that demonstrates contextual multi-armed bandit-guided ZNE. Finally, we discuss ongoing problems and future research initiatives, including ML-assisted mitigation and integration with error correction. This survey article aims to synthesize the state-of-the-art in QEM, offer organized insights across approaches, and propose potential paths towards error-resilient quantum computing.

ACM Computing Surveys•Aug 21, 2026•0 citations

Quantum Noise Mitigation with Adaptive Zero-Noise Extrapolation: A Contextual Multi-Armed Bandits Approach

Ratun Rahman, Dinh C. Nguyen

Variational quantum circuits (VQCs) are central to near-term quantum computing, yet their practical deployment is severely hindered by noise. While existing error mitigation methods, such as zero-noise extrapolation (ZNE), typically assume static noise, real noisy intermediate-scale quantum (NISQ) systems exhibit dynamic, time-varying noise that remains largely unaddressed. To overcome this critical gap, our work introduces a novel adaptive noise mitigation framework for VQCs that integrates ZNE with contextual multi-armed bandits (CMAB), enabling dynamic, context-aware selection of circuit-folding levels based on ansatz parameters (e.g., depth, parameter count) and the evolving noise environment. Unlike fixed-fold or heuristic ZNE, our approach uses online adaptation to improve the accuracy of ZNE and reduce redundant quantum circuit executions. Our extensive simulations and experiments on real quantum hardware reveal the following important properties: (i) deeper VQCs accumulate noise, degrading accuracy and increasing the number of quantum circuit executions; (ii) ZNE restores estimator fidelity when the folding level is chosen appropriately; and (iii) CMAB-guided folding cuts quantum circuit execution round trips by up to 40\%, bytes exchanged by up to 35\%, and end-to-end cost by up to 30\% under a 10~Mbps budget, with up to 6.9\% higher estimator fidelity (CIFAR-10, depth 3, noise band $η=0.05$), versus fixed-fold and grid-search ZNE. These results demonstrate substantial performance gains over existing noise mitigation methods, underscoring the effectiveness of our design in supporting robust noise mitigation for VQCs. The source code is also publicly released to support reproducibility.

quant-pharXiv:2608.06426•IEEE Journal on Selected Areas in Communications•Aug 7, 2026•2 citations

QSimBench: An Execution-Level Benchmark Suite for Quantum Software Engineering

Giuseppe Bisicchia, Alessandro Bocci, José Manuel García-Alonso +2 more

Reproducibility and comparability remain fundamental challenges in the empirical evaluation of Quantum Software Engineering (QSE) tools. These challenges arise from the intrinsic probabilistic behavior of quantum programs and the variability introduced by quantum hardware and simulator backends. While existing quantum benchmarks typically offer only static circuit definitions, they often leave researchers responsible for data generation and execution, hindering the creation of standardized and reproducible experiments. In this paper, we introduce QSimBench, a novel, open-source benchmark suite and accompanying Python library designed to address these limitations. QSimBench provides over 20 million precomputed shot-level execution traces:$\mathbf{2 0, 0 0 0}$measurements each, across$\mathbf{1 4}$quantum algorithms, multiple circuit sizes ($4-15$qubits), and six Qiskit-based backends including both ideal and noise-injected simulations. Each configuration includes not only detailed measurement histories but also the original circuit in OpenQASM, the backend's noise model, and configuration metadata, ensuring full transparency and enabling in-depth analysis. QSimBench empowers researchers to conduct scalable, reproducible, and statistically rigorous evaluations of QSE tools, such as those for monitoring, orchestration, and statistical post-processing, without the need for expensive or difficult-to-reproduce quantum executions. The benchmark is distributed with a lightweight Python API that facilitates fast data retrieval, flexible sampling strategies, and seamless integration into experimental pipelines. QSimBench is publicly available, aiming to foster collaborative and reproducible research within the quantum software community.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•2 citations

Decision-aware validation of zero-noise extrapolation in QAOA optimization landscapes

Vicenzo Scavino Alfaro

Zero-noise extrapolation (ZNE) is usually validated by the accuracy of mitigated observables, yet variational quantum optimization uses those observables to select parameters. We ask whether, and by how much, an accuracy gain from ZNE coincides with a worse decision. In depth-one simulations of the quantum approximate optimization algorithm (QAOA) for MaxCut on four to six qubits, each sampled $120\times120$ landscape yields both its mean-squared error (MSE) and the ideal regret of its selected grid minimum, comparing Richardson orders one to three with unmitigated estimation at the same total shot budget per grid point. In an exploratory screen of 675 conditions, whose per-point random seeds collide, a familywise (Holm) analysis retains only four of 540 replication conditions as showing both directional MSE improvement and regret increase. A frozen confirmation with 100 fresh paired repetitions per condition reproduces all four: median MSE improvements of 7.65-73.09% accompany median normalized regret increases of only 0.0031-0.0073. We distinguish a bias route, in which residual bias reorders the mean landscape, from a variance route, in which Richardson weights amplify finite-shot noise. Exact first and second moments on a bounded control grid find no bias-route reversal: mitigated mean landscapes preserve the ideal minima, and ZNE can more than halve expected MSE, yet finite-shot selections incur higher mean regret. Decision losses that survive strict testing are few and small in this benchmark, but reproducible and not revealed by aggregate MSE. We present a paired benchmark and recommend reporting decision regret alongside estimation error when mitigation is assessed for optimization. Results concern simulated exhaustive grids, not hardware or optimizer loops.

quant-pharXiv:2610.33386•Oct 27, 2026•0 citations

Noise-Aware Compilation for Heterogeneous NISQ Hardware: A Cross-Topology Empirical Study

Prisha Bharti, Angel Garg, Anil Singh +1 more

Noisy Intermediate-Scale Quantum (NISQ) processors exhibit substantial heterogeneity in their per-edge twoqubit gate error rates, with current-generation devices showing more than two orders of magnitude variation across their coupling map. An empirical cross-topology study of qubitmapping strategies is presented for four IBM fake backends, characterizing (i) the magnitude of calibration heterogeneity, (ii) the performance of vanilla SABRE relative to a multi-start noise-aware initial-layout selector, and (iii) the success probability decay of statically-compiled circuits under simulated calibration drift. SABRE is shown to achieve up to 74.6% CX reduction over naive routing on the largest backend evaluated. The noise-aware selector is observed to tie or marginally trail vanilla SABRE's VF2PostLayout in static-calibration evaluation, indicating that Qiskit's mature pipeline is competitive with direct error-weighted graph expansion. Drift sensitivity analysis demonstrates that statically-compiled QFT circuits lose 6-17% of their estimated success probability at high drift severity$(\sigma=0.8)$, with the noisier T-shape backend most affected. The findings highlight the parameter space where drift-aware compilation methods would be most valuable, rather than evaluating an active driftcompensation compiler.

International Symposium on VLSI Design and Test (VDAT)•Aug 1, 2026•0 citations
Near-term quantum workloads are shaped by coupled compilation and execution choices: qubit layout, routing, basis translation, gate suppression, measurement mitigation, shot budget, and artifact reproducibility. This paper analyzes QBalance, a Python workflow library for dataset-level selection among quantum compilation, noise-suppression, and error-mitigation strategies built on the Qiskit ecosystem. The contribution is formulated as a finite multi-objective strategy-selection problem over circuits, backends, and transformation policies. The manuscript derives the implemented weighted objective, non-dominated selection rule, survival-product error proxy, Bayesian linear candidate-ordering surrogate, and distributional diagnostics. It also positions the system relative to established work on Qiskit pass-manager compilation, SABRE-style routing, randomized compiling, dynamical decoupling, zero-noise extrapolation, matrix-free measurement mitigation, circuit cutting, and Thompson sampling. The analysis shows that QBalance provides a reproducible orchestration and artifact model for quantum workflow studies. It also establishes precise limitations: the current bandit mechanism orders candidates but does not reduce the number of candidate evaluations, the custom layout heuristic is greedy and only partially topology-aware, the implemented ZNE helper is parity-centered, and the cutting integration is a hook rather than a full reconstruction pipeline.
QBalance addresses how to compare coupled compilation, noise-suppression, and error-mitigation choices across circuit datasets. It presents a Python workflow built on Qiskit that evaluates finite strategy sets, selects a strategy per circuit, and saves circuits, metrics, metadata, and reports. The paper analyzes version 0.1.0 through source-code inspection and mathematical derivations; it reports no executed benchmark matrix or hardware results.
The default candidate generator produces at most 23 unique strategies spanning compilation settings and optional suppression, mitigation, and cutting paths. Selection minimizes J=depth+2n2q+10E^+0.1tcompileJ=\mathrm{depth}+2n_{2q}+10\widehat E+0.1t_{\mathrm{compile}}J=depth+2n2q​+10E+0.1tcompile​, optionally after Pareto filtering on depth, two-qubit count, and estimated error. The error proxy is E^=1−∏j(1−ej)\widehat E=1-\prod_j(1-e_j)E=1−∏j​(1−ej​), using calibration-derived or fallback operation errors. The analysis derives the Bayesian linear posterior used for Thompson-style candidate ordering and establishes that both grid and bandit modes attempt every candidate: candidate-evaluation count remains O(NC)O(NC)O(NC) for NNN circuits and CCC strategies. Pareto filtering has quadratic worst-case cost in the number of unique metric vectors.
The stated limitations separate workflow functionality from physical-performance evidence. The built-in dataset contains only Bell, three-qubit GHZ, and four-qubit QFT-like examples. The ordering model lacks circuit features; layout is greedy and only partially topology-aware; and the error proxy omits coherent and correlated noise. ZNE extrapolates parity rather than arbitrary observables, cutting lacks end-to-end reconstruction, and Runtime primitives are not used by the main workflow. Cache keys also omit software-version and calibration provenance.
We experimentally study error mitigation and finite-shot sampling on superconducting quantum hardware under a constrained execution budget. The study combines calibration-aware qubit selection, circuit-depth scaling, zero-noise extrapolation, dynamical decoupling, readout-error mitigation, and repeated-shot estimation on an IBM Quantum processor. Experiments are organized across ideal simulation, noise-model simulation, and physical-device execution to separate sampling uncertainty from device-induced error. We investigate how mitigation performance changes with circuit depth, effective noise scale, qubit connectivity, and measurement budget, and quantify accuracy using expectation-value error, mean-squared error, statistical uncertainty, and mitigation gain. A fixed hardware-execution budget is used to evaluate shot allocation strategies and repeated measurements without relying on unlimited sampling. The resulting analysis provides a hardware-aware characterization of when mitigation improves expectation-value estimation and when finite-shot fluctuations offset the benefit of additional mitigation overhead. The implementation uses contemporary Qiskit and IBM Quantum Runtime workflows and is designed to provide reproducible experimental evidence for error-mitigation studies on current quantum processors.
Quantum noise poses a significant challenge for current near-term quantum computing. Quantum error mitigation (QEM) has therefore emerged as a key strategy, offering a practical and effective solution to reduce error impacts and enhance the performance of near-term variational quantum circuits (VQC). Given the lack of a comprehensive survey on this important topic in the literature, this article provides a dedicated overview of QEM, including both during and after the training of VQC. Specifically, during VQC training, we explore and discuss key QEM techniques such as optimal control and dynamical decoupling. For the post-processing stage of VQC, we will examine and discuss mitigation techniques such as zero-noise extrapolation (ZNE) and probabilistic error cancellation (PEC). For each of these QEM techniques, we will investigate the fundamentals, mitigation concepts, and recent advances. Subsequently, we also explore research toolboxes, including Mitiq and Qiskit Aer, as well as provide a case study that demonstrates contextual multi-armed bandit-guided ZNE. Finally, we discuss ongoing problems and future research initiatives, including ML-assisted mitigation and integration with error correction. This survey article aims to synthesize the state-of-the-art in QEM, offer organized insights across approaches, and propose potential paths towards error-resilient quantum computing.
Variational quantum circuits (VQCs) are central to near-term quantum computing, yet their practical deployment is severely hindered by noise. While existing error mitigation methods, such as zero-noise extrapolation (ZNE), typically assume static noise, real noisy intermediate-scale quantum (NISQ) systems exhibit dynamic, time-varying noise that remains largely unaddressed. To overcome this critical gap, our work introduces a novel adaptive noise mitigation framework for VQCs that integrates ZNE with contextual multi-armed bandits (CMAB), enabling dynamic, context-aware selection of circuit-folding levels based on ansatz parameters (e.g., depth, parameter count) and the evolving noise environment. Unlike fixed-fold or heuristic ZNE, our approach uses online adaptation to improve the accuracy of ZNE and reduce redundant quantum circuit executions. Our extensive simulations and experiments on real quantum hardware reveal the following important properties: (i) deeper VQCs accumulate noise, degrading accuracy and increasing the number of quantum circuit executions; (ii) ZNE restores estimator fidelity when the folding level is chosen appropriately; and (iii) CMAB-guided folding cuts quantum circuit execution round trips by up to 40\%, bytes exchanged by up to 35\%, and end-to-end cost by up to 30\% under a 10~Mbps budget, with up to 6.9\% higher estimator fidelity (CIFAR-10, depth 3, noise band η=0.05η=0.05η=0.05), versus fixed-fold and grid-search ZNE. These results demonstrate substantial performance gains over existing noise mitigation methods, underscoring the effectiveness of our design in supporting robust noise mitigation for VQCs. The source code is also publicly released to support reproducibility.
Reproducibility and comparability remain fundamental challenges in the empirical evaluation of Quantum Software Engineering (QSE) tools. These challenges arise from the intrinsic probabilistic behavior of quantum programs and the variability introduced by quantum hardware and simulator backends. While existing quantum benchmarks typically offer only static circuit definitions, they often leave researchers responsible for data generation and execution, hindering the creation of standardized and reproducible experiments. In this paper, we introduce QSimBench, a novel, open-source benchmark suite and accompanying Python library designed to address these limitations. QSimBench provides over 20 million precomputed shot-level execution traces:20,000\mathbf{2 0, 0 0 0}20,000measurements each, across14\mathbf{1 4}14quantum algorithms, multiple circuit sizes (4−154-154−15qubits), and six Qiskit-based backends including both ideal and noise-injected simulations. Each configuration includes not only detailed measurement histories but also the original circuit in OpenQASM, the backend's noise model, and configuration metadata, ensuring full transparency and enabling in-depth analysis. QSimBench empowers researchers to conduct scalable, reproducible, and statistically rigorous evaluations of QSE tools, such as those for monitoring, orchestration, and statistical post-processing, without the need for expensive or difficult-to-reproduce quantum executions. The benchmark is distributed with a lightweight Python API that facilitates fast data retrieval, flexible sampling strategies, and seamless integration into experimental pipelines. QSimBench is publicly available, aiming to foster collaborative and reproducible research within the quantum software community.
Zero-noise extrapolation (ZNE) is usually validated by the accuracy of mitigated observables, yet variational quantum optimization uses those observables to select parameters. We ask whether, and by how much, an accuracy gain from ZNE coincides with a worse decision. In depth-one simulations of the quantum approximate optimization algorithm (QAOA) for MaxCut on four to six qubits, each sampled 120×120120\times120120×120 landscape yields both its mean-squared error (MSE) and the ideal regret of its selected grid minimum, comparing Richardson orders one to three with unmitigated estimation at the same total shot budget per grid point. In an exploratory screen of 675 conditions, whose per-point random seeds collide, a familywise (Holm) analysis retains only four of 540 replication conditions as showing both directional MSE improvement and regret increase. A frozen confirmation with 100 fresh paired repetitions per condition reproduces all four: median MSE improvements of 7.65-73.09% accompany median normalized regret increases of only 0.0031-0.0073. We distinguish a bias route, in which residual bias reorders the mean landscape, from a variance route, in which Richardson weights amplify finite-shot noise. Exact first and second moments on a bounded control grid find no bias-route reversal: mitigated mean landscapes preserve the ideal minima, and ZNE can more than halve expected MSE, yet finite-shot selections incur higher mean regret. Decision losses that survive strict testing are few and small in this benchmark, but reproducible and not revealed by aggregate MSE. We present a paired benchmark and recommend reporting decision regret alongside estimation error when mitigation is assessed for optimization. Results concern simulated exhaustive grids, not hardware or optimizer loops.
Noisy Intermediate-Scale Quantum (NISQ) processors exhibit substantial heterogeneity in their per-edge twoqubit gate error rates, with current-generation devices showing more than two orders of magnitude variation across their coupling map. An empirical cross-topology study of qubitmapping strategies is presented for four IBM fake backends, characterizing (i) the magnitude of calibration heterogeneity, (ii) the performance of vanilla SABRE relative to a multi-start noise-aware initial-layout selector, and (iii) the success probability decay of statically-compiled circuits under simulated calibration drift. SABRE is shown to achieve up to 74.6% CX reduction over naive routing on the largest backend evaluated. The noise-aware selector is observed to tie or marginally trail vanilla SABRE's VF2PostLayout in static-calibration evaluation, indicating that Qiskit's mature pipeline is competitive with direct error-weighted graph expansion. Drift sensitivity analysis demonstrates that statically-compiled QFT circuits lose 6-17% of their estimated success probability at high drift severity(σ=0.8)(\sigma=0.8)(σ=0.8), with the noisier T-shape backend most affected. The findings highlight the parameter space where drift-aware compilation methods would be most valuable, rather than evaluating an active driftcompensation compiler.