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:2610.08727

Entanglement manipulation and magic area-laws

Rafael A. Macedo, Rafael Chaves

quant-phcond-mat.str-elSubmitted Oct 6, 2026• Announced Oct 7, 2026• 0 citations
arXivHTMLPDF

Abstract

Physical many-body quantum systems typically interact locally, giving rise to ground states where entanglement grows with the area of the region being probed. Beyond entanglement, non-stabilizerness (or "magic") has been established as another crucial resource linked to quantum complexity and the properties of error-correcting states. Unlike entanglement, non-stabilizerness typically behaves with a volume-law scaling in ground states, indicating inherent computational complexity. In this work, we show that under a recent classification of quantum states, area-law states split into two distinct classes. Entanglement-dominated states obey an area-law for non-stabilizerness and admit efficient quantum algorithms for entanglement manipulation. Conversely, magic-dominated states exhibit a a faster-than-area growth of subsystem non-stabilizerness and require non-efficient algorithms for entanglement manipulation tasks. Within this context, we introduce the concept of the stabilizer regime, a restricted quantum phase that admits efficient entanglement manipulation and hosts area laws for both magic and entanglement.

AI Summary

The paper asks how entanglement area laws constrain magic and the complexity of entanglement manipulation. It applies the entanglement-dominated/magic-dominated classification to area-law states: for a specified bipartition, ED means $S(\psi_A)=\omega(\nu)$ and MD means $S(\psi_A)=O(\nu)$, where $\nu$ is the global stabilizer nullity. For subsystem magic $\tilde M_2(\psi_A)=M_2(\psi_A)-S_2(\psi_A)$, it proves $\tilde M_2(\psi_A)\leq\nu(\psi)$ using a stabilizer-coset representation. Consequently, ED area-law states obey a magic area law, while $\tilde M_2(\psi_A)=\omega(|\partial A|)$ witnesses MD behavior. These implications do not establish an equivalence between MD behavior and super-area magic. Given the compressed state representation, subsystem magic is computable classically in $O(4^\nu n^3)$ time. A separate worst-case result rules out uniformly successful, state-agnostic, sample-efficient protocols for constant-relative-error entanglement estimation and constant-factor distillation or dilution over area-law MD states with $S(\psi_A)=\omega(\log n)$. The proof sparsely embeds existing indistinguishable Haar and subset-phase ensembles into lattices in $D\geq2$, preserving their hardness while enforcing area laws. A restricted “stabilizer regime,” connected by finite-depth circuits with $o(\log n)$ non-Clifford gates and entropy-scaling preservation, preserves ED behavior when $S(\psi_A)=\omega(\log n)$. The area-law assumption includes an exact Schmidt-rank bound, stronger than the usual von Neumann area law. The hard instances need not be local-Hamiltonian ground states; the result does not exclude state-specific efficient protocols, including MPS protocols in one dimension.

Little sign of AI-generated textOverclaimsIncrementalStrong assumptions

Central claim may not hold: The abstract claims that MD area-law states have super-area subsystem magic, but the theorem proves only the converse, and an unentangled state containing a single magic qubit is a counterexample. The abstract assigns inefficient entanglement manipulation to MD states generally, whereas the hardness theorem only rules out protocols that work uniformly over the entire specified class. The hardness proof requires D≥2 and entanglement entropy growing faster than log n, restrictions absent from the abstract's general claim. The paper's area-law assumption includes an exact Schmidt-rank area law, which is substantially stronger than the ordinary entanglement area law motivating the abstract.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
20 pages, 2 figures

Related papers

Magic and entanglement in 1+1-dimensional SU(2) lattice gauge theory

Raghav G. Jha, Goksu C. Toga, Jaber I. Taher +2 more

Entanglement and non-stabilizerness (magic) quantify two distinct departures of quantum systems from classical description: the former measures non-local correlations, while the latter measures the deviation from stabilizer states that can be efficiently simulated classically. Understanding magic in physically relevant quantum field theories is essential for identifying where quantum advantage may be realized in the early fault-tolerant quantum computing era. We calculate the gauge-invariant entanglement entropy and stabilizer Rényi entropy of the ground state of the (1+1)-dimensional SU(2) lattice gauge theory formulated in a dressed-site basis that enforces Gauss's law exactly. Using tensor networks, we obtain results for system sizes up to $L=100$ (300 qubits). We find a crossover denoted by $g_{\star}$ where the ground state passes from a more magic-rich regime into a regime with less magic; this is also tracked by the sharpest change of both the entanglement entropy and lattice particle density. Our large-scale study of non-stabilizerness and entanglement entropy in a non-Abelian lattice gauge theory with matter provides new insight into the interplay of magic and entanglement in gauge theories, both of which are relevant for classical and early fault-tolerant quantum simulations.

quant-pharXiv:2606.09971•Jun 10, 2026•10 citations

Entanglement entropy and magic of ZX-diagrams

Marcin Szyniszewski, Razin A. Shaikh, Aleks Kissinger

Entanglement and non-stabilizerness are complementary resources underlying the complexity of quantum states, yet extracting either quantity from large quantum circuits generally requires exponentially scaling resources. In diagrammatic approaches to quantum computation, such as the ZX-calculus, both quantities likewise typically require expensive tensor contractions that are not native to graphical rewriting. Here we show that both entanglement and magic can be efficiently estimated directly from ZX-diagrams. Flow enables efficient extraction of a normal form separating a potentially extensively entangled graph-state backbone from non-Clifford Pauli gadgets. This structure yields additive upper and lower bounds on bipartite entanglement entropy, which we further tighten through a preprocessing procedure that removes or merges redundant non-Clifford contributions. The same normal form gives an upper bound on logarithmic stabilizer extent. We benchmark these methods in random unitary and monitored circuits, and a circuit combining Trotterized Hamiltonian evolution with Clifford layers, finding that the resulting bounds remain informative even at large qubit numbers, circuit depths, and internal spider counts. Our results provide scalable probes of entanglement and non-stabilizerness of ZX-diagrams and establish a bridge between ZX-calculus and quantum many-body resource characterization, with applications across quantum computing, quantum information, and condensed-matter physics.

quant-pharXiv:2610.12447•Oct 9, 2026•0 citations

Real-Space Renormalization of Stabilizer Rényi Entropies in Spin Chains

Sonja Gombar, Petar Mali, Slobodan Radošević +3 more

Stabilizer states constitute an important class of quantum states that can be generated from computational-basis states using Pauli operators and Clifford gates. Although they may exhibit substantial multipartite entanglement, quantum circuits restricted to stabilizer operations can be efficiently simulated classically and therefore cannot, by themselves, provide a quantum computational advantage. Such an advantage requires non-stabilizer resources, commonly referred to as quantum magic. In this paper, we investigate the non-stabilizerness of quantum states arising in a class of spin Hamiltonians by computing their stabilizer Rényi entropies. Using real-space renormalization-group techniques, we obtain a closed-form expression valid in the low-energy, large-distance regime. We analyze how quantum magic evolves under coarse-graining and explore its behavior across different parameter regimes and quantum phases.

quant-pharXiv:2609.17188•Sep 16, 2026•0 citations

Non-Local Magic Resources for Fermionic Gaussian States

Daniele Iannotti, Beatrice Magni, Riccardo Cioli +2 more

Entanglement and magic are fundamental resources that capture the complexity of quantum many-body systems. Non-local magic isolates the irreducible nonstabilizerness intrinsically tied to entanglement. However, evaluating this quantity generally requires a prohibitive minimization over the full Hilbert space, making it computationally inaccessible beyond a few qubits. Here, we overcome this bottleneck by establishing a closed-form expression for the non-local stabilizer entropies of fermionic Gaussian states over local Gaussian unitaries, which we prove at Rényi index $α=2$ for arbitrary subsystem size, and which can be evaluated in polynomial time directly from the eigenvalues of the reduced Majorana covariance matrix. We apply this framework to characterize fermionic non-local magic across diverse physical regimes: we derive an exact Page-like curve for typical random states, reveal logarithmic scaling at the quantum critical point of the XY model, and establish a quasiparticle picture for magic generation during out-of-equilibrium quantum quenches. Crucially, because our result relies solely on two-point correlation functions, it provides a scalable route for the experimental estimation of fermionic non-local magic in large-scale quantum processors via fermionic shadow tomography.

quant-pharXiv:2604.27049•May 1, 2026•20 citations

Supercritical entanglement in local systems: Counterexample to the area law for quantum matter

Ramis Movassagh, Peter W. Shor

Quantum entanglement is the most surprising feature of quantum mechanics. Entanglement is simultaneously responsible for the difficulty of simulating quantum matter on a classical computer and the exponential speedups afforded by quantum computers. Ground states of quantum many-body systems typically satisfy an "area law": The amount of entanglement between a subsystem and the rest of the system is proportional to the area of the boundary. A system that obeys an area law has less entanglement and can be simulated more efficiently than a generic quantum state whose entanglement could be proportional to the total system's size. Moreover, an area law provides useful information about the low-energy physics of the system. It is widely believed that for physically reasonable quantum systems, the area law cannot be violated by more than a logarithmic factor in the system's size. We introduce a class of exactly solvable one-dimensional physical models which we can prove have exponentially more entanglement than suggested by the area law, and violate the area law by a square-root factor. This work suggests that simple quantum matter is richer and can provide much more quantum resources (i.e., entanglement) than expected. In addition to using recent advances in quantum information and condensed matter theory, we have drawn upon various branches of mathematics such as combinatorics of random walks, Brownian excursions, and fractional matching theory. We hope that the techniques developed herein may be useful for other problems in physics as well.

arXiv:1408.1657•Proceedings of the National Academy of Sciences•Nov 7, 2016•130 citations

Magic in Grover's Algorithm and the Role of Oracle Synthesis

Alessio Paviglianiti, Vincenzo Savona

Grover's algorithm is a textbook example of quantum advantage, providing a quadratic query speedup over classical methods for unstructured search. In this Letter, we characterize the non-stabilizerness, or magic, developed throughout Grover's protocol, quantifying quantum complexity with respect to the efficiently simulable stabilizer states. First, we compute the compilation-independent magic at the end of each Grover iteration, deriving an analytic prediction for the stabilizer Rényi entropy and proving that it remains intensive as the system size grows. We then investigate the magic overhead due to decomposing the circuit into elementary gates. When the solution to the search problem is known, we show that an efficient decomposition exists that keeps magic bounded despite using an extensive number of Toffoli gates. In contrast, agnostic implementations are expected to generate volume-law non-stabilizerness, as we confirm for the 3-SAT problem, which rules out efficient simulation by stabilizer-based methods in practically relevant cases. Our findings clarify the growth of magic in Grover's algorithm and the role of solution-awareness in its circuit compilation.

quant-pharXiv:2610.37772•Oct 29, 2026•0 citations
Physical many-body quantum systems typically interact locally, giving rise to ground states where entanglement grows with the area of the region being probed. Beyond entanglement, non-stabilizerness (or "magic") has been established as another crucial resource linked to quantum complexity and the properties of error-correcting states. Unlike entanglement, non-stabilizerness typically behaves with a volume-law scaling in ground states, indicating inherent computational complexity. In this work, we show that under a recent classification of quantum states, area-law states split into two distinct classes. Entanglement-dominated states obey an area-law for non-stabilizerness and admit efficient quantum algorithms for entanglement manipulation. Conversely, magic-dominated states exhibit a a faster-than-area growth of subsystem non-stabilizerness and require non-efficient algorithms for entanglement manipulation tasks. Within this context, we introduce the concept of the stabilizer regime, a restricted quantum phase that admits efficient entanglement manipulation and hosts area laws for both magic and entanglement.
The paper asks how entanglement area laws constrain magic and the complexity of entanglement manipulation. It applies the entanglement-dominated/magic-dominated classification to area-law states: for a specified bipartition, ED means S(ψA)=ω(ν)S(\psi_A)=\omega(\nu)S(ψA​)=ω(ν) and MD means S(ψA)=O(ν)S(\psi_A)=O(\nu)S(ψA​)=O(ν), where ν\nuν is the global stabilizer nullity.
For subsystem magic M~2(ψA)=M2(ψA)−S2(ψA)\tilde M_2(\psi_A)=M_2(\psi_A)-S_2(\psi_A)M~2​(ψA​)=M2​(ψA​)−S2​(ψA​), it proves M~2(ψA)≤ν(ψ)\tilde M_2(\psi_A)\leq\nu(\psi)M~2​(ψA​)≤ν(ψ) using a stabilizer-coset representation. Consequently, ED area-law states obey a magic area law, while M~2(ψA)=ω(∣∂A∣)\tilde M_2(\psi_A)=\omega(|\partial A|)M~2​(ψA​)=ω(∣∂A∣) witnesses MD behavior. These implications do not establish an equivalence between MD behavior and super-area magic. Given the compressed state representation, subsystem magic is computable classically in O(4νn3)O(4^\nu n^3)O(4νn3) time.
A separate worst-case result rules out uniformly successful, state-agnostic, sample-efficient protocols for constant-relative-error entanglement estimation and constant-factor distillation or dilution over area-law MD states with S(ψA)=ω(log⁡n)S(\psi_A)=\omega(\log n)S(ψA​)=ω(logn). The proof sparsely embeds existing indistinguishable Haar and subset-phase ensembles into lattices in D≥2D\geq2D≥2, preserving their hardness while enforcing area laws. A restricted “stabilizer regime,” connected by finite-depth circuits with o(log⁡n)o(\log n)o(logn) non-Clifford gates and entropy-scaling preservation, preserves ED behavior when S(ψA)=ω(log⁡n)S(\psi_A)=\omega(\log n)S(ψA​)=ω(logn).
The area-law assumption includes an exact Schmidt-rank bound, stronger than the usual von Neumann area law. The hard instances need not be local-Hamiltonian ground states; the result does not exclude state-specific efficient protocols, including MPS protocols in one dimension.
Entanglement and non-stabilizerness (magic) quantify two distinct departures of quantum systems from classical description: the former measures non-local correlations, while the latter measures the deviation from stabilizer states that can be efficiently simulated classically. Understanding magic in physically relevant quantum field theories is essential for identifying where quantum advantage may be realized in the early fault-tolerant quantum computing era. We calculate the gauge-invariant entanglement entropy and stabilizer Rényi entropy of the ground state of the (1+1)-dimensional SU(2) lattice gauge theory formulated in a dressed-site basis that enforces Gauss's law exactly. Using tensor networks, we obtain results for system sizes up to L=100L=100L=100 (300 qubits). We find a crossover denoted by g⋆g_{\star}g⋆​ where the ground state passes from a more magic-rich regime into a regime with less magic; this is also tracked by the sharpest change of both the entanglement entropy and lattice particle density. Our large-scale study of non-stabilizerness and entanglement entropy in a non-Abelian lattice gauge theory with matter provides new insight into the interplay of magic and entanglement in gauge theories, both of which are relevant for classical and early fault-tolerant quantum simulations.
Entanglement and non-stabilizerness are complementary resources underlying the complexity of quantum states, yet extracting either quantity from large quantum circuits generally requires exponentially scaling resources. In diagrammatic approaches to quantum computation, such as the ZX-calculus, both quantities likewise typically require expensive tensor contractions that are not native to graphical rewriting. Here we show that both entanglement and magic can be efficiently estimated directly from ZX-diagrams. Flow enables efficient extraction of a normal form separating a potentially extensively entangled graph-state backbone from non-Clifford Pauli gadgets. This structure yields additive upper and lower bounds on bipartite entanglement entropy, which we further tighten through a preprocessing procedure that removes or merges redundant non-Clifford contributions. The same normal form gives an upper bound on logarithmic stabilizer extent. We benchmark these methods in random unitary and monitored circuits, and a circuit combining Trotterized Hamiltonian evolution with Clifford layers, finding that the resulting bounds remain informative even at large qubit numbers, circuit depths, and internal spider counts. Our results provide scalable probes of entanglement and non-stabilizerness of ZX-diagrams and establish a bridge between ZX-calculus and quantum many-body resource characterization, with applications across quantum computing, quantum information, and condensed-matter physics.
Stabilizer states constitute an important class of quantum states that can be generated from computational-basis states using Pauli operators and Clifford gates. Although they may exhibit substantial multipartite entanglement, quantum circuits restricted to stabilizer operations can be efficiently simulated classically and therefore cannot, by themselves, provide a quantum computational advantage. Such an advantage requires non-stabilizer resources, commonly referred to as quantum magic. In this paper, we investigate the non-stabilizerness of quantum states arising in a class of spin Hamiltonians by computing their stabilizer Rényi entropies. Using real-space renormalization-group techniques, we obtain a closed-form expression valid in the low-energy, large-distance regime. We analyze how quantum magic evolves under coarse-graining and explore its behavior across different parameter regimes and quantum phases.
Entanglement and magic are fundamental resources that capture the complexity of quantum many-body systems. Non-local magic isolates the irreducible nonstabilizerness intrinsically tied to entanglement. However, evaluating this quantity generally requires a prohibitive minimization over the full Hilbert space, making it computationally inaccessible beyond a few qubits. Here, we overcome this bottleneck by establishing a closed-form expression for the non-local stabilizer entropies of fermionic Gaussian states over local Gaussian unitaries, which we prove at Rényi index α=2α=2α=2 for arbitrary subsystem size, and which can be evaluated in polynomial time directly from the eigenvalues of the reduced Majorana covariance matrix. We apply this framework to characterize fermionic non-local magic across diverse physical regimes: we derive an exact Page-like curve for typical random states, reveal logarithmic scaling at the quantum critical point of the XY model, and establish a quasiparticle picture for magic generation during out-of-equilibrium quantum quenches. Crucially, because our result relies solely on two-point correlation functions, it provides a scalable route for the experimental estimation of fermionic non-local magic in large-scale quantum processors via fermionic shadow tomography.
Quantum entanglement is the most surprising feature of quantum mechanics. Entanglement is simultaneously responsible for the difficulty of simulating quantum matter on a classical computer and the exponential speedups afforded by quantum computers. Ground states of quantum many-body systems typically satisfy an "area law": The amount of entanglement between a subsystem and the rest of the system is proportional to the area of the boundary. A system that obeys an area law has less entanglement and can be simulated more efficiently than a generic quantum state whose entanglement could be proportional to the total system's size. Moreover, an area law provides useful information about the low-energy physics of the system. It is widely believed that for physically reasonable quantum systems, the area law cannot be violated by more than a logarithmic factor in the system's size. We introduce a class of exactly solvable one-dimensional physical models which we can prove have exponentially more entanglement than suggested by the area law, and violate the area law by a square-root factor. This work suggests that simple quantum matter is richer and can provide much more quantum resources (i.e., entanglement) than expected. In addition to using recent advances in quantum information and condensed matter theory, we have drawn upon various branches of mathematics such as combinatorics of random walks, Brownian excursions, and fractional matching theory. We hope that the techniques developed herein may be useful for other problems in physics as well.
Grover's algorithm is a textbook example of quantum advantage, providing a quadratic query speedup over classical methods for unstructured search. In this Letter, we characterize the non-stabilizerness, or magic, developed throughout Grover's protocol, quantifying quantum complexity with respect to the efficiently simulable stabilizer states. First, we compute the compilation-independent magic at the end of each Grover iteration, deriving an analytic prediction for the stabilizer Rényi entropy and proving that it remains intensive as the system size grows. We then investigate the magic overhead due to decomposing the circuit into elementary gates. When the solution to the search problem is known, we show that an efficient decomposition exists that keeps magic bounded despite using an extensive number of Toffoli gates. In contrast, agnostic implementations are expected to generate volume-law non-stabilizerness, as we confirm for the 3-SAT problem, which rules out efficient simulation by stabilizer-based methods in practically relevant cases. Our findings clarify the growth of magic in Grover's algorithm and the role of solution-awareness in its circuit compilation.