Magic of quantum hypergraph states

Abstract

Magic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states and plays a fundamental role from quantum state complexity to universal fault-tolerant quantum computing. However, analytical or even numerical characterizations of magic are very challenging, especially in the multi-qubit system, even with a moderate qubit number. Here we systemically and analytically investigate the magic resource of archetypal multipartite quantum states -- quantum hypergraph states, which can be generated by multi-qubit Controlled-phase gates encoded by hypergraphs. We first give the magic formula in terms of the stabilizer R$\acute{\mathrm{e}}$nyi-$\alpha$ entropies for general quantum hypergraph states and prove the magic can not reach the maximal value, if the average degree of the corresponding hypergraph is constant. Then we investigate the statistical behaviors of random hypergraph states and prove the concentration result that typically random hypergraph states can reach the maximal magic. This also suggests an efficient way to generate maximal magic states with random diagonal circuits. Finally, we study some highly symmetric hypergraph states with permutation-symmetry, such as the one whose associated hypergraph is $3$-complete, i.e., any three vertices are connected by a hyperedge. Counterintuitively, such states can only possess constant or even exponentially small magic for $\alpha \ge 2$. Our study advances the understanding of multipartite quantum magic and could lead to applications in quantum computing and quantum many-body physics.

arXiv commentpublished version: 20+17 pages, 4 figures, comments are welcome

References in corpus (68)

• Quantum entanglement
• Quantum Teleportation is a Universal Computational Primitive
• Entanglement Spectrum as a Generalization of Entanglement Entropy: Identification of Topological Order in Non-Abelian Fractional Quantum Hall Effect States
• Measurement-based quantum computation with cluster states
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Improved Simulation of Stabilizer Circuits
• Quantum Error Correction for Quantum Memories
• Quantum Computing with Very Noisy Devices
• Multi-party entanglement in graph states
• Roads towards fault-tolerant universal quantum computation
• Braiding statistics approach to symmetry-protected topological phases
• The Resource Theory of Stabilizer Computation
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Negative Quasi-Probability as a Resource for Quantum Computation
• Detecting Genuine Multipartite Entanglement with Two Local Measurements
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Average-case complexity versus approximate simulation of commuting quantum computations
• Trading classical and quantum computational resources
• Stabilizer Rényi entropy
• Simulation of quantum circuits by low-rank stabilizer decompositions
• Estimating outcome probabilities of quantum circuits using quasiprobabilities
• Quantum Hypergraph States
• Topological phases with generalized global symmetries
• Experimental demonstration of a graph state quantum error-correction code
• 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
• Quantifying magic for multi-qubit operations
• Measuring magic on a quantum processor
• Scalable measures of magic resource for quantum computers
• Robustness of Magic and Symmetries of the Stabiliser Polytope
• One-Shot Operational Quantum Resource Theory
• Efficiently computable bounds for magic state distillation
• Conformal field theories are magical
• Quantum Chaos is Quantum
• Many-body magic via Pauli-Markov chains -- from criticality to gauge theories
• Emergent irreversibility and entanglement spectrum statistics
• Magic-state resource theory for the ground state of the transverse-field Ising model
• Hierarchy of universal entanglement in 2D measurement-based quantum computation
• Multipartite Entanglement and Global Information
• Entanglement and nonclassical properties of hypergraph states
• Encoding Hypergraphs into Quantum States
• Nonstabilizerness determining the hardness of direct fidelity estimation
• Single T gate in a Clifford circuit drives transition to universal entanglement spectrum statistics
• Resource theory of quantum scrambling
• Efficient unitary designs with a system-size independent number of non-Clifford gates
• Complexity of frustration: a new source of non-local non-stabilizerness
• Stabilizer entropy dynamics after a quantum quench
• Symmetry-protected sign problem and magic in quantum phases of matter
• Quantum Entropy and Central Limit Theorem
• Transitions in Entanglement Complexity in Random Circuits
• Learning efficient decoders for quasi-chaotic quantum scramblers
• Irreversibility and Entanglement Spectrum Statistics in Quantum Circuits
• Characterization of an operational quantum resource in a critical many-body system
• Quantum State Complexity in Computationally Tractable Quantum Circuits
• Diagonal quantum circuits: their computational power and applications
• Latent Computational Complexity of Symmetry-Protected Topological Order with Fractional Symmetry
• Retrieving information from a black hole using quantum machine learning
• Quantifying dynamical magic with completely stabilizer preserving operations as free
• Mana and thermalization: probing the feasibility of near-Clifford Hamiltonian simulation
• Entanglement of random hypergraph states
• Entanglement complexity of the Rokhsar-Kivelson-sign wavefunctions
• Mana in Haar-random states
• Quantum Magic via Perfect Pauli Sampling of Matrix Product States
• Quantifying non-stabilizerness through entanglement spectrum flatness
• A Framework for Non-Asymptotic Quantum Information Theory
• Generic Entanglement Entropy for Quantum States with Symmetry

Cited by in corpus (17)

• Stabilizer entropies are monotones for magic-state resource theory
• Pauli Spectrum and Non-stabilizerness of Typical Quantum Many-Body States
• Non-stabilizerness versus entanglement in matrix product states
• Critical behaviors of non-stabilizerness in quantum spin chains
• Interplay of entanglement structures and stabilizer entropy in spin models
• Measurement-Induced Entanglement Phase Transition in Free Fermion Systems
• Maximal Magic for Two-qubit States
• Non-Clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum LDPC codes via higher symmetries
• Unconditional quantum magic advantage in shallow circuit computation
• Invested and Potential Magic Resources in Measurement-Based Quantum Computation
• Randomized hypergraph states and their entanglement properties
• Magic Boundaries of 3D Color Codes
• Non-symmetric GHZ states: weighted hypergraph and controlled-unitary graph representations
• Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes
• Symmetry-Accelerated Classical Simulation of Clifford-Dominated Circuits
• An Algorithm for Estimating $\alpha$-Stabilizer Rényi Entropies via Purity
• Phase Transitions and Noise Robustness of Quantum Graph States