Learning t-doped stabilizer states

Abstract

In this paper, we present a learning algorithm aimed at learning states obtained from computational basis states by Clifford circuits doped with a finite number $t$ of $T$-gates. The algorithm learns an exact tomographic description of $t$-doped stabilizer states in terms of Pauli observables. This is possible because such states are countable and form a discrete set. To tackle the problem, we introduce a novel algebraic framework for $t$-doped stabilizer states, which extends beyond $T$-gates and includes doping with any kind of local non-Clifford gate. The algorithm requires resources of complexity $\text{poly}(n,2^t)$ and exhibits an exponentially small probability of failure.

arXiv commentL.L. and S.O. contributed equally to this work

References in corpus (16)

• Predicting Many Properties of a Quantum System from Very Few Measurements
• Quantum state tomography via compressed sensing
• A Theory of Fault-Tolerant Quantum Computation
• Experimental Quantum State Tomography of Optical Fields and Ultrafast Statistical Sampling
• Unknown Quantum States and Operations, a Bayesian View
• Efficient quantum state tomography
• Stabilizer Rényi entropy
• Optimal state estimation for d-dimensional quantum systems
• Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
• Hadamard-free circuits expose the structure of the Clifford group
• Quantum Chaos is Quantum
• Transitions in entanglement complexity in random quantum circuits by measurements
• Lower bound for the T count via unitary stabilizer nullity
• Learning efficient decoders for quasi-chaotic quantum scramblers
• Learning quantum circuits of some $T$ gates
• Unscrambling Quantum Information with Clifford decoders

Cited by in corpus (32)

• Stabilizer entropies are monotones for magic-state resource theory
• Pauli Spectrum and Non-stabilizerness of Typical Quantum Many-Body States
• Magic-induced computational separation in entanglement theory
• Bell sampling from quantum circuits
• Probing quantum complexity via universal saturation of stabilizer entropies
• Efficient mutual magic and magic capacity with matrix product states
• Doped stabilizer states in many-body physics and where to find them
• Stabilizer Tensor Networks with Magic State Injection
• Efficient learning of quantum states prepared with few fermionic non-Gaussian gates
• Learning quantum states of continuous variable systems
• Bridging Entanglement and Magic Resources within Operator Space
• Interplay of entanglement structures and stabilizer entropy in spin models
• Efficient distributed inner product estimation via Pauli sampling
• Efficient witnessing and testing of magic in mixed quantum states
• Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates
• Optimal trace-distance bounds for free-fermionic states: Testing and improved tomography
• Designs from magic-augmented Clifford circuits
• Anticoncentration and State Design of Doped Real Clifford Circuits and Tensor Networks
• Optimal estimates of trace distance between bosonic Gaussian states and applications to learning
• Single-copy stabilizer testing
• Rise and fall of nonstabilizerness via random measurements
• Invested and Potential Magic Resources in Measurement-Based Quantum Computation
• Highly-entangled, highly-doped states that are efficiently cross-device verifiable
• PAC-learning of free-fermionic states is NP-hard
• Experimental measurement and a physical interpretation of quantum shadow enumerators
• Anticoncentration in Clifford Circuits and Beyond: From Random Tensor Networks to Pseudo-Magic States
• Limits of Clifford Disentangling in Tensor Network States
• The symplectic rank of non-Gaussian quantum states
• The abelian state hidden subgroup problem: Learning stabilizer groups and beyond
• Pseudoentanglement Ain't Cheap
• Adaptively secure unitary designs with constant non-Clifford cost
• Agnostic Tomography of Stabilizer Product States