Autonomous Hamiltonian certification and changepoint detection

• URL: http://arxiv.org/abs/2603.26655v1
• Date: Fri, 27 Mar 2026 17:54:45 GMT
• Title: Autonomous Hamiltonian certification and changepoint detection
• Abstract summary: Environmental noise can cause calibrated Hamiltonian parameters to drift over time, necessitating expensive recalibration.<n>We develop efficient Hamiltonian certification and changepoint detection protocols in the autonomous setting.<n>Our approach enables quantum devices to autonomously monitor their own calibration status without requiring entangling systems, verification operations, or a trusted reference device.
• Score: 1.2021700665093262
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• Sound and Efficient Certification of High-Quality Qubit Operations: Theory and Experiment [23.48673361417131]
  We introduce a sound black-box certification protocol for a single-qubit gate based on a small set of fixed, deterministic sequences.<n>From the data, the protocol derives finite-sample bounds on the gate's rotation eigenvalue, a gauge-invariant property.<n>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.
  arXiv  Detail & Related papers  (2026-08-17T18:03:00Z)
• Optimal Ansatz-free Hamiltonian Learning In Situ [3.3230675313521716]
  We show that an algorithm can learn an ansatz-free Hamiltonian $H$ in total evolution time of $(frac2log(frac))$.<n>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.
  arXiv  Detail & Related papers  (2026-06-17T18:21:30Z)
• Adiabatic Quantum Phase Estimation [47.3103723337301]
  Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $$ in Heisenberg-limited time $T= (1/)$.<n>Standard gate-based implementations of QPE require deep controlled time-evolution circuits and are not native to analog hardware.<n>We present a simple adiabatic protocol for QPE that achieves the optimal Heisenberg-limited scaling $T = Oleft( frac1 logleft(-1right)right)$ in both the precision $$
  arXiv  Detail & Related papers  (2026-05-21T17:31:36Z)
• Precision limits for time-dependent quantum metrology under Markovian noise [0.0]
  We derive ultimate precision bounds for estimating parameters encoded in emphtime-dependent Hamiltonians in the presence of general Markovian noise.<n>We illustrate these behaviors on paradigmatic driven-qubit sensors, exhibiting $T4$ and $T3$ scalings under dephasing and spontaneous emission.
  arXiv  Detail & Related papers  (2026-05-18T13:39:22Z)
• qSHIFT: An Adaptive Sampling Protocol for Higher-Order Quantum Simulation [0.5635658368100682]
  Quantum simulation is a cornerstone application for quantum computing.<n>Standard methods face a trade-off between circuit depth and accuracy.<n>We introduce qSHIFT, an adaptive sampling protocol that overcomes these limitations.
  arXiv  Detail & Related papers  (2026-04-29T03:47:21Z)
• Correction and Corruption: A Two-Rate View of Error Flow in LLM Protocols [51.56484100374058]
  We propose a paired-outcome measurement interface for auditing a single protocol step on exact-match tasks.<n>For each instance, the interface records a baseline correctness bit and a post-step correctness bit.<n>These rates predict accuracy changes and define a reusable empirical interface testable across seeds, mixtures, and pipelines.
  arXiv  Detail & Related papers  (2026-04-20T13:25:40Z)
• Quantum Phaselift [0.0]
  We introduce a lifting-based framework that estimates the rank-one matrix $Z = f fdagger$ rather than estimating $f$ directly.<n>We prove that a $O(1)$ bandwidth suffices for generic signals, leading to substantial savings in controlled operations.<n>We numerically demonstrate that high-quality recovery is possible for the 2D Fermi-Hubbard and 2D transverse-field Ising model signals of size exceeding 100 time points.
  arXiv  Detail & Related papers  (2026-02-09T19:09:57Z)
• Performance Guarantees for Quantum Neural Estimation of Entropies [31.955071410400947]
  Quantum neural estimators (QNEs) combine classical neural networks with parametrized quantum circuits.<n>We study formal guarantees for QNEs of measured relative entropies in the form of non-asymptotic error risk bounds.<n>Our theory aims to facilitate principled implementation of QNEs for measured relative entropies.
  arXiv  Detail & Related papers  (2025-11-24T16:36:06Z)
• Variational preparation of entangled states in a system of transmon qubits [29.259008600842517]
  We use a minimally calibrated two-qubit i-Swap-like gate to prepare Bell states and GHZ states experimentally in systems of two and three transmon qubits.<n>Our proposed methodology employs variational quantum algorithms (VQAs) to create the target quantum state through imperfect multiqubit operations.
  arXiv  Detail & Related papers  (2025-04-02T14:09:26Z)
• Realizing a Continuous Set of Two-Qubit Gates Parameterized by an Idle Time [34.99747682571461]
  Continuous gate sets are a key ingredient for near-term quantum algorithms.<n>We demonstrate a hardware-efficient, continuous set of controlled arbitrary-phase gates acting on transmon qubits.<n>This native gate set has the potential to reduce the depth and improve the performance of near-term quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-14T08:49:47Z)
• Semiparametric Double Reinforcement Learning with Applications to Long-Term Causal Inference [33.14076284663493]
  Long-term causal effects must be estimated from short-term data.<n>MDPs provide a natural framework for capturing such long-term dynamics.<n>Nonparametric implementations require strong intertemporal overlap assumptions.<n>We introduce a novel plug-in estimator based on isotonic Bellman calibration.
  arXiv  Detail & Related papers  (2025-01-12T20:35:28Z)
• Efficient Qubit Calibration by Binary-Search Hamiltonian Tracking [18.54622697112264]
  We present and experimentally implement a real-time protocol for calibrating the frequency of a resonantly driven qubit.<n>We show the efficacy of the algorithm by stabilizing a flux-tunable transmon qubit, leading to improved coherence and gate fidelity.
  arXiv  Detail & Related papers  (2025-01-09T17:18:38Z)
• Real-time error mitigation for variational optimization on quantum hardware [45.935798913942904]
  We define a Real Time Quantum Error Mitigation (RTQEM) algorithm to assist in fitting functions on quantum chips with VQCs. Our RTQEM routine can enhance VQCs' trainability by reducing the corruption of the loss function.
  arXiv  Detail & Related papers  (2023-11-09T19:00:01Z)
• Algorithmic Shadow Spectroscopy [0.0]
  We present a simulator-agnostic quantum algorithm for estimating energy gaps using very few circuit repetitions (shots) and no extra resources (ancilla qubits) We demonstrate that our method is intuitively easy to use in practice, robust against gate noise, to a new type of algorithmic error mitigation technique, and uses orders of magnitude fewer number of shots than typical near-term quantum algorithms -- as low as 10 shots per timestep is sufficient.
  arXiv  Detail & Related papers  (2022-12-21T14:23:48Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• Fast Quantum Calibration using Bayesian Optimization with State Parameter Estimator for Non-Markovian Environment [11.710177724383954]
  We propose a real-time optimal estimator of qubit states, which utilizes weak measurements and Bayesian optimization to find the optimal control pulses for gate design. Our numerical results demonstrate a significant reduction in the calibration process, obtaining a high gate fidelity.
  arXiv  Detail & Related papers  (2022-05-25T17:31:15Z)
• New bounds on adaptive quantum metrology under Markovian noise [0.0]
  We analyse the problem of estimating a scalar parameter $g$ that controls the Hamiltonian of a quantum system subject to Markovian noise. We place bounds on the growth rate of the quantum Fisher information with respect to $g$, in terms of the Lindblad operators and the $g$-derivative of the Hamiltonian $H$. We demonstrate that the sensitivity is related to the quantum fluctuations of $partial H/partial g$, illustrating how 'non-classical' states can enhance the range of signals that a system is sensitive to.
  arXiv  Detail & Related papers  (2021-08-25T18:00:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.