Efficient witnessing and testing of magic in mixed quantum states
arXiv:2504.18098 · doi:10.1038/s41534-026-01189-z
Abstract
Nonstabilizerness or `magic' is a crucial resource for quantum computers which can be distilled from noisy quantum states. However, determining the magic of mixed quantum has been a notoriously difficult task. Here, we provide efficient witnesses of magic based on the stabilizer Rényi entropy which robustly indicate the presence of magic and quantitatively estimate magic monotones. We also design efficient property testing algorithms to reliably distinguish states with high and low magic, assuming the entropy is bounded. We apply our methods to certify the number of noisy T-gates under a wide class of noise models. Additionally, using the IonQ quantum computer, we experimentally verify the magic of noisy random quantum circuits. Surprisingly, we find that magic is highly robust, persisting even under exponentially strong noise. Our witnesses can also be efficiently computed for matrix product states, revealing that subsystems of many-body quantum states can contain extensive magic despite entanglement. Finally, our work also has direct implications for cryptography and pseudomagic: To mimic high magic states with as little magic as possible, one requires an extensive amount of entropy. This implies that entropy is a necessary resource to hide magic from eavesdroppers. Our work uncovers powerful tools to verify and study the complexity of noisy quantum systems.
10 + 13 pages, 4 + 9 figures
References in corpus (37)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Noisy intermediate-scale quantum (NISQ) algorithms
- Logical quantum processor based on reconfigurable atom arrays
- The ITensor Software Library for Tensor Network Calculations
- Restrictions on Transversal Encoded Quantum Gate Sets
- Application of a resource theory for magic states to fault-tolerant quantum computing
- Mixed-state entanglement from local randomized measurements
- Stabilizer Rényi entropy
- Quantifying nonstabilizerness of matrix product states
- Stabilizer entropies and nonstabilizerness monotones
- Scalable measures of magic resource for quantum computers
- Many-body magic via Pauli-Markov chains -- from criticality to gauge theories
- Stabilizer entropies are monotones for magic-state resource theory
- Magic-state resource theory for the ground state of the transverse-field Ising model
- Catalysis and activation of magic states in fault tolerant architectures
- Optimal Entanglement Certification from Moments of the Partial Transpose
- Nonstabilizerness via matrix product states in the Pauli basis
- Measuring nonstabilizerness via multifractal flatness
- Phase transition in magic with random quantum circuits
- Simulation of Qubit Quantum Circuits via Pauli Propagation
- Magic spreading in random quantum circuits
- Pauli Spectrum and Non-stabilizerness of Typical Quantum Many-Body States
- Efficient quantum algorithms for stabilizer entropies
- Critical behaviors of non-stabilizerness in quantum spin chains
- Learning t-doped stabilizer states
- Pseudomagic Quantum States
- Efficiently computing the Uhlmann fidelity for density matrices
- Probing quantum complexity via universal saturation of stabilizer entropies
- Improved Stabilizer Estimation via Bell Difference Sampling
- Efficient mutual magic and magic capacity with matrix product states
- Pseudorandom unitaries are neither real nor sparse nor noise-robust
- Entanglement detection with trace polynomials
- Pseudorandom density matrices
- Long-range nonstabilizerness and phases of matter
- A nonstabilizerness monotone from stabilizerness asymmetry
- Mixed-state additivity properties of magic monotones based on quantum relative entropies for single-qubit states and beyond
- Single-copy stabilizer testing