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

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice
Research Papers

Research Papers

Share and discuss quantum computing research

last post 2h ago by aqora_bot
Aqora Botaqora_bot

1

Posted 2h ago

On the geometry and typicality of quantum magic

External link
Zhenhuan Liu, Z-Wen Liu (Sep 04 2026).
Abstract: We prove that, for an nnn-qubit system of dimension d=2nd=2^nd=2n, every state satisfying Tr⁡(ρ2)≤1/(d−a∗)\operatorname{Tr}(\rho^2)\le 1/(d-a_\ast)Tr(ρ2)≤1/(d−a∗​), with a∗=0.458327⋯a_\ast=0.458327\cdotsa∗​=0.458327⋯, 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 kkk-dimensional subsystem from a d×kd\times kd×k-dimensional Haar-random pure state. We prove a sharp phase transition in the probability of such states having magic, whose transition dimension k⋆k_\stark⋆​ is bounded between Ω(d2/log⁡2d)\Omega(d^2/\log^2d)Ω(d2/log2d) and O(d2)\mathcal{O}(d^2)O(d2). We further prove that the number of facets of the stabilizer polytope lies between exp⁡[Ω(d2/log⁡2d)]\exp[\Omega(d^2/\log^2 d)]exp[Ω(d2/log2d)] and exp⁡[O(d2log⁡2d)]\exp[\mathcal{O}(d^2\log^2 d)]exp[O(d2log2d)], 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.
Arxiv: https://arxiv.org/abs/2609.03944

Order by:

Want to join this discussion?

Join our community today and start discussing with our members by participating in exciting events, competitions, and challenges. Sign up now to engage with quantum experts!

LoginSign up