Universal Sample Complexity Bounds in Quantum Learning Theory via Fisher Information Matrix
quant-ph
Submitted: 2026-02-25
Updated: 2026-07-30
Terminology
Sources
- Quantum advantages for syndrome-aware noisy logical observable estimation
- Hamiltonian Dynamics Learning: A Scalable Approach to Quantum Process Characterization
- Exponential advantage in continuous-variable quantum state learning
- Entanglement-enhanced learning of quantum processes at scale
- On the Fundamental Resource for Exponential Advantage in Quantum Channel Learning
- Restoring Heisenberg scaling in time via autonomous quantum error correction
- Criteria for unbiased estimation: applications to noise-agnostic sensing and quantum channel estimation
- Instance-optimal high-precision shadow tomography with few-copy measurements: A metrological approach
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity