Certifying nonstabilizerness in quantum processors
arXiv:2404.16107 · doi:10.1088/1751-8121/ade9ff
Abstract
Nonstabilizerness, also known as magic, is a crucial resource for quantum computation. The growth in complexity of quantum processing units (QPUs) demands robust and scalable techniques for characterizing this resource. We introduce the notion of set magic: a set of states has this property if at least one state in the set is a non-stabilizer state. We show that certain two-state overlap inequalities, recently introduced as witnesses of basis-independent coherence, are also witnesses of multi-qubit set magic. We also show it is possible to certify the presence of magic across multiple QPUs without the need for entanglement between them and reducing the demands on each individual QPU.
7+10 pages, 3+2 figures. Comments are welcome!
References in corpus (75)
- Quantum entanglement
- Quantum Computing in the NISQ era and beyond
- Quantifying Coherence
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum Coherence as a Resource
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Resource Theories
- Quantum fingerprinting
- Logical quantum processor based on reconfigurable atom arrays
- Contextuality for preparations, transformations, and unsharp measurements
- Contextuality supplies the magic for quantum computation
- Quantum Error Mitigation
- Advances in High Dimensional Quantum Entanglement
- Robustness of coherence: An operational and observable measure of quantum coherence
- The Resource Theory of Stabilizer Computation
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
- Methodology for quantum logic gate constructions
- Graph-Theoretic Approach to Quantum Correlations
- Quantum certification and benchmarking
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Testing the Hilbert space dimension
- Trading classical and quantum computational resources
- Stabilizer Rényi entropy
- Simulation of quantum circuits by low-rank stabilizer decompositions
- Quantum Cryptography Beyond Quantum Key Distribution
- Magic State Distillation: Not as Costly as You Think
- Estimating outcome probabilities of quantum circuits using quasiprobabilities
- Kochen-Specker Contextuality
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- Quantifying quantum resources with conic programming
- Quantifying quantum speedups: improved classical simulation from tighter magic monotones
- Stabilizer entropies and nonstabilizerness monotones
- Scalable measures of magic resource for quantum computers
- Measuring magic on a quantum processor
- Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
- Bounding the set of finite dimensional quantum correlations
- Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
- Catalysis and activation of magic states in fault tolerant architectures
- A Complete Resource Theory of Quantum Incompatibility as Quantum Programmability
- Experimental progress on quantum coherence: detection, quantification, and manipulation
- Quantum circuits for measuring weak values, Kirkwood--Dirac quasiprobability distributions, and state spectra
- Measuring nonstabilizerness via multifractal flatness
- Beyond the swap test: optimal estimation of quantum state overlap
- Simulation of Qubit Quantum Circuits via Pauli Propagation
- Set coherence: basis-independent quantification of quantum coherence
- Efficient quantum algorithms for stabilizer entropies
- Semidefinite programming relaxations for quantum correlations
- Uniqueness of noncontextual models for stabilizer subtheories
- Frobenius-norm-based measures of quantum coherence and asymmetry
- Witnessing genuine multi-photon indistinguishability
- Basis-independent quantum coherence and its distribution
- Unitary-invariant witnesses of quantum imaginarity
- Lower bound for the T count via unitary stabilizer nullity
- Stabilizer Tensor Networks: universal quantum simulator on a basis of stabilizer states
- Stabilizer extent is not multiplicative
- Quantifying n-photon indistinguishability with a cyclic integrated interferometer
- Multivariate trace estimation in constant quantum depth
- Experimental certification of contextuality, coherence and dimension in a programmable universal photonic processor
- Informationally restricted correlations: a general framework for classical and quantum systems
- Collective phases of identical particles interfering on linear multiports
- An Improved Sample Complexity Lower Bound for (Fidelity) Quantum State Tomography
- Experimental quantification of genuine four-photon indistinguishability
- Quantum and classical bounds for two-state overlaps
- A universal scheme for robust self-testing in the prepare-and-measure scenario
- Coherence and contextuality in a Mach-Zehnder interferometer
- Inequalities witnessing coherence, nonlocality, and contextuality
- Multi-object operational tasks for convex quantum resource theories
- Contextuality and The Single-Qubit Stabilizer Formalism
- Witnesses of coherence and dimension from multiphoton indistinguishability tests
- Quantum Incompatibility of a Physical Context
- Graph-Theoretic Framework for Self-Testing in Bell Scenarios
- A coherence-witnessing game and applications to semi-device-independent quantum key distribution
- An estimation theoretic approach to quantum realizability problems
- Witnessing Magic with Bell inequalities