Learning Sparse Graph States with Local Pauli Measurements: Tight Nonadaptive Bounds and an Adaptive Separation
quant-ph
Submitted: 2026-11-12
Updated: 2026-11-12
Terminology
Sources
- On Learning Graphs with Edge-Detecting Queries
- Optimal Stabilizer Testing and Learning with Limited Quantum Memory
- Optimal algorithms for learning quantum phase states
- Learning depth-3 circuits via quantum agnostic boosting
- Adaptivity is all you need: Optimal stabilizer learning using just single-copy measurements
- Random regular graph states are complex at almost any depth
- Learning unknown stabilizer codes using product measurements
- Lower Bounds for Learning Quantum States with Single-Copy Measurements
- Learning quantum graph states with product measurements
- Sprinkling for random regular graphs and Kim-Vu's sandwich conjecture
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements