Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the geometry and typicality of quantum magic

Published 3 Sep 2026 in quant-ph | (2609.03944v1)

Abstract: We prove that, for an nn-qubit system of dimension d=2<sup>nd=2<sup>n, every state satisfying Tr(ρ<sup>2)</sup>1/(da)\operatorname{Tr}(ρ<sup>2)\le</sup> 1/(d-a_\ast), with a=0.458327a_\ast=0.458327\cdots, lies inside the stabilizer polytope and is therefore magic-free. Combining this result with general geometric properties of high-dimensional polytopes, we establish quantitative estimates for the Hilbert--Schmidt inradius and volume radius of the stabilizer polytope, and use them to characterize the typicality of magic in random induced states obtained by tracing out a kk-dimensional subsystem from a d×kd\times k-dimensional Haar-random pure state. We prove a sharp phase transition in the probability of such states having magic, whose transition dimension kk_\star is bounded between Ω(d<sup>2/log<sup>2d)Ω(d<sup>2/\log<sup>2d) and O(d<sup>2)\mathcal{O}(d<sup>2). We further prove that the number of facets of the stabilizer polytope lies between exp[Ω(d<sup>2/log<sup>2</sup></sup>d)]\exp[Ω(d<sup>2/\log<sup>2</sup></sup> d)] and exp[O(d<sup>2log<sup>2</sup></sup>d)]\exp[\mathcal{O}(d<sup>2\log<sup>2</sup></sup> d)], substantially improving upon the previous quasipolynomial lower bound and implying that any exact description of the magic-free region requires a doubly exponential number of linear inequalities in the number of qubits. Overall, our results show that the stabilizer polytope exhibits near-maximal geometric complexity allowed for a high-dimensional polytope with a certain number of vertices.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.