AKS-QFI separates Krylov truncation from finite-sample uncertainty in QFI estimation, eliminating false stops (rates 0.16-0.68 for width-only) and achieving accurate 5% tolerance declarations on n=4 qubit benchmarks.
Robust Online Hamiltonian Learning
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this work we combine two distinct machine learning methodologies, sequential Monte Carlo and Bayesian experimental design, and apply them to the problem of inferring the dynamical parameters of a quantum system. We design the algorithm with practicality in mind by including parameters that control trade-offs between the requirements on computational and experimental resources. The algorithm can be implemented online (during experimental data collection), avoiding the need for storage and post-processing. Most importantly, our algorithm is capable of learning Hamiltonian parameters even when the parameters change from experiment-to-experiment, and also when additional noise processes are present and unknown. The algorithm also numerically estimates the Cramer-Rao lower bound, certifying its own performance.
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Reliable Adaptive Stopping for Krylov-Shadow Quantum Fisher Information Estimation
AKS-QFI separates Krylov truncation from finite-sample uncertainty in QFI estimation, eliminating false stops (rates 0.16-0.68 for width-only) and achieving accurate 5% tolerance declarations on n=4 qubit benchmarks.