Disentangling magic states with classically simulable quantum circuits
arXiv:2410.09001 · doi:10.1103/ggp1-byj1
Abstract
We show that states obtained from deep random Clifford circuits doped with non-Clifford phase gates (including T-gates and -gates) can be disentangled completely, provided the number of non-Clifford gates is smaller or approximately equal to the number of qubits. This implies that Pauli expectation values of such states can be efficiently simulated classically, despite them exhibiting both extensive entanglement and extensive nonstabilizerness. We prove this result analytically using a quantum error correction formulation, demonstrate its applicability numerically, and discuss consequences for the disentanglability of states generated through Hamiltonian dynamics. We show that this result implies a novel representation of approximate state designs that can also facilitate their efficient generation, and we propose a novel quantum circuit compression scheme for Clifford circuits doped with non-Clifford phase gates.
8 pages, 5 figures; revised version with a deepened discussion of the analytical results; v3: accepted manuscript
References in corpus (50)
- The density-matrix renormalization group in the age of matrix product states
- Area laws for the entanglement entropy - a review
- Efficient classical simulation of slightly entangled quantum computations
- Efficient simulation of one-dimensional quantum many-body systems
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Improved Simulation of Stabilizer Circuits
- Quantum Resource Theories
- Logical quantum processor based on reconfigurable atom arrays
- Time-dependent variational principle for quantum lattices
- Tensor networks for complex quantum systems
- The Resource Theory of Stabilizer Computation
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Average-case complexity versus approximate simulation of commuting quantum computations
- Trading classical and quantum computational resources
- Stabilizer Rényi entropy
- Lecture Notes of Tensor Network Contractions
- Instantaneous Quantum Computation
- Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
- Quantifying nonstabilizerness of matrix product states
- Stabilizer entropies and nonstabilizerness monotones
- Measuring magic on a quantum processor
- Scalable measures of magic resource for quantum computers
- Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
- Conformal field theories are magical
- Many-body magic via Pauli-Markov chains -- from criticality to gauge theories
- Emergent irreversibility and entanglement spectrum statistics
- Stabilizer entropies are monotones for magic-state resource theory
- Nonstabilizerness via matrix product states in the Pauli basis
- Phase transition in magic with random quantum circuits
- Magic spreading in random quantum circuits
- Efficient quantum algorithms for stabilizer entropies
- Dynamical Magic Transitions in Monitored Clifford+T Circuits
- Efficient unitary designs with a system-size independent number of non-Clifford gates
- T-count optimization and Reed-Muller codes
- Critical behaviors of non-stabilizerness in quantum spin chains
- Augmenting Density Matrix Renormalization Group with Clifford Circuits
- Quantum advantage of unitary Clifford circuits with magic state inputs
- All pure fermionic non-Gaussian states are magic states for matchgate computations
- Lower bound for the T count via unitary stabilizer nullity
- Learning efficient decoders for quasi-chaotic quantum scramblers
- Magic in generalized Rokhsar-Kivelson wavefunctions
- Transitions in Entanglement Complexity in Random Circuits
- Irreversibility and Entanglement Spectrum Statistics in Quantum Circuits
- Stabilizer Tensor Networks: universal quantum simulator on a basis of stabilizer states
- Probing quantum complexity via universal saturation of stabilizer entropies
- Hybrid Stabilizer Matrix Product Operator
- Clifford Dressed Time-Dependent Variational Principle
- Stabilizer Tensor Networks with Magic State Injection
- Magic of Random Matrix Product States
- Disentangling Interacting Systems with Fermionic Gaussian Circuits: Application to Quantum Impurity Models
Cited by in corpus (7)
- Stabilizer Rényi Entropy and Conformal Field Theory
- Designs from magic-augmented Clifford circuits
- Stabilizer Rényi Entropy Encodes Fusion Rules of Topological Defects and Boundaries
- Anticoncentration and State Design of Doped Real Clifford Circuits and Tensor Networks
- Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states
- Analyzing the free states of one quantum resource theory as resource states of another
- Limits of Clifford Disentangling in Tensor Network States