Adaptivity is all you need: Optimal stabilizer learning using just single-copy measurements
L. Bittel, J. Eisert, W. Gong, A. A. Mele, L. Schatzki
Abstract
Stabilizer states are central to quantum computing, underlying quantum error correction, benchmarking, and efficient classical simulation. Yet their learnability exhibits a striking gap: an n-qubit stabilizer state can be learned from Θ(n) copies using two-copy Bell measurements, whereas non-adaptive single-copy measurements require Ω(n2) copies. Here we show that adaptivity completely closes this gap. We give a polynomial-time adaptive algorithm that learns an arbitrary n-qubit stabilizer state from Θ(n) single-copy Clifford measurements, matching the optimal sample complexity of Bell sampling without any multi-copy measurements. The same ideas yield a sample-optimal single-copy tolerant tester and, with k qubits of quantum memory, the optimal testing tradeoff Θ(n-k+1/) at infidelity . Finally, we show that this adaptive mechanism extends beyond exact stabilizer states: states of stabilizer nullity at most r, including states prepared by Clifford circuits with a bounded number of T gates, can be learned using O(n2r) single-copy measurements.
Create a lesson
Related papers
Single-Particle Spectral Estimation
Adrian Chapman, Charles Derby, Steven T. Flammia et al.
Learning SYK Hamiltonians
Anurag Anshu, Srinivasan Arunachalam, Sitan Chen et al.
From Permutation Symmetry to Communication Bounds and Additivity
Zahra Baghali Khanian, Debbie Leung, Graeme Smith
Robust exponential lower bounds for fermionic and bosonic Gaussian ranks
Fuchuan Wei, Kong-Wing Wu, Zhengwei Liu et al.
Polynomial-time classical and quantum simulation of quantum impurity models
Jiaqing Jiang, Nathan Ju, Ojas Parekh et al.
Beyond Light Cones: State Preparation Complexity in Quantum Spin Glasses
Omar Al-Ghattas, David Gamarnik, Bobak T Kiani