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

Structural Failure of Calibration-Based Quantum Computing Architectures - A Critical Assessment of the Framework by Julian Kelly et al

Livolsi Edoardo

Published Jun 30, 2026• 0 citations
Publisher

Abstract

This work presents a structural critique of calibration-based control frameworks for superconducting quantum computing systems, with particular focus on architectures relying on recursive calibration loops and dependency graph formalism. It is shown that the current paradigm does not resolve the fundamental problem of physical instability, but instead formalizes it as an operational requirement. Continuous recalibration, parameter drift, and dependency-driven control structures indicate the absence of stable, reproducible computational states. The analysis demonstrates that the system does not admit a stationary operational regime, and that control is effectively shifted from physical determinacy to procedural scheduling. Directed acyclic graphs and calibration routines are shown to reorganize instability rather than eliminate it. Furthermore, the framework lacks invariant quantities, external validation criteria, and any demonstrated convergence toward stable configurations. Validation remains internal and self-referential, preventing the establishment of physically meaningful computational states. Scalability is assumed through automation, but no structural argument is provided to ensure bounded error propagation or stability under system growth. As a result, increasing system size amplifies the instability it attempts to manage. The work concludes that the calibration-based paradigm represents a systematic redefinition of instability as workflow. The resulting architecture does not achieve control of a quantum system, but continuous management of its failure modes.

DOI
10.5281/zenodo.21080130

Related papers

Bounded Drift Before Error Correction: Why Long-Run Quantrum Execution Fails without Preventive Phase Stabilization

Jos Aben

Abstract Long-run quantum execution remains fundamentally constrained, not primarily by gate infidelity, but by cumulative instability of the rotating phase reference during runtime. While contemporary quantum control stacks rely on calibration, dynamical decoupling, and quantum error correction, these mechanisms operate reactively and assume that the underlying phase frame remains valid between interventions. This assumption breaks down as execution depth, runtime, and system size increase. This note reframes long-run execution failure as a phase-frame stability problem rather than a post-fault correction problem. Using empirical hardware-adjacent observations, it shows that longitudinal drift is structured, temporally correlated, and often collective across qubits, placing it outside the effective bandwidth of fast-noise suppression techniques. As a result, computation is frequently admitted under metastable conditions in which logical error amplification occurs despite unchanged physical gate metrics. Based on this empirical and structural analysis, the note identifies a missing architectural element: a preventive drift-bounding layer that constrains phase-frame deviation before execution proceeds. The argument is intentionally architectural rather than implementational. No hardware-specific parameters, algorithms, or corrective primitives are disclosed. The purpose of this document is to establish why scalable quantum execution requires preventive phase stabilization at the execution boundary, and why reactive correction alone cannot remove this limitation. Detailed theoretical foundations, validation pathways, and hardware-compatible realizations exist but are intentionally excluded from this public note.

•Feb 9, 2026•0 citations

Quantitative Rules for Parallel Calibration and Drift-Resilient Maintenance of Large-Scale Superconducting Quantum Processors

Zhihao Wu, Kechengqi Zhu, Shichuan Xue +13 more

As superconducting quantum processors scale toward hundreds of qubits, manual calibration becomes increasingly costly and difficult to sustain. Here we address two system-level factors governing automated calibration, namely, crosstalk induced by parallel operations and temporal drift of control parameters. On a 66-qubit superconducting processor, cross-entropy benchmarking shows that single-qubit calibration tolerates full-chip concurrency with minimal fidelity loss, whereas CZ calibration requires a minimum coupler-graph distance of four to avoid elevated control errors. Continuous monitoring of representative qubit and coupler parameters further yields quantitative refresh rules that assign refresh priority by error-budget consumption. These results turn two conventionally heuristic choices, the concurrency density of calibration tasks and the refresh priority of each control parameter, into measurable operating rules. Implemented within an automated calibration framework, the rules support a six-qubit Greenberger-Horne-Zeilinger state with a zero-noise-extrapolated fidelity of 89.64%, distance-dependent logical-error suppression in a single-cycle repetition-code benchmark, and a reduction of the mean single-qubit error from 0.023 to 0.011 on a 337-qubit processor, providing an experimentally grounded reference for the automated calibration and maintenance of current and future large-scale superconducting quantum systems.

quant-pharXiv:2610.11477•Oct 9, 2026•0 citations

Provably Efficient Self-Calibrating Quantum Fault Tolerance

Weiyuan Gong, Hong-Ye Hu

Quantum error correction protects logical information only when every physical operation remains below the fault-tolerance threshold, a condition that must be maintained continuously rather than only at the initial calibration. In practice, however, analog control parameters inevitably drift because of environmental fluctuations. As future fault-tolerant quantum computations are expected to run for days or even months, interrupting computation for repeated recalibration becomes fundamentally impractical. A promising alternative is to integrate calibration directly into computation by repurposing syndrome measurements as a calibration signal (Sivak et al, Nature 2026), but whether such self-calibration can be achieved with provable efficiency remains an open question. Here we establish a theoretical framework for such self-calibrating quantum fault tolerance. We prove that, for a broad class of control-induced errors, the detection rate defines a locally strongly convex surrogate objective for analog calibration with high probability. This geometric property enables a simple and efficient online optimization algorithm using only syndrome measurements collected during normal error correction. We prove convergence to an $\varepsilon$ detection rate within $O(1/\varepsilon^2)$ epochs for time-independent drifts and also establish guarantees for time-dependent drifts. We further show that the convergence rate is independent of the code distance for quantum low-density parity-check (LDPC) codes. Pulse-level simulations of neutral-atom arrays and large-scale circuit-level Clifford simulations confirm these theoretical predictions. Our results establish self-calibrating fault tolerance as a provably efficient paradigm in which the same syndrome measurements simultaneously protect logical information and stabilize the underlying hardware.

quant-pharXiv:2608.05686•Aug 7, 2026•4 citations

Testbeds should enable development of new calibration routines.

Kevin C Young

The performance of quantum computing hardware is nearly always limited by coherent errors arising from miscalibration.New methods for calibration have the potential to completely eliminate these errors.With quantum devices growing ever larger and more difficult to calibrate, the community needs new testing protocols, new post-processing routines, new controller designs, and new software frameworks that together enable quantum devices to operate at their peak.In this white paper, we argue that a central design goal of future testbeds should be to enable creative research and development into novel hardware calibration routines.We suggest this can be accomplished by a deep commitment to low-level transparency, carefully designed control infrastructure, and flexible software frameworks.Quantum computers are large-scale, integrated systems with many free parameters, each of which must be carefully and continuously calibrated to ensure optimal and stable performance.Extracting the system information needed for calibration demands very careful experiment design, and acting on this information effectively requires rapid post-processing and low-latency feedback.Doing this optimally is hard.Many of the most common techniques for calibrating contemporary devices are inefficient in both experimental and postprocessing resources, and still lead to suboptimal performance.Transparency -When calibrating quantum hardware, transparency is essential.Users cannot correct parameters that they don't know about.When developing calibration protocols, users require direct, lowlevel access to as many controllable device parameters as possible -any parameter that an experimentalist regularly adjusts should be accessible programmatically.This degree of control is essential for efficient calibration, which must be automated and free from high-latency, manual adjustments.To support this automation, clear and complete documentation of a device at the lowest level must be available to the users.This includes details of exactly what each parameter controls, its allowed ranges, and -ideally -a model for how it impacts qubit operations.While not strictly necessary, these models can provide shortcuts for the calibration routines-it is much easier to correct over-rotation errors if the calibration routine knows which parameters impact rotation angles.Not all parameters are adjustable, and uncontrolled environmental degrees of freedom can have serious impacts on the performance of the device.Temperature measurements, microwave powers, and even laser phase stabilization servo values should be measured, recorded, and exposed to users.In our own work with trapped ion hardware [2] we have observed strong correlations between gate error rates and laboratory temperatures.In similar situations, continuous monitoring of the temperature can enable feed-forward compensation to correct these errors, reducing drift.In our experience, however, environmental data was recorded by offline monitoring tools and was available to us only after our experimental colleagues happened to mention its existence.By explicitly and programmatically exposing side-channel information, testbed designers will enable future drift-control protocols that exploit adaptive, feed-forward techniques to monitor and correct for unstable environments.This approach can dramatically reduce the resource overhead demanded by tomographic protocols that leverage comparatively expensive quantum measurements.Calibration impacts every possible testbed application, and recorded details of device calibration should be made available to all users for all experimental runs.The ability to audit calibration data is critical for identifying inefficiencies in calibration protocols, as well as providing possible explanation of an algorithm's unexpected performance.Testbeds should therefore err on the side of over-reporting calibration data, and testbed designers must adopt a deep commitment to device transparency to maximize its value to the scientific community. SAND2021-14320CThis paper describes objective technical results and analysis.Any subjective views or opinions that might be expressed in the paper do not necessarily represent the views of the U.

•Nov 28, 2022•0 citations

Hierarchical Supervisory Control as an Architectural Stabilization Framework for Abstract Quantum Systems

King Quantum

This paper proposes a recursive supervisory control architecture for quantum systems, presenting a system-level framework for stabilizing hybrid quantum-classical computation through adaptive feedback and orchestration layers. The work is framed as an architectural hypothesis supported by structured simulation results, without claims of new physics or hardware validation. The framework explores collapse-aware supervisory control, recursive orchestration dynamics, and bounded feedback models as a potential pathway toward scalable quantum system management. The paper includes formalism, simulation methodology, validation artefacts, and limitations, and is intended as a foundation for further experimental investigation and system-level research in quantum computing architectures. This work is released as a research hypothesis and does not constitute a claim of physical quantum computing capability.

•Jan 3, 2026•0 citations

Characterization, Interaction, and Stack-Wide Impact of Hardware Constraints in Superconducting Quantum Processors: A State-of-the-Art Review

Anuththara Hettiarachchi, Kapila D. Dissanayaka, Jeewanee Bamunusinghe

The transition from noisy intermediate-scale quantum devices (error rate $\sim 10^{-3}$ ) to fault-tolerant quantum computation (requiring error rates below $10^{-4}$ for viable quantum error correction, and approaching $10^{-5}$ for practical fault tolerance) is impeded not by any single hardware shortfall but by the way hardware-layer constraints couple across the quantum computing stack. This review offers a blueprint for engineers designing superconducting quantum processors, organized around a three-stage analytical framework applied to five constraints: qubit coherence, gate fidelity, connectivity, readout errors, and crosstalk. The first stage, per-constraint characterization, shows that each constraint’s most severe failure mode generates correlated errors that violate the independence assumptions underlying quantum error correction. The second stage, pairwise interaction analysis, demonstrates that these constraints form a coupled degradation network in which a weakness in one systematically activates and amplifies failures in others, producing compound failure modes invisible to standard isolated benchmarking. The third stage, stack-wide scaling analysis, shows that improving any single constraint unlocks qualitatively different operational regimes only at discrete threshold crossings, so investment planning must target these transitions rather than incremental gains that yield no regime change. Each constraint’s dominant remaining limitation is then classified as either architecturally fundamental, requiring new device physics, or operationally mitigable through software and control advances. The central finding is that correlated error suppression cannot be fully achieved through local optimization, because the same electromagnetic proximity enabling quantum computation also generates the couplings that produce correlated errors. Achieving fault tolerance therefore requires co-design applied simultaneously rather than sequentially.

IEEE Access•Jan 1, 2026•0 citations
This work presents a structural critique of calibration-based control frameworks for superconducting quantum computing systems, with particular focus on architectures relying on recursive calibration loops and dependency graph formalism. It is shown that the current paradigm does not resolve the fundamental problem of physical instability, but instead formalizes it as an operational requirement. Continuous recalibration, parameter drift, and dependency-driven control structures indicate the absence of stable, reproducible computational states. The analysis demonstrates that the system does not admit a stationary operational regime, and that control is effectively shifted from physical determinacy to procedural scheduling. Directed acyclic graphs and calibration routines are shown to reorganize instability rather than eliminate it. Furthermore, the framework lacks invariant quantities, external validation criteria, and any demonstrated convergence toward stable configurations. Validation remains internal and self-referential, preventing the establishment of physically meaningful computational states. Scalability is assumed through automation, but no structural argument is provided to ensure bounded error propagation or stability under system growth. As a result, increasing system size amplifies the instability it attempts to manage. The work concludes that the calibration-based paradigm represents a systematic redefinition of instability as workflow. The resulting architecture does not achieve control of a quantum system, but continuous management of its failure modes.
Abstract Long-run quantum execution remains fundamentally constrained, not primarily by gate infidelity, but by cumulative instability of the rotating phase reference during runtime. While contemporary quantum control stacks rely on calibration, dynamical decoupling, and quantum error correction, these mechanisms operate reactively and assume that the underlying phase frame remains valid between interventions. This assumption breaks down as execution depth, runtime, and system size increase. This note reframes long-run execution failure as a phase-frame stability problem rather than a post-fault correction problem. Using empirical hardware-adjacent observations, it shows that longitudinal drift is structured, temporally correlated, and often collective across qubits, placing it outside the effective bandwidth of fast-noise suppression techniques. As a result, computation is frequently admitted under metastable conditions in which logical error amplification occurs despite unchanged physical gate metrics. Based on this empirical and structural analysis, the note identifies a missing architectural element: a preventive drift-bounding layer that constrains phase-frame deviation before execution proceeds. The argument is intentionally architectural rather than implementational. No hardware-specific parameters, algorithms, or corrective primitives are disclosed. The purpose of this document is to establish why scalable quantum execution requires preventive phase stabilization at the execution boundary, and why reactive correction alone cannot remove this limitation. Detailed theoretical foundations, validation pathways, and hardware-compatible realizations exist but are intentionally excluded from this public note.
As superconducting quantum processors scale toward hundreds of qubits, manual calibration becomes increasingly costly and difficult to sustain. Here we address two system-level factors governing automated calibration, namely, crosstalk induced by parallel operations and temporal drift of control parameters. On a 66-qubit superconducting processor, cross-entropy benchmarking shows that single-qubit calibration tolerates full-chip concurrency with minimal fidelity loss, whereas CZ calibration requires a minimum coupler-graph distance of four to avoid elevated control errors. Continuous monitoring of representative qubit and coupler parameters further yields quantitative refresh rules that assign refresh priority by error-budget consumption. These results turn two conventionally heuristic choices, the concurrency density of calibration tasks and the refresh priority of each control parameter, into measurable operating rules. Implemented within an automated calibration framework, the rules support a six-qubit Greenberger-Horne-Zeilinger state with a zero-noise-extrapolated fidelity of 89.64%, distance-dependent logical-error suppression in a single-cycle repetition-code benchmark, and a reduction of the mean single-qubit error from 0.023 to 0.011 on a 337-qubit processor, providing an experimentally grounded reference for the automated calibration and maintenance of current and future large-scale superconducting quantum systems.
Quantum error correction protects logical information only when every physical operation remains below the fault-tolerance threshold, a condition that must be maintained continuously rather than only at the initial calibration. In practice, however, analog control parameters inevitably drift because of environmental fluctuations. As future fault-tolerant quantum computations are expected to run for days or even months, interrupting computation for repeated recalibration becomes fundamentally impractical. A promising alternative is to integrate calibration directly into computation by repurposing syndrome measurements as a calibration signal (Sivak et al, Nature 2026), but whether such self-calibration can be achieved with provable efficiency remains an open question. Here we establish a theoretical framework for such self-calibrating quantum fault tolerance. We prove that, for a broad class of control-induced errors, the detection rate defines a locally strongly convex surrogate objective for analog calibration with high probability. This geometric property enables a simple and efficient online optimization algorithm using only syndrome measurements collected during normal error correction. We prove convergence to an ε\varepsilonε detection rate within O(1/ε2)O(1/\varepsilon^2)O(1/ε2) epochs for time-independent drifts and also establish guarantees for time-dependent drifts. We further show that the convergence rate is independent of the code distance for quantum low-density parity-check (LDPC) codes. Pulse-level simulations of neutral-atom arrays and large-scale circuit-level Clifford simulations confirm these theoretical predictions. Our results establish self-calibrating fault tolerance as a provably efficient paradigm in which the same syndrome measurements simultaneously protect logical information and stabilize the underlying hardware.
The performance of quantum computing hardware is nearly always limited by coherent errors arising from miscalibration.New methods for calibration have the potential to completely eliminate these errors.With quantum devices growing ever larger and more difficult to calibrate, the community needs new testing protocols, new post-processing routines, new controller designs, and new software frameworks that together enable quantum devices to operate at their peak.In this white paper, we argue that a central design goal of future testbeds should be to enable creative research and development into novel hardware calibration routines.We suggest this can be accomplished by a deep commitment to low-level transparency, carefully designed control infrastructure, and flexible software frameworks.Quantum computers are large-scale, integrated systems with many free parameters, each of which must be carefully and continuously calibrated to ensure optimal and stable performance.Extracting the system information needed for calibration demands very careful experiment design, and acting on this information effectively requires rapid post-processing and low-latency feedback.Doing this optimally is hard.Many of the most common techniques for calibrating contemporary devices are inefficient in both experimental and postprocessing resources, and still lead to suboptimal performance.Transparency -When calibrating quantum hardware, transparency is essential.Users cannot correct parameters that they don't know about.When developing calibration protocols, users require direct, lowlevel access to as many controllable device parameters as possible -any parameter that an experimentalist regularly adjusts should be accessible programmatically.This degree of control is essential for efficient calibration, which must be automated and free from high-latency, manual adjustments.To support this automation, clear and complete documentation of a device at the lowest level must be available to the users.This includes details of exactly what each parameter controls, its allowed ranges, and -ideally -a model for how it impacts qubit operations.While not strictly necessary, these models can provide shortcuts for the calibration routines-it is much easier to correct over-rotation errors if the calibration routine knows which parameters impact rotation angles.Not all parameters are adjustable, and uncontrolled environmental degrees of freedom can have serious impacts on the performance of the device.Temperature measurements, microwave powers, and even laser phase stabilization servo values should be measured, recorded, and exposed to users.In our own work with trapped ion hardware [2] we have observed strong correlations between gate error rates and laboratory temperatures.In similar situations, continuous monitoring of the temperature can enable feed-forward compensation to correct these errors, reducing drift.In our experience, however, environmental data was recorded by offline monitoring tools and was available to us only after our experimental colleagues happened to mention its existence.By explicitly and programmatically exposing side-channel information, testbed designers will enable future drift-control protocols that exploit adaptive, feed-forward techniques to monitor and correct for unstable environments.This approach can dramatically reduce the resource overhead demanded by tomographic protocols that leverage comparatively expensive quantum measurements.Calibration impacts every possible testbed application, and recorded details of device calibration should be made available to all users for all experimental runs.The ability to audit calibration data is critical for identifying inefficiencies in calibration protocols, as well as providing possible explanation of an algorithm's unexpected performance.Testbeds should therefore err on the side of over-reporting calibration data, and testbed designers must adopt a deep commitment to device transparency to maximize its value to the scientific community. SAND2021-14320CThis paper describes objective technical results and analysis.Any subjective views or opinions that might be expressed in the paper do not necessarily represent the views of the U.
This paper proposes a recursive supervisory control architecture for quantum systems, presenting a system-level framework for stabilizing hybrid quantum-classical computation through adaptive feedback and orchestration layers. The work is framed as an architectural hypothesis supported by structured simulation results, without claims of new physics or hardware validation. The framework explores collapse-aware supervisory control, recursive orchestration dynamics, and bounded feedback models as a potential pathway toward scalable quantum system management. The paper includes formalism, simulation methodology, validation artefacts, and limitations, and is intended as a foundation for further experimental investigation and system-level research in quantum computing architectures. This work is released as a research hypothesis and does not constitute a claim of physical quantum computing capability.
The transition from noisy intermediate-scale quantum devices (error rate ∼10−3\sim 10^{-3}∼10−3 ) to fault-tolerant quantum computation (requiring error rates below 10−410^{-4}10−4 for viable quantum error correction, and approaching 10−510^{-5}10−5 for practical fault tolerance) is impeded not by any single hardware shortfall but by the way hardware-layer constraints couple across the quantum computing stack. This review offers a blueprint for engineers designing superconducting quantum processors, organized around a three-stage analytical framework applied to five constraints: qubit coherence, gate fidelity, connectivity, readout errors, and crosstalk. The first stage, per-constraint characterization, shows that each constraint’s most severe failure mode generates correlated errors that violate the independence assumptions underlying quantum error correction. The second stage, pairwise interaction analysis, demonstrates that these constraints form a coupled degradation network in which a weakness in one systematically activates and amplifies failures in others, producing compound failure modes invisible to standard isolated benchmarking. The third stage, stack-wide scaling analysis, shows that improving any single constraint unlocks qualitatively different operational regimes only at discrete threshold crossings, so investment planning must target these transitions rather than incremental gains that yield no regime change. Each constraint’s dominant remaining limitation is then classified as either architecturally fundamental, requiring new device physics, or operationally mitigable through software and control advances. The central finding is that correlated error suppression cannot be fully achieved through local optimization, because the same electromagnetic proximity enabling quantum computation also generates the couplings that produce correlated errors. Achieving fault tolerance therefore requires co-design applied simultaneously rather than sequentially.