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

Category-Based Error Budgeting for Heterogeneous Quantum Processors

Islam Abuqasem

Published Feb 27, 2026• 0 citations
Publisher

Abstract

Accurate characterization and structured interpretation of qubit errors are essential for advancing scalable quantum computation. In this work, we introduce a Category-Based Error Budgeting ($CBEB$) framework for systematic analysis of qubit calibration data in noisy intermediate-scale quantum ($NISQ$) processors. The proposed methodology decomposes the total error budget into physically and statistically meaningful categories, enabling quantitative evaluation of their relative contributions through two core metrics: the relative contribution rate ( $R_A$ ) and the disproportionality factor ( $D_A$).Beyond static categorization, the framework incorporates correlation-aware analysis by constructing covariance structures derived from two-qubit gate errors, allowing error interdependencies to be explicitly modeled. We further integrate the budgeting formalism into decoder weight assignment strategies and compare three decoding models: uniform weighting, individual error-based weighting, and a category-correlation-aware model. Logical error rates are estimated under each scheme to evaluate performance impact.The framework is implemented as an interactive graphical analysis tool and validated using real calibration datasets from contemporary superconducting quantum processors. Results demonstrate that category-level decomposition reveals structurally dominant error sources that are not evident from aggregate statistics alone, and that correlation-aware weighting provides improved logical error rate estimation.This work establishes a principled and operational bridge between calibration diagnostics and decoder optimization, offering a scalable methodology for structured error analysis in near-term quantum hardware.

DOI
10.20944/preprints202602.1979.v1

Related papers

Characterizing Physical Error Contributions of Quantum Gates

Miha Papič, Adrian Auer, Inés de Vega

Large-scale quantum computation requires a reliable assessment of the main sources of error in the implemented quantum gates. To this aim, we provide a learning-based framework that extracts the contribution of each physical error source to the infidelity of a series of gates, together with an uncertainty estimate for every contribution. Crucially, the uncertainties provided by the underlying Gaussian Process Regression serve as a diagnostic of the assumed noise model itself: if the physical model does not fully explain the experimental observations, the framework signals this instead of returning a falsely precise error budget. We demonstrate the proposed budget learning procedure on a pair of qubits in a transmon array architecture, where we compute the error budgets of the native single- and two-qubit gates. For this purpose, we have also developed an advanced noise model based on the first-principles understanding of the error processes in current superconducting processors, including complex (e.g. non-Markovian) error sources. While the single-qubit budgets are reconstructed with high confidence, the same diagnostic reveals that even this detailed noise model does not fully capture the error dynamics of a state-of-the-art two-qubit gate --- quantitative evidence that uncertainty-aware error budgeting is necessary for the characterization of current quantum hardware.

arXiv:2305.08916•May 15, 2023•24 citations

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

Minimizing Qubit Overhead in Error-Aware Distributed Quantum Computing

Ranjani G. Sundaram, Himanshu Gupta

Scaling fault-tolerant quantum computing to practical advantage requires distributing quantum circuits across networks of heterogeneous processors. However, managing physical qubit overhead while satisfying strict logical error targets remains a critical bottleneck. We introduce the Error-Aware Distributed Quantum Computing (EA-DQC) problem, a unified framework for minimizing the physical footprint of distributed circuits under global error and per-processor capacity constraints. To drive our algorithm design and enable formal performance guarantees, we leverage an aggregation model that frames single-qubit allocation as a Generalized Assignment Problem (GAP), allowing us to prove the optimality of our main algorithm (BPF) in several hardware-specific cases. We also consider the generalized setting of multi-qubit block-encodings, which introduce sub-additive costs and non-monotonic scaling that break standard assignment frameworks, necessitating a density-aware algorithm (BCF-Set) to exploit synergistic resource efficiencies. We evaluate our framework on a diverse set of synthetic and benchmark circuits (QFT, QPE, GHZ) across heterogeneous network topologies. Our results show that our combinatorial heuristics achieve up to a 50% reduction in physical-qubit overhead compared to stochastic baselines such as Simulated Annealing. This work provides a rigorous bridge between quantum error correction and classical optimization, offering a scalable path for resource-efficient faulttolerant distributed quantum architectures.

IEEE International Conference on Distributed Computing Systems (ICDCS)•Jun 1, 2026•0 citations

A Cross-Platform Analysis of Practical Quantum Error Correction Codes

Bryan Pan, Yufeng Xin

The theory of quantum error correction was established decades ago. Yet limitations in physical noise levels and available physical-qubit counts continue to hinder the development of scalable quantum computing systems. In this paper, we present analytical estimates of logical error rates for advanced QEC codes across leading hardware platforms and distributed quantum computing systems using a simple but unified framework. The analysis captures dominant contributors to logical error, including effective circuit volume and two-qubit gate overhead. The framework provides a fast and conservative estimate of logical error rates and identification of dominating factors in different hardware platforms, such as circuit volume, routing overhead, inter-QPU operations, or asymmetric noise protection. We show that several qualitative trends observed in larger-scale simulations can be reproduced and interpreted analytically within this framework. We further demonstrate that the framework can be used to find the sweet spot design region of distributed QEC, which is critical for the design of distributed quantum computing systems.

quant-pharXiv:2607.04082•Jul 7, 2026•0 citations

Integrated Tool Set for Control, Calibration, and Characterization of Quantum Devices Applied to Superconducting Qubits

Nicolas Wittler, Federico Roy, Kevin Pack +6 more

Efforts to scale-up quantum computation have reached a point where the principal limiting factor is not the number of qubits, but the entangling gate infidelity. However, the highly detailed system characterization required to understand the underlying error sources is an arduous process and impractical with increasing chip size. Open-loop optimal control techniques allow for the improvement of gates but are limited by the models they are based on. To rectify the situation, we provide an integrated open-source tool set for control, calibration, and characterization (${\mathbb{C}}^{3}$), capable of open-loop pulse optimization, model-free calibration, model fitting, and refinement. We present a methodology to combine these tools to find a quantitatively accurate system model, high-fidelity gates, and an approximate error budget, all based on a high-performance, feature-rich simulator. We illustrate our methods using simulated fixed-frequency superconducting qubits for which we learn model parameters with less than $1\mathrm{%}$ error and derive a coherence-limited cross-resonance gate that achieves $99.6\mathrm{%}$ fidelity without the need for calibration.

arXiv:2009.09866•Physical Review Applied•Mar 29, 2021•108 citations

Echo Cross Resonance gate error budgeting on a superconducting quantum processor

Travers Ward, Russell P. Rundle, Richard Bounds +9 more

High fidelity quantum operations are key to enabling fault-tolerant quantum computation. Superconducting quantum processors have demonstrated high-fidelity operations, but on larger devices there is commonly a broad distribution of qualities, with the low-performing tail affecting near-term performance and applications. Here we present an error budgeting procedure for the native two-qubit operation on a 32-qubit superconducting-qubit-based quantum computer, the OQC Toshiko gen-1 system. We estimate the prevalence of different forms of error such as coherent error and control qubit leakage, then apply error suppression strategies based on the most significant sources of error, making use of pulse-shaping and additional compensating gates. These techniques require no additional hardware overhead and little additional calibration, making them suitable for routine adoption. An average reduction of 3.7x in error rate for two qubit operations is shown across a chain of 16 qubits, with the median error rate improving from 4.6$\%$ to 1.2$\%$ as measured by interleaved randomized benchmarking. The largest improvements are seen on previously under-performing qubit pairs, demonstrating the importance of practical error suppression in reducing the low-performing tail of gate qualities and achieving consistently good performance across a device.

quant-pharXiv:2601.20458•Jan 29, 2026•5 citations
Accurate characterization and structured interpretation of qubit errors are essential for advancing scalable quantum computation. In this work, we introduce a Category-Based Error Budgeting (CBEBCBEBCBEB) framework for systematic analysis of qubit calibration data in noisy intermediate-scale quantum (NISQNISQNISQ) processors. The proposed methodology decomposes the total error budget into physically and statistically meaningful categories, enabling quantitative evaluation of their relative contributions through two core metrics: the relative contribution rate ( RAR_ARA​ ) and the disproportionality factor ( DAD_ADA​).Beyond static categorization, the framework incorporates correlation-aware analysis by constructing covariance structures derived from two-qubit gate errors, allowing error interdependencies to be explicitly modeled. We further integrate the budgeting formalism into decoder weight assignment strategies and compare three decoding models: uniform weighting, individual error-based weighting, and a category-correlation-aware model. Logical error rates are estimated under each scheme to evaluate performance impact.The framework is implemented as an interactive graphical analysis tool and validated using real calibration datasets from contemporary superconducting quantum processors. Results demonstrate that category-level decomposition reveals structurally dominant error sources that are not evident from aggregate statistics alone, and that correlation-aware weighting provides improved logical error rate estimation.This work establishes a principled and operational bridge between calibration diagnostics and decoder optimization, offering a scalable methodology for structured error analysis in near-term quantum hardware.
Large-scale quantum computation requires a reliable assessment of the main sources of error in the implemented quantum gates. To this aim, we provide a learning-based framework that extracts the contribution of each physical error source to the infidelity of a series of gates, together with an uncertainty estimate for every contribution. Crucially, the uncertainties provided by the underlying Gaussian Process Regression serve as a diagnostic of the assumed noise model itself: if the physical model does not fully explain the experimental observations, the framework signals this instead of returning a falsely precise error budget. We demonstrate the proposed budget learning procedure on a pair of qubits in a transmon array architecture, where we compute the error budgets of the native single- and two-qubit gates. For this purpose, we have also developed an advanced noise model based on the first-principles understanding of the error processes in current superconducting processors, including complex (e.g. non-Markovian) error sources. While the single-qubit budgets are reconstructed with high confidence, the same diagnostic reveals that even this detailed noise model does not fully capture the error dynamics of a state-of-the-art two-qubit gate --- quantitative evidence that uncertainty-aware error budgeting is necessary for the characterization of current quantum hardware.
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.
Scaling fault-tolerant quantum computing to practical advantage requires distributing quantum circuits across networks of heterogeneous processors. However, managing physical qubit overhead while satisfying strict logical error targets remains a critical bottleneck. We introduce the Error-Aware Distributed Quantum Computing (EA-DQC) problem, a unified framework for minimizing the physical footprint of distributed circuits under global error and per-processor capacity constraints. To drive our algorithm design and enable formal performance guarantees, we leverage an aggregation model that frames single-qubit allocation as a Generalized Assignment Problem (GAP), allowing us to prove the optimality of our main algorithm (BPF) in several hardware-specific cases. We also consider the generalized setting of multi-qubit block-encodings, which introduce sub-additive costs and non-monotonic scaling that break standard assignment frameworks, necessitating a density-aware algorithm (BCF-Set) to exploit synergistic resource efficiencies. We evaluate our framework on a diverse set of synthetic and benchmark circuits (QFT, QPE, GHZ) across heterogeneous network topologies. Our results show that our combinatorial heuristics achieve up to a 50% reduction in physical-qubit overhead compared to stochastic baselines such as Simulated Annealing. This work provides a rigorous bridge between quantum error correction and classical optimization, offering a scalable path for resource-efficient faulttolerant distributed quantum architectures.
The theory of quantum error correction was established decades ago. Yet limitations in physical noise levels and available physical-qubit counts continue to hinder the development of scalable quantum computing systems. In this paper, we present analytical estimates of logical error rates for advanced QEC codes across leading hardware platforms and distributed quantum computing systems using a simple but unified framework. The analysis captures dominant contributors to logical error, including effective circuit volume and two-qubit gate overhead. The framework provides a fast and conservative estimate of logical error rates and identification of dominating factors in different hardware platforms, such as circuit volume, routing overhead, inter-QPU operations, or asymmetric noise protection. We show that several qualitative trends observed in larger-scale simulations can be reproduced and interpreted analytically within this framework. We further demonstrate that the framework can be used to find the sweet spot design region of distributed QEC, which is critical for the design of distributed quantum computing systems.
Efforts to scale-up quantum computation have reached a point where the principal limiting factor is not the number of qubits, but the entangling gate infidelity. However, the highly detailed system characterization required to understand the underlying error sources is an arduous process and impractical with increasing chip size. Open-loop optimal control techniques allow for the improvement of gates but are limited by the models they are based on. To rectify the situation, we provide an integrated open-source tool set for control, calibration, and characterization (C3{\mathbb{C}}^{3}C3), capable of open-loop pulse optimization, model-free calibration, model fitting, and refinement. We present a methodology to combine these tools to find a quantitatively accurate system model, high-fidelity gates, and an approximate error budget, all based on a high-performance, feature-rich simulator. We illustrate our methods using simulated fixed-frequency superconducting qubits for which we learn model parameters with less than $1\mathrm{%}$ error and derive a coherence-limited cross-resonance gate that achieves $99.6\mathrm{%}$ fidelity without the need for calibration.
High fidelity quantum operations are key to enabling fault-tolerant quantum computation. Superconducting quantum processors have demonstrated high-fidelity operations, but on larger devices there is commonly a broad distribution of qualities, with the low-performing tail affecting near-term performance and applications. Here we present an error budgeting procedure for the native two-qubit operation on a 32-qubit superconducting-qubit-based quantum computer, the OQC Toshiko gen-1 system. We estimate the prevalence of different forms of error such as coherent error and control qubit leakage, then apply error suppression strategies based on the most significant sources of error, making use of pulse-shaping and additional compensating gates. These techniques require no additional hardware overhead and little additional calibration, making them suitable for routine adoption. An average reduction of 3.7x in error rate for two qubit operations is shown across a chain of 16 qubits, with the median error rate improving from 4.6%\%% to 1.2%\%% as measured by interleaved randomized benchmarking. The largest improvements are seen on previously under-performing qubit pairs, demonstrating the importance of practical error suppression in reducing the low-performing tail of gate qualities and achieving consistently good performance across a device.