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

Information-Sensitive Quantum Runtime Allocation Under Workload-Reactive Noise

Christian Barker

Published May 4, 2026• 0 citations
Publisher

Abstract

We study a quantum-runtime hypothesis that is narrower than“betterqubits”andbroader than ordinary hardware-aware compilation: distinct subroutines of a quantum program may require different protection profiles and different qubit-array geometries because they carry different kinds of informational fragility. The runtime considered here classifies circuit windows into phase-sensitive, globally entangled, arithmetic, weak-signal, magic-state, and stabilizer-oriented workloads, and then allocates both protection and geometry accordingly. We evaluate this idea in simulation using hardware-informed calibration inputs, structured logical noise, explicit geometry profiles, and paired condition randomness so that ablation modes face the same seeded noise realization. The focused three-regime study uses 96 replicates across three superconducting backends and compares four runtime modes: uniform, protection-only, geometry-only, and protection-plus-geometry, each under static and workload-reactive noise. Geometry is not a universal accelerator. Instead, it behaves as a selective coherence-control variable. In the paired geometry-on-top-of-protection comparison, the strongest gains occur for global parity and weak-signal spectroscopy under mixed workload-reactive noise, with mean useful-output improvements of approximately +0.188 and +0.181, respectively. A stabilizer-specific geometry refinement converts an earlier regression into a helpful-clean result in the same regime.

DOI
10.5281/zenodo.20027290

Related papers

Empirical Characterization of Quantum Workloads on Heterogeneous Resources for Quantum Simulation

Jiwon Ha, 박숙영, Hyeonsang Eom +1 more

Quantum cloud platforms increasingly provide access to heterogeneous execution backends including real QPUs and quantum simulators. Effective backend selection is challenging because runtime and output quality vary with workload structure, backend characteristics, and noise conditions. This paper presents an empirical characterization study of how quantum workload properties shape execution across heterogeneous classical simulator backends, focusing on a CPU/GPU-based statevector simulation method. The workload characteristics examined in this study include qubit count, circuit depth, two-qubit gate density, workload class, and noise sensitivity. The experiments show qubit count and circuit depth are primary factors for simulation cost. Two-qubit gate density and workload class affect backend affinity. For example, CPU/GPU affinity in Grover varies with the depth of circuits. Shallow circuits have lower runtime on CPUs, whereas deep circuits have lower runtime on GPUs. Four backend-selection criteria (BS1-BS4) provide analytical bases to examine the effects of circuit structure, workload class, noise tiers, and measurement-derived profiles. The results show characterization-driven backend selection performs better than relying on coarse-grained workload information alone in heterogeneous quantum simulation environments.

IEEE International Conference on Cluster Computing (CLUSTER)•Sep 1, 2026•0 citations

Quantum Error Management in Practice: A Cross-Stack Benchmark

Daniel Sierra-Sosa, Begonya Garcia-Zapirain, Cristian Marquez +1 more

Quantum processors have crossed the one-hundred-qubit mark, but noise continues to limit circuit performance, while full quantum error correction remains too costly for routine use. Error suppression and mitigation therefore play an important role in extracting value from current hardware, yet independent comparisons of commercial solutions on identical workloads and devices remain scarce. We benchmark IBM Qiskit Runtime, Q-CTRL Performance Management, and Qedma QESEM on IBM Pittsburgh, a 156-qubit IBM Quantum Heron r3 processor. For Sampler workloads, we run Bernstein-Vazirani, quantum phase estimation, GHZ-state preparation, and randomized mirror circuits with up to 100 measured qubits, comparing raw execution, IBM measurement twirling, and Q-CTRL. For Estimator workloads, we measure chain-averaged magnetization and correlation observables of an eight-layer transverse-field Ising circuit at 25, 50, and 75 qubits against an exact matrix-product-state reference, comparing IBM raw execution, IBM TREX plus twirling, Q-CTRL, and QESEM. Q-CTRL produced the best results on the three structured Sampler workloads while keeping reported QPU times within the same order as the IBM configurations. Across six Ising observable and system-size cases, aggregate mean absolute error was 0.0883 for IBM raw execution, 0.0807 for IBM TREX plus twirling, 0.0285 for Q-CTRL, and 0.0188 for QESEM. Relative to raw execution, Q-CTRL and QESEM reduced aggregate error by factors of 3.10 and 4.70, respectively, while QESEM used 7.5 to 11.1 times the reported QPU time of Q-CTRL. These results show that managed error suppression and mitigation can substantially improve current hardware performance, but with distinct accuracy and execution-time tradeoffs.

quant-pharXiv:2608.05202•Aug 6, 2026•0 citations

Noise-Field Sampling and Regime Transitions in Qubit Layout Selection: Hardware Evidence on IBM Superconducting Processors

Saripudi Suneetha, Kakumani K. C. Deepthi

Qubit layout selection determining which physical qubits a logical circuit occupies on a superconducting processor is fundamentally a noise-field sampling problem. On IBM Heron r1 and Heron r2 devices, two-qubit gate error varies by nearly one order of magnitude (7– $9\times $ ) across qubit pairs on the same chip, causing measured fidelity differences up to 0.903 from layout choice alone. We introduce the Gate Noise Sensitivity Index (GNSI), a calibration-weighted linear combination of per-qubit readout error and per-edge two-qubit gate error, derived analytically as a first-order approximation of circuit fidelity under independent, heterogeneous noise channels. For 12 backend–circuit combinations on three IBM processors (133-qubit Heron r1 and 156-qubit Heron r2), GNSI scores are computed for the full pool of 1,320 computationally enumerated candidate layouts; the top-ranked (GNSI-BEST) and bottom-ranked (GNSI-WORST) layouts are then executed on hardware. GNSI-BEST ranks first by score in all 12 instances (Hit@1 = 100% within the enumerated candidate pool) and consistently achieves higher measured fidelity than GNSI-WORST, with Spearman rank correlation $\rho = 0.926 \pm 0.016$ and statistically significant fidelity separation in 9 of 12 paired tests. Initial hardware comparisons on ibm_fez ( $n=5$ ) show GNSI-BEST matching or exceeding SABRE-selected fidelity. We further identify a depth-dependent regime transition: gate-error heterogeneity appears to govern ranking in shallow circuits (depth $\leq 15$ ), while qubit-specific $T_{1}$ variation may dominate for deeper circuits (depth $\geq 20$ ). The analytic regime boundary $d^{*}(b)$ , computable from calibration data alone, shows agreement within ±2 depth layers across all three backends in initial comparisons; GNSI-Extended incorporating the decoherence term receives an initial hardware comparison on two circuits, with full validation left to future work. These results suggest that layout-dependent fidelity variation may be governed by a calibration-predictable noise field, with direct implications for compiler design and noise-adaptive quantum circuit execution.

IEEE Access•Jan 1, 2026•0 citations

Noise-aware selection of circuit cutting strategies under hardware noise non-uniformity

Debarthi Pal, Ritajit Majumdar, Padmanabha Venkatagiri Seshadri +2 more

Noise in contemporary quantum hardware is highly non-uniform across qubits and couplers, giving rise to localized low-noise "islands" within otherwise noisy device topologies. As quantum workloads scale, executions are increasingly forced to traverse high-noise regions, degrading algorithmic fidelity. Circuit cutting provides a route to circumvent such regions by decomposing large circuits into smaller subcircuits, but its practicality is limited by exponential sampling overhead and the lack of systematic guidance on how cut strategies should align with heterogeneous hardware noise. In this work, we present a hardware-noise-aware circuit cutting framework that explicitly exploits the spatial non-uniformity of noise in quantum devices. Rather than proposing a new cut-finding algorithm, we formalize the problem of device-constraint selection under realistic hardware noise and show that this choice critically determines both execution overhead and effective noise. Using a unified gate- and wire-cutting formulation, we demonstrate that small, hardware-informed relaxations in the device constraint yield exponential reductions in execution overhead while preserving alignment with low-noise hardware regions. Across representative workloads, our method achieves an average reduction in the number of circuit executions ranging from 5-54x for 20-qubit circuits, and enables tractable circuit cutting for 50-qubit circuits and application-level benchmarks where conventional strategies incur prohibitive overhead. These results establish noise-aware device-constraint selection as a necessary ingredient for making circuit cutting resource-efficient and practically deployable on contemporary quantum hardware.

quant-pharXiv:2604.24422•Apr 28, 2026•2 citations

SemQBench: Benchmarking Decomposition-Aware Runtime Policies for Quantum-HPC Search

Chandrachud Pati, Yogesh L. Simmhan

Quantum processors are increasingly used as accelerators inside high-performance computing (HPC) workflows. A workflow runtime decides which quantum circuits to run, how to group them into provider jobs, and what to repeat after a failed attempt. Many search problems split into independent parts, but the runtime can use that structure only when the workflow exposes the parts and a validity check for each one. SemQBench measures what a runtime gains from this visibility. It compares seven execution policies for the same search problem, including two controls without amplitude amplification. The policies change one runtime choice at a time: whether to amplify, whether partial results may be combined across runs, whether the parts share one circuit, and what a retry keeps. We run them on the 20-qubit IQM Garnet processor using 106 distinct circuits in three jobs, and report circuit executions, active device time, and provider jobs separately before combining them in a cost model. Amplifying the problem as one whole circuit shows no statistically clear gain over random sampling and uses 6.7-104$\times$ more active device time. Exposing the parts and collecting valid partial results across a fixed batch of runs cuts the executions needed for 95% completion confidence by 2.20-4.00$\times$, and this policy is never worse than the other amplified policies in executions, device time, or jobs; it is selected in 99 of 108 overhead settings. Fewer executions do not always mean less device time: on one workload, executions fall from thirteen to four while active device time rises from 7.44 to 9.81 $μ$s. Exposing problem structure therefore gives the runtime a strong default policy and the measurements needed to decide when the simpler unamplified option is cheaper.

arXiv:2610.22886•Oct 16, 2026•0 citations

Q-RAIL: A Reliability-Aware Framework for Quantum Federated Learning on Heterogeneous Noisy Hardware

Walid El Maouaki, Muhammad Shafique

Quantum federated learning (QFL) on NISQ hardware is highly sensitive to backend heterogeneity: some clients contribute informative updates, while others contribute noise-dominated drift that uniform averaging cannot distinguish. We propose Q-RAIL (Quantum Reliability-Aware Federated Inference and Learning), a circuit- and calibration-aware aggregation method for hardware-heterogeneous QFL. Q-RAIL computes a client-specific effective noise budget from backend calibration metadata together with transpiled circuit statistics. This budget is converted into stabilized aggregation weights using temperature scaling, uniform mixing, and a minimum-weight floor. Q-RAIL was evaluated across multiple experimental settings, including an ablation study, and benchmarked against state-of-the-art methods on three datasets: MNIST, Fashion-MNIST, and OrganAMNIST. On the primary MNIST benchmark under strong hardware skew, Q-RAIL improves final test accuracy from FedAvg's 0.777 to 0.877, a +10.0-point gain corresponding to about 44.8% relative error reduction, while also exceeding the strongest wpQFL baseline (0.833). At the same time, test loss drops from 0.722 to 0.585, and test AUC rises from 0.920 to 0.973. Under non-IID MNIST, Q-RAIL reaches 0.813 vs 0.722 for FedAvg. It also outperforms FedAvg in 12/12 ansatz/CX-fold stress configurations and remains stronger at 4, 10, and 15 qubit setups. Overall, the results support calibration-driven, circuit-aware aggregation as a practical path toward robust QFL on heterogeneous quantum hardware.

quant-pharXiv:2605.25783•May 26, 2026•0 citations
We study a quantum-runtime hypothesis that is narrower than“betterqubits”andbroader than ordinary hardware-aware compilation: distinct subroutines of a quantum program may require different protection profiles and different qubit-array geometries because they carry different kinds of informational fragility. The runtime considered here classifies circuit windows into phase-sensitive, globally entangled, arithmetic, weak-signal, magic-state, and stabilizer-oriented workloads, and then allocates both protection and geometry accordingly. We evaluate this idea in simulation using hardware-informed calibration inputs, structured logical noise, explicit geometry profiles, and paired condition randomness so that ablation modes face the same seeded noise realization. The focused three-regime study uses 96 replicates across three superconducting backends and compares four runtime modes: uniform, protection-only, geometry-only, and protection-plus-geometry, each under static and workload-reactive noise. Geometry is not a universal accelerator. Instead, it behaves as a selective coherence-control variable. In the paired geometry-on-top-of-protection comparison, the strongest gains occur for global parity and weak-signal spectroscopy under mixed workload-reactive noise, with mean useful-output improvements of approximately +0.188 and +0.181, respectively. A stabilizer-specific geometry refinement converts an earlier regression into a helpful-clean result in the same regime.
Quantum cloud platforms increasingly provide access to heterogeneous execution backends including real QPUs and quantum simulators. Effective backend selection is challenging because runtime and output quality vary with workload structure, backend characteristics, and noise conditions. This paper presents an empirical characterization study of how quantum workload properties shape execution across heterogeneous classical simulator backends, focusing on a CPU/GPU-based statevector simulation method. The workload characteristics examined in this study include qubit count, circuit depth, two-qubit gate density, workload class, and noise sensitivity. The experiments show qubit count and circuit depth are primary factors for simulation cost. Two-qubit gate density and workload class affect backend affinity. For example, CPU/GPU affinity in Grover varies with the depth of circuits. Shallow circuits have lower runtime on CPUs, whereas deep circuits have lower runtime on GPUs. Four backend-selection criteria (BS1-BS4) provide analytical bases to examine the effects of circuit structure, workload class, noise tiers, and measurement-derived profiles. The results show characterization-driven backend selection performs better than relying on coarse-grained workload information alone in heterogeneous quantum simulation environments.
Quantum processors have crossed the one-hundred-qubit mark, but noise continues to limit circuit performance, while full quantum error correction remains too costly for routine use. Error suppression and mitigation therefore play an important role in extracting value from current hardware, yet independent comparisons of commercial solutions on identical workloads and devices remain scarce. We benchmark IBM Qiskit Runtime, Q-CTRL Performance Management, and Qedma QESEM on IBM Pittsburgh, a 156-qubit IBM Quantum Heron r3 processor. For Sampler workloads, we run Bernstein-Vazirani, quantum phase estimation, GHZ-state preparation, and randomized mirror circuits with up to 100 measured qubits, comparing raw execution, IBM measurement twirling, and Q-CTRL. For Estimator workloads, we measure chain-averaged magnetization and correlation observables of an eight-layer transverse-field Ising circuit at 25, 50, and 75 qubits against an exact matrix-product-state reference, comparing IBM raw execution, IBM TREX plus twirling, Q-CTRL, and QESEM. Q-CTRL produced the best results on the three structured Sampler workloads while keeping reported QPU times within the same order as the IBM configurations. Across six Ising observable and system-size cases, aggregate mean absolute error was 0.0883 for IBM raw execution, 0.0807 for IBM TREX plus twirling, 0.0285 for Q-CTRL, and 0.0188 for QESEM. Relative to raw execution, Q-CTRL and QESEM reduced aggregate error by factors of 3.10 and 4.70, respectively, while QESEM used 7.5 to 11.1 times the reported QPU time of Q-CTRL. These results show that managed error suppression and mitigation can substantially improve current hardware performance, but with distinct accuracy and execution-time tradeoffs.
Qubit layout selection determining which physical qubits a logical circuit occupies on a superconducting processor is fundamentally a noise-field sampling problem. On IBM Heron r1 and Heron r2 devices, two-qubit gate error varies by nearly one order of magnitude (7– $9\times $ ) across qubit pairs on the same chip, causing measured fidelity differences up to 0.903 from layout choice alone. We introduce the Gate Noise Sensitivity Index (GNSI), a calibration-weighted linear combination of per-qubit readout error and per-edge two-qubit gate error, derived analytically as a first-order approximation of circuit fidelity under independent, heterogeneous noise channels. For 12 backend–circuit combinations on three IBM processors (133-qubit Heron r1 and 156-qubit Heron r2), GNSI scores are computed for the full pool of 1,320 computationally enumerated candidate layouts; the top-ranked (GNSI-BEST) and bottom-ranked (GNSI-WORST) layouts are then executed on hardware. GNSI-BEST ranks first by score in all 12 instances (Hit@1 = 100% within the enumerated candidate pool) and consistently achieves higher measured fidelity than GNSI-WORST, with Spearman rank correlation ρ=0.926±0.016\rho = 0.926 \pm 0.016ρ=0.926±0.016 and statistically significant fidelity separation in 9 of 12 paired tests. Initial hardware comparisons on ibm_fez ( n=5n=5n=5 ) show GNSI-BEST matching or exceeding SABRE-selected fidelity. We further identify a depth-dependent regime transition: gate-error heterogeneity appears to govern ranking in shallow circuits (depth ≤15\leq 15≤15 ), while qubit-specific T1T_{1}T1​ variation may dominate for deeper circuits (depth ≥20\geq 20≥20 ). The analytic regime boundary d∗(b)d^{*}(b)d∗(b) , computable from calibration data alone, shows agreement within ±2 depth layers across all three backends in initial comparisons; GNSI-Extended incorporating the decoherence term receives an initial hardware comparison on two circuits, with full validation left to future work. These results suggest that layout-dependent fidelity variation may be governed by a calibration-predictable noise field, with direct implications for compiler design and noise-adaptive quantum circuit execution.
Noise in contemporary quantum hardware is highly non-uniform across qubits and couplers, giving rise to localized low-noise "islands" within otherwise noisy device topologies. As quantum workloads scale, executions are increasingly forced to traverse high-noise regions, degrading algorithmic fidelity. Circuit cutting provides a route to circumvent such regions by decomposing large circuits into smaller subcircuits, but its practicality is limited by exponential sampling overhead and the lack of systematic guidance on how cut strategies should align with heterogeneous hardware noise. In this work, we present a hardware-noise-aware circuit cutting framework that explicitly exploits the spatial non-uniformity of noise in quantum devices. Rather than proposing a new cut-finding algorithm, we formalize the problem of device-constraint selection under realistic hardware noise and show that this choice critically determines both execution overhead and effective noise. Using a unified gate- and wire-cutting formulation, we demonstrate that small, hardware-informed relaxations in the device constraint yield exponential reductions in execution overhead while preserving alignment with low-noise hardware regions. Across representative workloads, our method achieves an average reduction in the number of circuit executions ranging from 5-54x for 20-qubit circuits, and enables tractable circuit cutting for 50-qubit circuits and application-level benchmarks where conventional strategies incur prohibitive overhead. These results establish noise-aware device-constraint selection as a necessary ingredient for making circuit cutting resource-efficient and practically deployable on contemporary quantum hardware.
Quantum processors are increasingly used as accelerators inside high-performance computing (HPC) workflows. A workflow runtime decides which quantum circuits to run, how to group them into provider jobs, and what to repeat after a failed attempt. Many search problems split into independent parts, but the runtime can use that structure only when the workflow exposes the parts and a validity check for each one. SemQBench measures what a runtime gains from this visibility. It compares seven execution policies for the same search problem, including two controls without amplitude amplification. The policies change one runtime choice at a time: whether to amplify, whether partial results may be combined across runs, whether the parts share one circuit, and what a retry keeps. We run them on the 20-qubit IQM Garnet processor using 106 distinct circuits in three jobs, and report circuit executions, active device time, and provider jobs separately before combining them in a cost model. Amplifying the problem as one whole circuit shows no statistically clear gain over random sampling and uses 6.7-104×\times× more active device time. Exposing the parts and collecting valid partial results across a fixed batch of runs cuts the executions needed for 95% completion confidence by 2.20-4.00×\times×, and this policy is never worse than the other amplified policies in executions, device time, or jobs; it is selected in 99 of 108 overhead settings. Fewer executions do not always mean less device time: on one workload, executions fall from thirteen to four while active device time rises from 7.44 to 9.81 μμμs. Exposing problem structure therefore gives the runtime a strong default policy and the measurements needed to decide when the simpler unamplified option is cheaper.
Quantum federated learning (QFL) on NISQ hardware is highly sensitive to backend heterogeneity: some clients contribute informative updates, while others contribute noise-dominated drift that uniform averaging cannot distinguish. We propose Q-RAIL (Quantum Reliability-Aware Federated Inference and Learning), a circuit- and calibration-aware aggregation method for hardware-heterogeneous QFL. Q-RAIL computes a client-specific effective noise budget from backend calibration metadata together with transpiled circuit statistics. This budget is converted into stabilized aggregation weights using temperature scaling, uniform mixing, and a minimum-weight floor. Q-RAIL was evaluated across multiple experimental settings, including an ablation study, and benchmarked against state-of-the-art methods on three datasets: MNIST, Fashion-MNIST, and OrganAMNIST. On the primary MNIST benchmark under strong hardware skew, Q-RAIL improves final test accuracy from FedAvg's 0.777 to 0.877, a +10.0-point gain corresponding to about 44.8% relative error reduction, while also exceeding the strongest wpQFL baseline (0.833). At the same time, test loss drops from 0.722 to 0.585, and test AUC rises from 0.920 to 0.973. Under non-IID MNIST, Q-RAIL reaches 0.813 vs 0.722 for FedAvg. It also outperforms FedAvg in 12/12 ansatz/CX-fold stress configurations and remains stronger at 4, 10, and 15 qubit setups. Overall, the results support calibration-driven, circuit-aware aggregation as a practical path toward robust QFL on heterogeneous quantum hardware.