Learning Noise-Robust Stabilizer Structure via Bell Sampling
quant-ph
Submitted: 2026-10-02
Updated: 2026-10-05
Comments: 57 pages, 12 figures, 3 tables
License: http://creativecommons.org/licenses/by/4.0/
The gist: Bell sampling efficiently learns the stabilizer group, and hence the stabilizer nullity, of pure states with little magic, a primitive underlying tomography and certification of low-magic states.
Abstract
Bell sampling efficiently learns the stabilizer group, and hence the stabilizer nullity, of pure states with little magic, a primitive underlying tomography and certification of low-magic states. Real devices, however, only prepare noisy images of the target, which we model as a Pauli channel acting on the ideal state; the resulting noisy state generically has no exact Pauli stabilizers. Existing structure learners for mixed states rely on such exact stabilizers. Agnostic tomography does not, but its guarantees scale exponentially in the nullity t. We show that the ideal stabilizer group remains encoded in the noisy state as the set of Pauli operators under which it is invariant. We give Bell-sampling algorithms that learn the group to accuracy epsilon for states of nullity at most t. The difficulty is that noisy samples break the group structure pure-state learners rely on, so more samples can erase structure rather than reveal it. We resolve this with a finder-verifier scheme that extracts stabilizer structure from partially corrupted sample batches while certifying proposed updates. For sufficiently weak global depolarizing noise, both samples and runtime are poly(n,t,1/epsilon) when the channel's total error probability is at most of order epsilon n/t. Up to a constant total error probability (about 0.16), samples remain polynomial while classical processing costs 2 t, and for any error probability below one a 4 t overhead suffices. Arbitrary Pauli channels exhibit the same three regimes, with more restrictive thresholds. For weak Pauli noise, this closes much of the gap between agnostic learners such as stabilizer bootstrapping and polynomial pure-state algorithms.
Sources
- The Heisenberg Representation of Quantum Computers
- Learning stabilizer states by Bell sampling
- Transversality versus Universality for Additive Quantum Codes
- Assessing requirements to scale to practical quantum advantage
- Single-copy stabilizer learning: average case and worst case
- Tomography of quantum states with bounded extent
- Efficient Learning of Clifford-Scrambled Product States
- Efficient learning of Clifford disentanglers and typical t-doped unitaries with exponentially more T gates
- Learning Clifford-structured quantum unitaries and Hamiltonians
- Learning the closest product state
- Agnostic learning of qudit stabilizer states
- Tolerant Testing of Stabilizer States with Mixed State Inputs
- Learning unknown stabilizer codes using product measurements
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
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians