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

Autonomous Hamiltonian certification and changepoint detection

Steven T. Flammia, Dmitrii Khitrin, Muzhou Ma, Jamie Sikora, Yu Tong, Alice Zheng

quant-phSubmitted Mar 27, 2026• Announced Mar 30, 2026• 0 citations
arXivHTMLPDF

Abstract

Modern quantum devices require high-precision Hamiltonian dynamics, but environmental noise can cause calibrated Hamiltonian parameters to drift over time, necessitating expensive recalibration. Detecting when recalibration is needed is challenging, especially since the very gates required for sophisticated verification protocols may themselves be miscalibrated. While cloud quantum computing services implement heuristic routines for triggering recalibration, the fundamental limits of optimal recalibration are not yet known. We develop efficient Hamiltonian certification and changepoint detection protocols in the autonomous setting, where we cannot rely on an external noiseless device and use only single-qubit gates and measurements, making the protocols robust to the calibration issues for multi-qubit operations they aim to detect. For unknown $n$-qubit Hamiltonians $H$ and $H_0$ with operator norm bounded by $M$, our certification protocol distinguishes whether $\|H-H_0\|_F\geqε$ or $\|H-H_0\|_F\leq O(ε/\sqrt{n})$ with sample complexity $O(nM^2\ln(1/δ)/ε^2)$ and total evolution time $O(nM\ln(1/δ)/ε^2)$. We achieve this by evolving random stabilizer product states and performing adaptive single-qubit measurements based on a classically simulable hypothesis state. Extending this to continuous monitoring, we develop an online changepoint detection algorithm using the CUSUM procedure that achieves a detection delay time bound of $O(nM\ln(M\mathbb{E}_\infty[T])/ε^2)$, matching the known asymptotically optimal scaling with respect to false alarm run time $\mathbb{E}_\infty[T]$. Our approach enables quantum devices to autonomously monitor their own calibration status without requiring ancillary systems, entangling operations, or a trusted reference device, offering a practical solution for robust quantum computing with contemporary noisy devices.

Comments
26 pages, 4 figures. Comments welcome

Related papers

Optimal certification of constant-local Hamiltonians

Junseo Lee, Myeongjin Shin

We study the problem of certifying local Hamiltonians from real-time access to their dynamics. Given oracle access to $e^{-itH}$ for an unknown $k$-local Hamiltonian $H$ and a fully specified target Hamiltonian $H_0$, the goal is to decide whether $H$ is exactly equal to $H_0$ or differs from $H_0$ by at least $\varepsilon$ in normalized Frobenius norm, while minimizing the total evolution time. We introduce the first intolerant Hamiltonian certification protocol that achieves optimal performance for all constant-locality Hamiltonians. For general $n$-qubit, $k$-local, traceless Hamiltonians, our procedure uses $O(c^k/\varepsilon)$ total evolution time for a universal constant $c$, and succeeds with high probability. In particular, for $O(1)$-local Hamiltonians, the total evolution time becomes $Θ(1/\varepsilon)$, matching the known $Ω(1/\varepsilon)$ lower bounds and achieving the gold-standard Heisenberg-limit scaling. Prior certification methods either relied on implementing inverse evolution of $H$, required controlled access to $e^{-itH}$, or achieved near-optimal guarantees only in restricted settings such as the Ising case ($k=2$). In contrast, our algorithm requires neither inverse evolution nor controlled operations: it uses only forward real-time dynamics and achieves optimal intolerant certification for all constant-locality Hamiltonians.

quant-pharXiv:2512.09778•Dec 11, 2025•0 citations

Optimal Ansatz-free Hamiltonian Learning In Situ

Taiqi Zhou, Weiyuan Gong

Characterizing the features of a Hamiltonian that governs a quantum system serves as a fundamental subroutine of quantum device calibration, signal sensing, and error correction. Recent works have proposed protocols achieving the optimal Heisenberg-limited scaling learning ansatz-free Hamiltonians from their real-time evolutions without fully specifying interaction structures. However, these protocols rely on both deep circuits with interleaving probes and control, and extremely short time resolution, making them difficult to implement on near- and intermediate-term in situ quantum experiments. In this work, we propose a computationally efficient, control-free, and ancilla-free algorithm that uses only Pauli product state preparation and measurement, and learns an ansatz-free Hamiltonian $H$ with $||H||\leqΛ$ in total evolution time of $Θ(\fracΛ{ε^2}\log(\fracΛε))$. The evolution time cost of our algorithm is optimal for any control-free protocols as we further prove a lower bound of $Ω(\fracΛ{ε^2}\log(\fracΛε))$. Technically, our method introduces a randomized-sampling framework that combines band-limited kernel-based time sampling with a displacement sieve for Hamiltonian structure learning. The characteristic probe time resolution depends only on $Λ$ instead of $\varepsilon$, which makes our protocol especially appealing in the high-precision regime for sensing and calibration applications. We also show that the algorithm maintains the same asymptotic total evolution time in the presence of state-preparation-and-measurement (SPAM) noise when the Hamiltonian is local after calibration. Our results demonstrate the fundamental cost of experimentally friendly Hamiltonian learning and provide a practical route to rigorous in situ characterization of near-term quantum platforms.

quant-pharXiv:2606.19486•Jun 19, 2026•0 citations

Ultra-Fast Hermitian Spectral Validation for Robust Quantum Gate Control: O(n 3 ) Certification with Zero Conservatism

Hernandez-Morales, Eduardo

Robust quantum control requires real-time validation of Hamiltonian perturbations to ensure gate fidelity under drift and noise. We present the first embedded implementation of Hermitian Spectral Bounds (HSB) for quantum systems, achieving $\gamma=1$ exact certification for Hermitian Hamiltonians with $O(n^{3})$ complexity—orders of magnitude faster than LMI-based methods. Through FPGA/SoC integration and experimental validation on superconducting transmons, we demonstrate $<100~\mu s$ verification latency, zero false negatives, and < 0.01% false positive rate. The method enables autonomous recalibration triggers and real-time go/no-go decisions for quantum operations.

•Nov 25, 2025•0 citations

Sound and Efficient Certification of High-Quality Qubit Operations: Theory and Experiment

Nikolai Miklin, Jan Nöller, José Martínez +4 more

Can a high-quality quantum gate be certified when uncharacterized state-preparation and measurement errors are dominant? Can this be achieved with low experimental overhead? Here, we introduce a sound black-box certification protocol for a single-qubit gate based on a small set of fixed, deterministic sequences. From the data, the protocol derives finite-sample bounds on the gate's rotation eigenvalue, a gauge-invariant property. Its phase reveals the accuracy of the rotation angle, while its modulus quantifies the loss of coherence under repeated gate applications. We implement the protocol on a $^{40}\mathrm{Ca}^{+}$ trapped-ion processor and certify the $\sqrt{\mathrm{X}}$-gate rotation eigenvalue using $22\,000$ circuit executions, and demonstrate the robustness of certification to state-preparation and measurement errors by deliberately degrading the readout. Finally, we prove that these spectral constraints imply, up to a physically meaningful unitary change of basis, a rigorous average gate-fidelity lower bound for every time-independent qubit model compatible with the data. In both readout settings, the spectral bounds yield the same fidelity certificate of $99.94(3)\%$ with $99\%$ confidence. Our results establish a new standard for quantum-gate certification by combining soundness and experimental efficiency without requiring trusted reference operations, randomized circuits, or model fitting.

quant-pharXiv:2608.17005•Aug 19, 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•0 citations

Sound certification of memory-bounded quantum computers

Jan Nöller, Nikolai Miklin, Martin Kliesch +1 more

The rapid advancement of quantum hardware calls for the development of reliable methods to certify its correct functioning. However, existing certification tests often fall short: they either rely on flawless state preparation and measurement or lack soundness guarantees, meaning that they do not rule out incorrect implementations of the target operations by a quantum device. We introduce an approach, which we call quantum system quizzing, for the certification of quantum gates in a practical server-user scenario, where a classical user tests the results of quantum computation performed by a quantum server by checking its responses to a set of predesigned small-sized computational problems. Importantly, this approach does not require trusted state preparation and measurement and is thus inherently free from the associated systematic errors. For a wide range of relevant gate sets, including a universal one, we prove our certification protocol to be sound; i.e., it is guaranteed to reject any incorrect gate implementation, under the assumptions of a known Hilbert space dimension and context independence of error. A major technical challenge that we are first to resolve is recovering the tensor product structure of a multi-qubit system in the memory-bounded single-device setup. Finally, we prove the robustness of our protocol and validate its sample and computational efficiency through extensive numerical experiments. Our protocol is platform-agnostic and introduces a new paradigm for benchmarking and comparing diverse quantum architectures.

arXiv:2411.04215•Nov 6, 2024•0 citations
Modern quantum devices require high-precision Hamiltonian dynamics, but environmental noise can cause calibrated Hamiltonian parameters to drift over time, necessitating expensive recalibration. Detecting when recalibration is needed is challenging, especially since the very gates required for sophisticated verification protocols may themselves be miscalibrated. While cloud quantum computing services implement heuristic routines for triggering recalibration, the fundamental limits of optimal recalibration are not yet known. We develop efficient Hamiltonian certification and changepoint detection protocols in the autonomous setting, where we cannot rely on an external noiseless device and use only single-qubit gates and measurements, making the protocols robust to the calibration issues for multi-qubit operations they aim to detect. For unknown nnn-qubit Hamiltonians HHH and H0H_0H0​ with operator norm bounded by MMM, our certification protocol distinguishes whether ∥H−H0∥F≥ε\|H-H_0\|_F\geqε∥H−H0​∥F​≥ε or ∥H−H0∥F≤O(ε/n)\|H-H_0\|_F\leq O(ε/\sqrt{n})∥H−H0​∥F​≤O(ε/n​) with sample complexity O(nM2ln⁡(1/δ)/ε2)O(nM^2\ln(1/δ)/ε^2)O(nM2ln(1/δ)/ε2) and total evolution time O(nMln⁡(1/δ)/ε2)O(nM\ln(1/δ)/ε^2)O(nMln(1/δ)/ε2). We achieve this by evolving random stabilizer product states and performing adaptive single-qubit measurements based on a classically simulable hypothesis state. Extending this to continuous monitoring, we develop an online changepoint detection algorithm using the CUSUM procedure that achieves a detection delay time bound of O(nMln⁡(ME∞[T])/ε2)O(nM\ln(M\mathbb{E}_\infty[T])/ε^2)O(nMln(ME∞​[T])/ε2), matching the known asymptotically optimal scaling with respect to false alarm run time E∞[T]\mathbb{E}_\infty[T]E∞​[T]. Our approach enables quantum devices to autonomously monitor their own calibration status without requiring ancillary systems, entangling operations, or a trusted reference device, offering a practical solution for robust quantum computing with contemporary noisy devices.
We study the problem of certifying local Hamiltonians from real-time access to their dynamics. Given oracle access to e−itHe^{-itH}e−itH for an unknown kkk-local Hamiltonian HHH and a fully specified target Hamiltonian H0H_0H0​, the goal is to decide whether HHH is exactly equal to H0H_0H0​ or differs from H0H_0H0​ by at least ε\varepsilonε in normalized Frobenius norm, while minimizing the total evolution time. We introduce the first intolerant Hamiltonian certification protocol that achieves optimal performance for all constant-locality Hamiltonians. For general nnn-qubit, kkk-local, traceless Hamiltonians, our procedure uses O(ck/ε)O(c^k/\varepsilon)O(ck/ε) total evolution time for a universal constant ccc, and succeeds with high probability. In particular, for O(1)O(1)O(1)-local Hamiltonians, the total evolution time becomes Θ(1/ε)Θ(1/\varepsilon)Θ(1/ε), matching the known Ω(1/ε)Ω(1/\varepsilon)Ω(1/ε) lower bounds and achieving the gold-standard Heisenberg-limit scaling. Prior certification methods either relied on implementing inverse evolution of HHH, required controlled access to e−itHe^{-itH}e−itH, or achieved near-optimal guarantees only in restricted settings such as the Ising case (k=2k=2k=2). In contrast, our algorithm requires neither inverse evolution nor controlled operations: it uses only forward real-time dynamics and achieves optimal intolerant certification for all constant-locality Hamiltonians.
Characterizing the features of a Hamiltonian that governs a quantum system serves as a fundamental subroutine of quantum device calibration, signal sensing, and error correction. Recent works have proposed protocols achieving the optimal Heisenberg-limited scaling learning ansatz-free Hamiltonians from their real-time evolutions without fully specifying interaction structures. However, these protocols rely on both deep circuits with interleaving probes and control, and extremely short time resolution, making them difficult to implement on near- and intermediate-term in situ quantum experiments. In this work, we propose a computationally efficient, control-free, and ancilla-free algorithm that uses only Pauli product state preparation and measurement, and learns an ansatz-free Hamiltonian HHH with ∣∣H∣∣≤Λ||H||\leqΛ∣∣H∣∣≤Λ in total evolution time of Θ(Λε2log⁡(Λε))Θ(\fracΛ{ε^2}\log(\fracΛε))Θ(ε2Λ​log(εΛ​)). The evolution time cost of our algorithm is optimal for any control-free protocols as we further prove a lower bound of Ω(Λε2log⁡(Λε))Ω(\fracΛ{ε^2}\log(\fracΛε))Ω(ε2Λ​log(εΛ​)). Technically, our method introduces a randomized-sampling framework that combines band-limited kernel-based time sampling with a displacement sieve for Hamiltonian structure learning. The characteristic probe time resolution depends only on ΛΛΛ instead of ε\varepsilonε, which makes our protocol especially appealing in the high-precision regime for sensing and calibration applications. We also show that the algorithm maintains the same asymptotic total evolution time in the presence of state-preparation-and-measurement (SPAM) noise when the Hamiltonian is local after calibration. Our results demonstrate the fundamental cost of experimentally friendly Hamiltonian learning and provide a practical route to rigorous in situ characterization of near-term quantum platforms.
Robust quantum control requires real-time validation of Hamiltonian perturbations to ensure gate fidelity under drift and noise. We present the first embedded implementation of Hermitian Spectral Bounds (HSB) for quantum systems, achieving γ=1\gamma=1γ=1 exact certification for Hermitian Hamiltonians with O(n3)O(n^{3})O(n3) complexity—orders of magnitude faster than LMI-based methods. Through FPGA/SoC integration and experimental validation on superconducting transmons, we demonstrate <100 μs<100~\mu s<100 μs verification latency, zero false negatives, and < 0.01% false positive rate. The method enables autonomous recalibration triggers and real-time go/no-go decisions for quantum operations.
Can a high-quality quantum gate be certified when uncharacterized state-preparation and measurement errors are dominant? Can this be achieved with low experimental overhead? Here, we introduce a sound black-box certification protocol for a single-qubit gate based on a small set of fixed, deterministic sequences. From the data, the protocol derives finite-sample bounds on the gate's rotation eigenvalue, a gauge-invariant property. Its phase reveals the accuracy of the rotation angle, while its modulus quantifies the loss of coherence under repeated gate applications. We implement the protocol on a 40Ca+^{40}\mathrm{Ca}^{+}40Ca+ trapped-ion processor and certify the X\sqrt{\mathrm{X}}X​-gate rotation eigenvalue using 22 00022\,00022000 circuit executions, and demonstrate the robustness of certification to state-preparation and measurement errors by deliberately degrading the readout. Finally, we prove that these spectral constraints imply, up to a physically meaningful unitary change of basis, a rigorous average gate-fidelity lower bound for every time-independent qubit model compatible with the data. In both readout settings, the spectral bounds yield the same fidelity certificate of 99.94(3)%99.94(3)\%99.94(3)% with 99%99\%99% confidence. Our results establish a new standard for quantum-gate certification by combining soundness and experimental efficiency without requiring trusted reference operations, randomized circuits, or model fitting.
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 rapid advancement of quantum hardware calls for the development of reliable methods to certify its correct functioning. However, existing certification tests often fall short: they either rely on flawless state preparation and measurement or lack soundness guarantees, meaning that they do not rule out incorrect implementations of the target operations by a quantum device. We introduce an approach, which we call quantum system quizzing, for the certification of quantum gates in a practical server-user scenario, where a classical user tests the results of quantum computation performed by a quantum server by checking its responses to a set of predesigned small-sized computational problems. Importantly, this approach does not require trusted state preparation and measurement and is thus inherently free from the associated systematic errors. For a wide range of relevant gate sets, including a universal one, we prove our certification protocol to be sound; i.e., it is guaranteed to reject any incorrect gate implementation, under the assumptions of a known Hilbert space dimension and context independence of error. A major technical challenge that we are first to resolve is recovering the tensor product structure of a multi-qubit system in the memory-bounded single-device setup. Finally, we prove the robustness of our protocol and validate its sample and computational efficiency through extensive numerical experiments. Our protocol is platform-agnostic and introduces a new paradigm for benchmarking and comparing diverse quantum architectures.