Adaptive Online Learning of Quantum States
arXiv:2206.00220 · doi:10.22331/q-2024-09-12-1471
Abstract
The problem of efficient quantum state learning, also called shadow tomography, aims to comprehend an unknown -dimensional quantum state through POVMs. Yet, these states are rarely static; they evolve due to factors such as measurements, environmental noise, or inherent Hamiltonian state transitions. This paper leverages techniques from adaptive online learning to keep pace with such state changes. The key metrics considered for learning in these mutable environments are enhanced notions of regret, specifically adaptive and dynamic regret. We present adaptive and dynamic regret bounds for online shadow tomography, which are polynomial in the number of qubits and sublinear in the number of measurements. To support our theoretical findings, we include numerical experiments that validate our proposed models.
28 pages, 4 figures
References in corpus (18)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- QuTiP 2: A Python framework for the dynamics of open quantum systems
- QuTiP: An open-source Python framework for the dynamics of open quantum systems
- Quantum Resource Theories
- Operational Resource Theory of Coherence
- Area laws in quantum systems: mutual information and correlations
- Catalytic Coherence
- A Sharp Fannes-type Inequality for the von Neumann Entropy
- Estimating the Coherence of Noise
- Comparing Experiments to the Fault-Tolerance Threshold
- The effect of noise correlations on randomized benchmarking
- Modeling coherent errors in quantum error correction
- Learning Temporal Quantum Tomography
- From joint convexity of quantum relative entropy to a concavity theorem of Lieb
- Maximum and minimum entropy states yielding local continuity bounds
- Online Learning of Quantum States
- Multi-armed quantum bandits: Exploration versus exploitation when learning properties of quantum states