Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2410.21215

Noise robustness and threshold of many-body quantum magic

Fuchuan Wei, Zi-Wen Liu

Published Oct 28, 2024• 8 citations
arXivHTMLPDF

Abstract

Understanding quantum magic (i.e., nonstabilizerness) in many-body quantum systems is challenging but essential to the study of quantum computation and many-body physics. We investigate how noise affects magic properties in entangled many-body quantum states by quantitatively examining the magic decay under noise, with a primary aim being to understand the stability of magic associated with different kinds of entanglement structures. As a standard model, we study hypergraph states, a representative class of many-body magic states, subject to depolarizing noise. First, we show that interactions facilitated by high-degree gates are fragile to noise. In particular, the $\mathrm{C}^{n-1}Z$ state family exhibits a vanishing magic threshold of $Θ(1/n)$. Furthermore, we demonstrate efficiently preparable families of hypergraph states without local magic but with a non-vanishing magic threshold which signifies robust magic that is entirely embedded in global entanglement. We also discuss the qudit case based on the discrete Wigner formalism.

DOI
10.48550/arxiv.2410.21215

Related papers

Many-Body Quantum Magic

Zi-Wen Liu, Andreas Winter

Magic (nonstabilizerness) is a necessary but "expensive" kind of "fuel" to drive universal fault-tolerant quantum computation.To properly study and characterize the origin of quantum "complexity" in computation as well as physics, it is crucial to develop a rigorous understanding of the quantification of magic.Previous studies of magic mostly focused on small systems and largely relied on the discrete Wigner formalism (which is only well behaved in odd prime power dimensions).Here we present an initiatory study of the magic of genuinely many-body quantum states that may be strongly entangled, with focus on the important case of many qubits, at a quantitative level.We first address the basic question of how "magical" a many-body state can be, and show that the maximum magic of an n-qubit state is essentially n, simultaneously for a range of "good" magic measures.As a corollary, the resource theory of magic has asymptotic golden currency states.We then show that, in fact, almost all n-qubit pure states have magic of nearly n.In the quest for explicit, scalable cases of highly entangled states whose magic can be understood, we connect the magic of hypergraph states with the second-order nonlinearity of their underlying Boolean functions.Next, we go on and investigate many-body magic in practical and physical contexts.We first consider a variant of measurement-based quantum computation where the client is restricted to Pauli measurements, in which magic is a necessary feature of the initial "resource" state.We show that n-qubit states with nearly n magic, or indeed almost all states, cannot supply nontrivial speedups over classical computers.We then present an example of analyzing the magic of "natural" condensed matter systems of physical interest.We apply the Boolean function techniques to derive explicit bounds on the magic of certain representative two-dimensional symmetry-protected topological states, and comment on possible further connections between magic and the quantum complexity of phases of matter.

arXiv:2010.13817•PRX Quantum•May 12, 2022•229 citations

Magic of quantum hypergraph states

Junjie Chen, Yuxuan Yan, You Zhou

Magic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states, playing a fundamental role in quantum state complexity and universal fault-tolerant quantum computing. However, analytical and numerical characterizations of magic are very challenging, especially for multi-qubit systems, 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 derive the magic formula in terms of the stabilizer Rényi- α entropies for general quantum hypergraph states. If the average degree of the corresponding hypergraph is constant, we show that magic cannot reach the maximal value, i.e., the number of qubits n . Then, we investigate the statistical behaviors of random hypergraph states' magic and prove a concentration result, indicating that random hypergraph states typically reach the maximum magic. This also suggests an efficient way to generate maximal magic states with random diagonal circuits. Finally, we study hypergraph states with permutation symmetry, such as 3 -complete hypergraph states, where any three vertices are connected by a hyperedge. Counterintuitively, such states can only possess constant or even exponentially small magic for α≥2 . Our study advances the understanding of multipartite quantum magic and could lead to applications in quantum computing and quantum many-body physics.

arXiv:2308.01886•Quantum•May 21, 2024•37 citations

Small quantum networks in the qudit stabilizer formalism

Miller, Daniel

How much noise can a given quantum state tolerate without losing its entanglement? For qudits of arbitrary dimension, I investigate this question for two noise models: Global white noise, where a depolarizing channel is applied to all qudits simultaneously, and local white noise, where a single qudit depolarizing channel is applied to every qudit individually. Using a unitary generalization of the Pauli group, I derive noise thresholds for stabilizer states, with an emphasis on graph states, and compare different entanglement criteria. The PPT and reduction criteria generally provide high noise thresholds, however, it is difficult to apply them in the case of local white noise. Entanglement criteria based on so-called sector lengths, on the other hand, provide coarse noise thresholds for both noise models. The only thing one has to know about a state to compute this threshold is the number of its full-weight stabilizers. In the special case of qubit graph states, I relate this question to a graph-theoretical puzzle and solve it for four important families of states. For Greenberger-Horne-Zeilinger states under local white noise, I obtain for the first time a noise threshold below which so-called semiseparability is ruled out.

arXiv:1910.09551•Oct 21, 2019•8 citations

Quantum Hypergraph States: A Review

Davide Poderini, Dagmar Bruß, Chiara Macchiavello

Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite entanglement. In this review, we provide a compact overview of the formal structure, entanglement characteristics, and operational relevance of hypergraph states in quantum information theory. We begin by introducing their mathematical foundations and generalizations of the stabilizer formalism. A central focus is placed on their entanglement properties, including the classification under local unitary (LU) and stochastic local operations with classical communication (SLOCC), the quantification of multipartite entanglement, and detection techniques via entanglement witnesses. We also explore other nonclassical features of hypergraph states, such as contextuality and genuine multipartite nonlocality, derived from stabilizer-based Bell-type inequalities. Additional attention is given to the role of hypergraph states in error correction, and as a computational resource in measurement-based quantum computation (MBQC), and to their non-stabilizer character - quantified via resource-theoretic measures of quantum magic. Finally we review their generalization to higher dimensions, i.e. to qudits and continuous variables.

quant-pharXiv:2603.10917•Reports on Progress in Physics•Mar 12, 2026•3 citations

Efficient witnessing and testing of magic in mixed quantum states

Tobias Haug, Poetri Sonya Tarabunga

Nonstabilizerness, or ‘magic’, is a crucial resource for quantum computation, but quantifying the magic of mixed states has been a notoriously difficult task. We introduce efficient magic witnesses based on stabilizer Rényi entropy that both robustly indicate magic and quantitatively estimate magic monotones. Building on these witnesses, we design testing algorithms that distinguish high- and low-magic states under entropy constraints and apply them to certify the number of noisy T-gates for a broad class of noise models. Using the IonQ quantum computer, we experimentally verify magic in noisy random circuits and find that magic remains robust, persisting even under depolarizing noise with probability exponentially close to one. Our witnesses are efficiently computable for matrix product states, showing that subsystems of many-body states can host extensive magic even when the system is entangled. Finally, we show that mimicking high-magic states with minimal magic requires an extensive amount of entropy, implying that entropy is a necessary cryptographic resource for hiding magic from eavesdroppers. Our results provide practical tools for characterizing the complexity of noisy quantum systems.

arXiv:2504.18098•npj Quantum Information•Feb 3, 2026•38 citations

Quantifying the magic of quantum channels

Xin Wang, Mark M. Wilde, Yuan Su

Abstract To achieve universal quantum computation via general fault-tolerant schemes, stabilizer operations must be supplemented with other non-stabilizer quantum resources. Motivated by this necessity, we develop a resource theory for magic quantum channels to characterize and quantify the quantum ‘magic’ or non-stabilizerness of noisy quantum circuits. For qudit quantum computing with odd dimension d , it is known that quantum states with non-negative Wigner function can be efficiently simulated classically. First, inspired by this observation, we introduce a resource theory based on completely positive-Wigner-preserving quantum operations as free operations, and we show that they can be efficiently simulated via a classical algorithm. Second, we introduce two efficiently computable magic measures for quantum channels, called the mana and thauma of a quantum channel. As applications, we show that these measures not only provide fundamental limits on the distillable magic of quantum channels, but they also lead to lower bounds for the task of synthesizing non-Clifford gates. Third, we propose a classical algorithm for simulating noisy quantum circuits, whose sample complexity can be quantified by the mana of a quantum channel. We further show that this algorithm can outperform another approach for simulating noisy quantum circuits, based on channel robustness. Finally, we explore the threshold of non-stabilizerness for basic quantum circuits under depolarizing noise.

arXiv:1903.04483•New Journal of Physics•Sep 18, 2019•154 citations
Understanding quantum magic (i.e., nonstabilizerness) in many-body quantum systems is challenging but essential to the study of quantum computation and many-body physics. We investigate how noise affects magic properties in entangled many-body quantum states by quantitatively examining the magic decay under noise, with a primary aim being to understand the stability of magic associated with different kinds of entanglement structures. As a standard model, we study hypergraph states, a representative class of many-body magic states, subject to depolarizing noise. First, we show that interactions facilitated by high-degree gates are fragile to noise. In particular, the Cn−1Z\mathrm{C}^{n-1}ZCn−1Z state family exhibits a vanishing magic threshold of Θ(1/n)Θ(1/n)Θ(1/n). Furthermore, we demonstrate efficiently preparable families of hypergraph states without local magic but with a non-vanishing magic threshold which signifies robust magic that is entirely embedded in global entanglement. We also discuss the qudit case based on the discrete Wigner formalism.
Magic (nonstabilizerness) is a necessary but "expensive" kind of "fuel" to drive universal fault-tolerant quantum computation.To properly study and characterize the origin of quantum "complexity" in computation as well as physics, it is crucial to develop a rigorous understanding of the quantification of magic.Previous studies of magic mostly focused on small systems and largely relied on the discrete Wigner formalism (which is only well behaved in odd prime power dimensions).Here we present an initiatory study of the magic of genuinely many-body quantum states that may be strongly entangled, with focus on the important case of many qubits, at a quantitative level.We first address the basic question of how "magical" a many-body state can be, and show that the maximum magic of an n-qubit state is essentially n, simultaneously for a range of "good" magic measures.As a corollary, the resource theory of magic has asymptotic golden currency states.We then show that, in fact, almost all n-qubit pure states have magic of nearly n.In the quest for explicit, scalable cases of highly entangled states whose magic can be understood, we connect the magic of hypergraph states with the second-order nonlinearity of their underlying Boolean functions.Next, we go on and investigate many-body magic in practical and physical contexts.We first consider a variant of measurement-based quantum computation where the client is restricted to Pauli measurements, in which magic is a necessary feature of the initial "resource" state.We show that n-qubit states with nearly n magic, or indeed almost all states, cannot supply nontrivial speedups over classical computers.We then present an example of analyzing the magic of "natural" condensed matter systems of physical interest.We apply the Boolean function techniques to derive explicit bounds on the magic of certain representative two-dimensional symmetry-protected topological states, and comment on possible further connections between magic and the quantum complexity of phases of matter.
Magic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states, playing a fundamental role in quantum state complexity and universal fault-tolerant quantum computing. However, analytical and numerical characterizations of magic are very challenging, especially for multi-qubit systems, 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 derive the magic formula in terms of the stabilizer Rényi- α entropies for general quantum hypergraph states. If the average degree of the corresponding hypergraph is constant, we show that magic cannot reach the maximal value, i.e., the number of qubits n . Then, we investigate the statistical behaviors of random hypergraph states' magic and prove a concentration result, indicating that random hypergraph states typically reach the maximum magic. This also suggests an efficient way to generate maximal magic states with random diagonal circuits. Finally, we study hypergraph states with permutation symmetry, such as 3 -complete hypergraph states, where any three vertices are connected by a hyperedge. Counterintuitively, such states can only possess constant or even exponentially small magic for α≥2 . Our study advances the understanding of multipartite quantum magic and could lead to applications in quantum computing and quantum many-body physics.
How much noise can a given quantum state tolerate without losing its entanglement? For qudits of arbitrary dimension, I investigate this question for two noise models: Global white noise, where a depolarizing channel is applied to all qudits simultaneously, and local white noise, where a single qudit depolarizing channel is applied to every qudit individually. Using a unitary generalization of the Pauli group, I derive noise thresholds for stabilizer states, with an emphasis on graph states, and compare different entanglement criteria. The PPT and reduction criteria generally provide high noise thresholds, however, it is difficult to apply them in the case of local white noise. Entanglement criteria based on so-called sector lengths, on the other hand, provide coarse noise thresholds for both noise models. The only thing one has to know about a state to compute this threshold is the number of its full-weight stabilizers. In the special case of qubit graph states, I relate this question to a graph-theoretical puzzle and solve it for four important families of states. For Greenberger-Horne-Zeilinger states under local white noise, I obtain for the first time a noise threshold below which so-called semiseparability is ruled out.
Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite entanglement. In this review, we provide a compact overview of the formal structure, entanglement characteristics, and operational relevance of hypergraph states in quantum information theory. We begin by introducing their mathematical foundations and generalizations of the stabilizer formalism. A central focus is placed on their entanglement properties, including the classification under local unitary (LU) and stochastic local operations with classical communication (SLOCC), the quantification of multipartite entanglement, and detection techniques via entanglement witnesses. We also explore other nonclassical features of hypergraph states, such as contextuality and genuine multipartite nonlocality, derived from stabilizer-based Bell-type inequalities. Additional attention is given to the role of hypergraph states in error correction, and as a computational resource in measurement-based quantum computation (MBQC), and to their non-stabilizer character - quantified via resource-theoretic measures of quantum magic. Finally we review their generalization to higher dimensions, i.e. to qudits and continuous variables.
Nonstabilizerness, or ‘magic’, is a crucial resource for quantum computation, but quantifying the magic of mixed states has been a notoriously difficult task. We introduce efficient magic witnesses based on stabilizer Rényi entropy that both robustly indicate magic and quantitatively estimate magic monotones. Building on these witnesses, we design testing algorithms that distinguish high- and low-magic states under entropy constraints and apply them to certify the number of noisy T-gates for a broad class of noise models. Using the IonQ quantum computer, we experimentally verify magic in noisy random circuits and find that magic remains robust, persisting even under depolarizing noise with probability exponentially close to one. Our witnesses are efficiently computable for matrix product states, showing that subsystems of many-body states can host extensive magic even when the system is entangled. Finally, we show that mimicking high-magic states with minimal magic requires an extensive amount of entropy, implying that entropy is a necessary cryptographic resource for hiding magic from eavesdroppers. Our results provide practical tools for characterizing the complexity of noisy quantum systems.
Abstract To achieve universal quantum computation via general fault-tolerant schemes, stabilizer operations must be supplemented with other non-stabilizer quantum resources. Motivated by this necessity, we develop a resource theory for magic quantum channels to characterize and quantify the quantum ‘magic’ or non-stabilizerness of noisy quantum circuits. For qudit quantum computing with odd dimension d , it is known that quantum states with non-negative Wigner function can be efficiently simulated classically. First, inspired by this observation, we introduce a resource theory based on completely positive-Wigner-preserving quantum operations as free operations, and we show that they can be efficiently simulated via a classical algorithm. Second, we introduce two efficiently computable magic measures for quantum channels, called the mana and thauma of a quantum channel. As applications, we show that these measures not only provide fundamental limits on the distillable magic of quantum channels, but they also lead to lower bounds for the task of synthesizing non-Clifford gates. Third, we propose a classical algorithm for simulating noisy quantum circuits, whose sample complexity can be quantified by the mana of a quantum channel. We further show that this algorithm can outperform another approach for simulating noisy quantum circuits, based on channel robustness. Finally, we explore the threshold of non-stabilizerness for basic quantum circuits under depolarizing noise.