arXiv:2610.08727
Entanglement manipulation and magic area-laws
Rafael A. Macedo, Rafael Chaves
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.
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