Precision Limits of Hamiltonian Learning for Quantum Processors under Calibration Uncertainty

Abstract Learning the Hamiltonian of a quantum processor is important for controlling and certifying quantum devices, but the state preparation and measurement used to probe it are themselves imperfect. Even when exact data identify an interaction uniquely, identifiability alone does not determine finite-data precision. Here we show, for n-qubit Markovian dynamics under geometric regularity conditions, that the local uncertainty of a Hamiltonian coefficient scales either linearly or as the square root of the entrywise error in the generator matrix in the readout gauge. Square-root scaling occurs exactly when a gauge transformation moves the coefficient at first order while noise positivity can be restored at second order, and real noise correlations drive this first-order change. As a consequence, under suitable dynamical and readout conditions, square-root scaling forces uniformly valid confidence intervals from N shots to have expected length Ω(N⁻¹⁄⁴), even for adaptive local experiments. Under a common generator norm bound, estimating this matrix attains this rate up to logarithmic factors. Experiments on three superconducting processors show that additional measurement bases increase the visibility of injected rotations at a matched number of shots. Whether a coupling admits the usual N⁻¹⁄² scaling is therefore set by how noise correlations and positivity constrain its gauge directions.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-11-12
DOI
https://doi.org/10.21203/rs.3.rs-11695581/v1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Precision Limits of Hamiltonian Learning for Quantum Processors under Calibration Uncertainty

Isaac Lyngaas, Yingfeng Wang, Yi Pan, Tianming Liu et al.
Research Square
Quantum Computing Algorithms and Architecture
preprint

Precision Limits of Hamiltonian Learning for Quantum Processors under Calibration Uncertainty

Isaac Lyngaas, Yingfeng Wang, Yi Pan, Tianming Liu, Wei Zhang, Meng Hsiu Tsai, Hanqi Jiang, Junhao Chen
preprint en

Abstract

Abstract Learning the Hamiltonian of a quantum processor is important for controlling and certifying quantum devices, but the state preparation and measurement used to probe it are themselves imperfect. Even when exact data identify an interaction uniquely, identifiability alone does not determine finite-data precision. Here we show, for n-qubit Markovian dynamics under geometric regularity conditions, that the local uncertainty of a Hamiltonian coefficient scales either linearly or as the square root of the entrywise error in the generator matrix in the readout gauge. Square-root scaling occurs exactly when a gauge transformation moves the coefficient at first order while noise positivity can be restored at second order, and real noise correlations drive this first-order change. As a consequence, under suitable dynamical and readout conditions, square-root scaling forces uniformly valid confidence intervals from N shots to have expected length Ω(N⁻¹⁄⁴), even for adaptive local experiments. Under a common generator norm bound, estimating this matrix attains this rate up to logarithmic factors. Experiments on three superconducting processors show that additional measurement bases increase the visibility of injected rotations at a matched number of shots. Whether a coupling admits the usual N⁻¹⁄² scaling is therefore set by how noise correlations and positivity constrain its gauge directions.

Research Square
Oak Ridge National Laboratory (US), University of Georgia (US), University of Tennessee at Chattanooga (US), Augusta University (US)
U.S. Department of Energy
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon