Stabilizer Testing and Magic Entropy via Quantum Fourier Analysis
arXiv:2306.09292 · doi:10.1007/s00220-025-05421-3
Abstract
Quantum Fourier analysis is an important topic in mathematical physics. We introduce a systematic protocol for testing and measuring ``magic'' in quantum states and gates, using a quantum Fourier approach. Magic, as a quantum resource, is necessary to achieve a quantum advantage in computation. Our protocols are based on quantum convolutions and swap tests, implemented via quantum circuits. We describe this for both qubit and qudit systems. Our quantum Fourier approach offers a unified method to quantify magic, in stabilizer circuits, as well as in matchgate and bosonic Gaussian circuits.
35 pages, close to the published version
References in corpus (60)
- Entanglement entropy and conformal field theory
- Measuring entanglement entropy through the interference of quantum many-body twins
- Holographic Entanglement Entropy: An Overview
- On quantum Renyi entropies: a new generalization and some properties
- The second laws of quantum thermodynamics
- High-fidelity parallel entangling gates on a neutral atom quantum computer
- The Resource Theory of Stabilizer Computation
- Min- and Max- Relative Entropies and a New Entanglement Monotone
- Positive Wigner functions render classical simulation of quantum computation efficient
- Application of a resource theory for magic states to fault-tolerant quantum computing
- Negative Quasi-Probability as a Resource for Quantum Computation
- Hudson's Theorem for finite-dimensional quantum systems
- Quantum Information Processing with Finite Resources -- Mathematical Foundations
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Trading classical and quantum computational resources
- Stabilizer Rényi entropy
- Simulation of quantum circuits by low-rank stabilizer decompositions
- SIC-POVMs and the Extended Clifford Group
- A quantum central limit theorem for non-equilibrium systems: Exact local relaxation of correlated states
- Multiqubit Clifford groups are unitary 3-designs
- Quantum f-divergences and error correction
- Quantifying the magic of quantum channels
- Quantifying nonstabilizerness of matrix product states
- Quantifying quantum speedups: improved classical simulation from tighter magic monotones
- Stabilizer entropies and nonstabilizerness monotones
- 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
- Efficient simulation scheme for a class of quantum optics experiments with non-negative Wigner representation
- The entropy power inequality for quantum systems
- Simulation of Qubit Quantum Circuits via Pauli Propagation
- Robust self-testing of many-qubit states
- On the statistical complexity of quantum circuits
- Resource theory of quantum scrambling
- Local Hamiltonians Whose Ground States are Hard to Approximate
- A generalization of the Entropy Power Inequality to Bosonic Quantum Systems
- Efficient classical simulation of Clifford circuits with nonstabilizer input states
- Lower bound for the T count via unitary stabilizer nullity
- Fermionic Linear Optics Revisited
- Quantum Entropy and Central Limit Theorem
- Low-degree testing for quantum states, and a quantum entangled games PCP for QMA
- Testing product states, quantum Merlin-Arthur games and tensor optimisation
- Learning and Testing Algorithms for the Clifford Group
- Learning quantum circuits of some gates
- Property testing of unitary operators
- A linearized stabilizer formalism for systems of finite dimension
- Continuous-variable entanglement distillation and non-commutative central limit theorems
- Entropy power inequalities for qudits
- Exchange relation planar algebras of small rank
- Quantum Fourier Analysis
- Convergence rates for the quantum central limit theorem
- Complexity of quantum circuits via sensitivity, magic, and coherence
- Properties of subentropy
- Improved Stabilizer Estimation via Bell Difference Sampling
- Magic Resource Can Enhance the Quantum Capacity of Channels
- Quantum interactive proofs and the complexity of separability testing
- Central limit theorems for the large-spin asymptotics of quantum spins
- On a generalized Central Limit Theorem and Large Deviations for Homogeneous Open Quantum Walks
- On a Quantum Entropy Power Inequality of Audenaert, Datta and Ozols
- Quantum Ruzsa Divergence to Quantify Magic
- Quantum convolution inequalities on Frobenius von Neumann algebras