Skip to content
Preprint

When Symmetry Suppresses Magic

Sep 2026 · 0 citations · 56 references
Physics

Abstract

Nonstabilizerness is a critical resource for quantum advantage, but evaluating it, especially for mixed states, requires superexponentially many samples in system size, making the problem NP-hard. While symmetries are known to reduce this complexity, it is unclear whether they also restrict the amount of magic. In this work, we provide an explicit example of such a symmetry by proving that the Robustness of Magic (RoM) for N-qubit X-states is at most $\sqrt{3}$. Leveraging this symmetry constraint, we introduce a computationally efficient method to lower-bound the RoM of arbitrary many-body states, demonstrating its utility on the ground states of a spin-1/2 Hamiltonian with system sizes well beyond the reach of exact evaluation. Furthermore, for Hamiltonians whose equilibrium states are X-states, we analytically derive the critical temperature at which magic emerges. Our work shows why certain symmetries constrain magic while others do not, provides a scalable lower-bounding method, and identifies a nontrivial regime where many-body nonstabilizerness is analytically solvable.

View source

Similar papers

Preprint Aug 2026

Exact quantification of nonlocal magic

Magic, or nonstabilizerness, is the resource that lifts Clifford circuits to universal quantum computation and has become a standard diagnostic of many-body states. For a state shared between two parties, however, a basic question has remained open: how much of the magic resides in the correlations between the parties...

Piotr Sierant · 7 citations · ⚡1
Preprint Sep 2026

Nonstabilizerness of quantum tensor network states is intractable in two dimensions

Nonstabilizerness is a necessary resource for quantum systems to lie beyond the classically simulable regime. With the advent of stabilizer $\alpha$-R\'enyi entropies, nonstabilizerness has also become a many-body diagnostic, complementary to entanglement. While deciding whether an arbitrary quantum state has nonstabil...

Gianluca Esposito, Georgios Styliaris · 1 citation
Sep 2026

Degree Balance as a Fine-Grained Complexity Boundary for Quantum SAT

The upper and lower bounds establish a fine-grained complexity dichotomy for quantum satisfiability, by showing that, assuming (Q)SETH, quantum 5-SAT admits no non-trivial worst-case speedup and demonstrating that the dependence of the authors' algorithms on regularity is in some sense nearly optimal.

Atsuya Hasegawa, Jonas Kamminga, François Le Gall et al. · 0 citations
Preprint Sep 2026

The Role of Completeness in Probing Symmetry Breaking

Completeness is widely recognized in quantum information as an important property of a family of monotones, because it ensures that no information relevant to state conversion is lost. We show that completeness is also physically important in many-body systems: an incomplete measure of symmetry breaking can miss essent...

Yuya Kusuki, Hiroyasu Tajima, Shion Yamashika · 0 citations
Preprint Oct 2026

Collective Quantum State Preparation Is Nonadditive

Quantum state preparation is a basic primitive of quantum computation and control, but its resource cost is usually analyzed for one target state or under an independent-copy construction. Here we study the many-copy problem under weighted Pauli control, where a Pauli-product rotation $e^{i\phi P}$ is charged by its ro...

Lin Zhu, Ranyiliu Chen, Xin Wang et al. · 0 citations

UvA-DARE (

K. Groenland, K. Schoutens · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.