On the geometry, typicality, and detectability of quantum magic
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.
Kai: We're looking at the paper: "On the geometry, typicality, and detectability of quantum magic".
Mira: Here's the gist of the paper. On the geometry and typicality of quantum magic, this paper proves that every state satisfying a certain purity threshold lies inside the stabilizer polytope and establishes quantitative bounds on its geometric properties to characterize the typicality of magic in random induced states Geometric Characterization of Stabilizer States The paper characterizes the stabilizer polytope by establishing universal lower bounds on its Hilbert–Schmidt inradius and volume radius, which are derived from a purity threshold theorem.
Kai: Specifically, Theorem 1 shows that every n-qubit density operator satisfying Tr(ρ 2) ≤ 1/(d −a∗), with a∗ = 0.458327⋯, belongs to the stabilizer polytope STABn.
Mira: The Hilbert–Schmidt inradius rin(Kn) is bounded by √ a∗ d(d −a∗) ≤ rin(Kn) ≤ √ 0.5 d(d −0.5).
Kai: Furthermore, the volume radius vrad(Kn) satisfies the bounds omega(1/d) ≤ vrad(Kn) ≤ O(logd/d), which is determined up to only a factor O(n) = O(logd).
Title and authors: Kai: So, we're talking about this paper called "On the geometry, typicality, and detectability of quantum magic." It looks like they're looking at how states that are 'magic-free' actually fit into a geometric shape called the stabilizer polytope.
Mira: Right. They’re essentially proving that if a state has a certain purity level—specifically Tr(rho squared) less than or equal to one over d minus this number, which is about zero point four five eight three two seven...—then it must be inside that stabilizer polytope. That means if you can measure high purity, you've automatically avoided magic states.
Lev: From an engineering standpoint, that's cool because it puts a clear boundary on what we can expect from these states. If we can verify high purity, we know the state is safe within this polytope structure.
Kai: Exactly. Now they use this geometric structure to figure out how likely it is that a randomly induced state—like one you get from tracing out some subsystem—will actually be magic and how hard it is to find it. They're trying to define a transition point for that probability of magic, which they call k star d.
Mira: The paper establishes this transition dimension k star d is bounded between something growing like the square of d divided by log two d and something scaling linearly with the square of d. That's a fairly tight window for where we expect magic to appear in random states.
Lev: That sharp boundary, going up to something like O(d squared), is much more helpful than what we might see from entanglement transitions, which are often at a lower order like d to the power three over two.
Kai: And they don't stop there. They look at how complex the boundary of this polytope is—the number of facets it has—and they find a doubly exponential bound for that number, something like exp of something related to d squared divided by log two d.
Mira: That complexity estimate tells us that the space of stabilizer states is geometrically very intricate, which is expected given how many vertices the polytope has, which is related to d raised to some power times n factorial.
Lev: If we had to actually simulate or work with these states on real hardware, knowing that the number of facets scales this way suggests a lot of computational overhead just for defining the space itself.
Kai: Then they tie it all together by looking at detection. They show that to certify whether a state is magic, you need a number of observables—let's call it M—that scales with k star d, which is related to d squared divided by log two d.
Mira: So, for detecting magic in these typical mixed states, the required number of single-copy observables grows exponentially with the environment size. That implies that as we try to check for magic in bigger systems, the experimental effort needed explodes.
Lev: That's a real practical concern because we are limited by how many measurements we can take before decoherence ruins everything.
Kai: So, to wrap up on this paper, "On the geometry, typicality, and detectability of quantum magic," it shows us that the stabilizer polytope has a very specific geometric shape dictated by purity thresholds.
Mira: It gives us quantitative bounds on its size—the inradius and volume radius—which are determined by that purity threshold we talked about earlier.
Lev: And they give us a sharp phase transition dimension, k star d, which helps us understand when magic is likely to show up in random states compared to other physical phenomena.
Kai: Ultimately, this work helps us characterize the typicality of magic in these induced states by linking the geometry of the state space to how hard it is to detect that magic.
Mira: It’s a deep dive into why magic is robust against environmental mixing when compared to entanglement transitions at lower dimensions.
Lev: For our hardware, this means we have a clear geometric target for what we are trying to avoid, and it sets the bar for how complex the verification process will be.
Kai: That's it for today on "On the geometry, typicality, and detectability of quantum magic." Next up, we're looking at how noise affects tensor network simulations.
The paper's summary: Kai: So, we're looking at this paper called "On the geometry, typicality, and detectability of quantum magic." It basically proves that if you have a state with a high enough purity—we’re talking Tr(rho squared) less than or equal to one over d minus zero point four five eight three two seven—then that state has to be inside this geometric shape called the stabilizer polytope.
Mira: Right, so it uses that purity threshold to define the boundary of magic states geometrically. It shows that if you can measure a high purity, you've automatically avoided those magic states and kept them confined within this specific polytope structure.
Lev: From my side, it means we have a mathematical region in the space of quantum states where magic isn't possible if your state is pure enough according to this threshold. It’s like setting a hard limit on how messy the state can be before you start seeing those weird magic effects.
Kai: Exactly. And then they take this geometry—the polytope—and use its size, specifically things like the inradius and volume radius, to figure out how likely it is for a randomly induced state to actually be magic. They find a sharp transition point, called k star d, which is bounded between something scaling like d squared divided by log two d and something scaling linearly with d squared.
Mira: That transition dimension tells us exactly where the phase change happens when you start picking states randomly. It’s much sharper than what we see for entanglement transitions in other papers, which are at a lower power of d. So magic is surprisingly robust against environmental mixing in terms of its transition scale.
Lev: For running this on real hardware, the fact that this transition dimension is bounded up to d squared is significant because that’s the scale we’re dealing with for many physical systems. It suggests that as the system gets bigger, you have a predictable window where magic shows up or doesn't show up.
Kai: And they also look at how complex the boundary of this polytope is—the number of facets it has. They get a doubly exponential bound there, something like exp of something related to d squared divided by log two d. That tells us the geometric shape itself is incredibly intricate when you scale up to more qubits.
Mira: That complexity estimate shows that the space defined by these stabilizer states is geometrically very dense, which makes sense given how many vertices the polytope has. It’s not a simple shape; it’s highly complex even at small scales.
Lev: That high facet count impacts simulation complexity and also detection difficulty, which is where I get interested for hardware implementation. If the boundary is that complex, verifying if a state is magic or not gets harder.
Kai: They link all this geometry to detectability too. They show that to certify if a random state has magic, you need an number of observables—let's call it M—that scales with k star d, which is around d squared divided by log two d. So the detection effort grows quite fast.
Mira: That means for detecting magic in typical mixed states, you’re looking at exponentially more single-copy observables as the environment size increases. It points to a very demanding experimental requirement for certification.
Lev: I see that implication directly on the lab bench because if you need exponentially many measurements just to confirm something is magic, it puts severe constraints on how long your coherence time can actually be for that verification process.
Kai: So, in short, this paper gives us a geometric map of quantum magic states defined by purity thresholds and shows us exactly where the typical transition point lies in random states. It also sets bounds on how hard it is to detect that magic experimentally.
Mira: The big picture is that the stabilizer polytope has near-extremal geometric complexity for its dimension, and this geometry dictates the typicality of magic in these induced states by tying it directly to detection difficulty.
Lev: This work provides concrete numbers for the scaling of those geometric properties, which helps us understand why magic behaves differently than entanglement in mixed environments.
Kai: Now that we have this geometric foundation, we need to figure out how these results translate into actual physical systems and what the next steps are for testing these bounds.
The paper's improvements: Tom: So, we're looking at how this paper actually tries to improve on what came before. It’s not just describing the polytope; it’s actually setting tighter bounds on its geometric properties using that purity threshold we talked about earlier.
Kai: Right, so they establish universal lower bounds for the Hilbert Schmidt inradius and volume radius of the stabilizer polytope itself, deriving those from the same purity theorem. This gives us a much more precise picture of the size of these magic state regions than before.
Mira: That’s significant because it moves us away from just saying "it's bounded" to giving specific mathematical limits, like showing that the inradius is less than or equal to some expression involving d and that zero point four five eight three two seven. It quantifies the geometric constraints directly.
Lev: For error correction, those universal bounds are useful because they tell us exactly how large a region of states we need to check before we’re guaranteed to be outside of the magic polytope. It sets a clear boundary for where the expected behavior lies on hardware.
Kai: And then they improve on the complexity of the polytope boundary itself—the number of facets it has. They provide a substantially improved lower bound, showing that this number grows doubly exponentially, between exp of something related to d squared divided by log two d and exp of something with d squared times log two d.
Mira: That improvement is crucial because previous bounds were much weaker, quasipolynomial in nature. This new result means the geometric structure is far more complex than we thought at larger scales.
Lev: A doubly exponential growth in facets tells us that simulating or even characterizing the state space for these states becomes exponentially harder as you go up in qubit number, which is a major headache for any practical simulation approach.
Kai: And tying it all together, they refine those detectability bounds. They show that any single copy linear detection protocol needs M observables, and they give us a sharper bound on M related to k star d. This means the required number of measurements scales more tightly with the dimension of the system than we previously thought.
Mira: So what this all means is that we have a much better geometric understanding of where magic lives—it’s confined to a well-defined, though complex, region—and we know exactly how hard it is to detect it geometrically or experimentally.
Lev: It helps us design better error correction codes because now we know the constraints on the state space that are "safe" from magic effects. We can target our noise models more accurately based on these polytope dimensions.
Kai: This paper really solidifies the connection between a physical property like purity and a geometric property like belonging to a stabilizer polytope, giving us strong tools for characterizing random induced states.
Mira: It gives us quantitative tools to pin down the typicality of magic in those random states, which is something we really needed for our theoretical framework.
Lev: The next step I see is taking these exact bounds and seeing if they map onto the actual noise models we use on superconducting qubits, because that’s where the real engineering challenge is.
Conclusion: Kai: So, to wrap up on "On the geometry, typicality, and detectability of quantum magic," this paper shows that we have a much better mathematical map for understanding magic states by linking purity thresholds directly to the geometry of the stabilizer polytope.
Mira: It really gives us quantitative bounds on how small or large these regions are, which tells us exactly what kind of geometric constraints we’re dealing with when those states are pure enough to be considered magic-free.
Lev: From an error correction standpoint, knowing these exact geometric limits helps us figure out the minimum number of observables we need to check for magic before we can actually certify a state is safe.
Kai: And they established that this detection effort scales predictably with the dimension of the system, which is a huge step toward designing more efficient experimental protocols.
Mira: The big picture here is that we’ve quantified how robust magic states are against environmental mixing by showing how sharply their transition point k star d scales compared to other types of quantum transitions.
Lev: It confirms that for these induced states, the scaling around d squared is the relevant regime for physical systems, which helps us decide if our error correction overhead will be manageable or not.
Kai: So, it’s a solid geometric foundation linking state purity to polytope geometry and then to detection difficulty in this paper.
Mira: It’s a deep dive into the structure of mixed quantum states and how that structure dictates what we can measure and how hard we have to work.
Lev: We need to take those exact scaling laws for the polytope size and see if they hold up when you try to run them on noisy, real hardware with limited resources.
Kai: That’s exactly where we go next, looking at how these geometric constraints play out in concrete simulations of noisy quantum circuits.
Quantum Research Center, Technology Innovation Institute (TII) · Yau Mathematical Sciences Center, Tsinghua University
quant-ph
Submitted: 2026-09-03
Updated: 2026-11-05
Comments: 11 pages, 1 figure, comments welcome!
License: http://creativecommons.org/licenses/by/4.0/
Importance score: 97/100
The gist: On the geometry and typicality of quantum magic, this paper proves that every state satisfying a certain purity threshold lies inside the stabilizer polytope and establishes quantitative bounds on…
Key concepts
- Stabilizer Polytope
- This is a geometric region in the space of quantum states that contains all stabilizer states. The paper shows that any state satisfying a certain purity condition must lie inside this polytope, allowing researchers to study magic through its geometric properties.
- Magic Typicality Transition
- This refers to the point where random induced quantum states transition into exhibiting 'magic' behavior. The paper uses the polytope's size and shape to define a sharp boundary for this transition dimension, showing how robust magic is against environmental noise compared to other quantum phenomena.
- Hilbert–Schmidt Inradius/Volume Radius
- These are quantitative geometric measures used to describe the size and shape of the stabilizer polytope. The paper finds lower bounds for these radii based on purity thresholds, giving a precise geometric understanding of how large or small these magic states can be.
- Facet Complexity
- Facets are the boundaries (faces) of a polytope. The paper provides a sharp lower bound on the number of facets ($F_d$), showing that the complexity scales doubly exponentially with the number of qubits, which is much more complex than previously known bounds.
Terminology
Summary
On the geometry and typicality of quantum magic, this paper proves that every state satisfying a certain purity threshold lies inside the stabilizer polytope and establishes quantitative bounds on its geometric properties to characterize the typicality of magic in random induced states
Geometric Characterization of Stabilizer States
The paper characterizes the stabilizer polytope by establishing universal lower bounds on its Hilbert–Schmidt inradius and volume radius, which are derived from a purity threshold theorem. Specifically, Theorem 1 shows that every n-qubit density operator satisfying Tr(ρ 2) ≤ 1/(d −a∗), with a∗ = 0. p. 1 181847
= 0. (4)
Then every n-qubit density operator ρ satisfying
Tr(ρ
2
) ≤
1
d −a∗
(5)
belongs to the stabilizer polytope STABn. 181847
= 0. (4)
Then every n-qubit density operator ρ satisfying
Tr(ρ
2
) ≤
1
d −a∗
(5)
belongs to the stabilizer polytope STABn. Throughout this work, it is convenient to center the stabilizer polytope around the maximally mixed state, Kn ∶=
STABn−I/d. Its Hilbert–Schmidt inradius rin(Kn) is the radius of the largest Euclidean ball contained in Kn, which, by
Pauli symmetry, can always be chosen to be centered at the
origin. The Carl–Pajor bound therefore
gives vrad(Kn) = O(n/d). Consequently, the volume radius
of the stabilizer polytope is determined up to only a factor
O(n) = O(logd).Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Magic Typicality Transition
The geometric properties of the stabilizer polytope are used to establish a sharp magic transition for random induced states. The transition dimension k⋆(d) is found to be bounded between omega(d 2/log2 d) and O(d 2), which is established by combining the inradius bound and the volume radius estimate. p. 0 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 k-dimensional subsystem from a d ×k-dimensional
Haar-random pure state. We prove a sharp phase transition in the probability of such states having magic, whose
transition dimension k⋆ is bounded between Ω(d
2
/log2
d) and O(d
2
). (12)
Theorem 3 shows that magic is remarkably robust against
environmental mixing. For a balanced bipartite system with
the same total Hilbert space dimension d, the entanglement–
separability transition occurs at an environment dimension of
order d
3/2
, up to logarithmic corrections [11, 12], whereas the
magic transition occurs between d
2
/log2
d and d
2
.Where the paper says it
Where the paper says it
Complexity of the Polytope Boundary
The paper provides a substantially improved lower bound on the number of facets of the stabilizer polytope, which is crucial for characterizing its complexity. Theorem 5 proves that the number Fd of facets satisfies exp[omega(d 2/log2 d)] ≤ Fd ≤ exp[O(d squared log2 d)], establishing a doubly exponential scaling in the number of qubits. p. 0 Our inradius
bound also resolves a previous conjecture on the difficulty of
single-copy magic detection [22]. Finally, combining our local and global geometric estimates with convex duality, we
obtain a substantially improved lower bound on the number
of facets of the stabilizer polytope, determining the logarithm
of its facet number up to polylogarithmic factors and establishing a doubly exponential scaling in the number of qubits. We prove a sharp phase transition in the probability of such states having magic, whose
transition dimension k⋆ is bounded between Ω(d
2
/log2
d) and O(d
2
). We further prove that the number of
facets of the stabilizer polytope lies between exp[Ω(d
2
/log2
d)] and exp[O(d
2
log2
d)] employing a result of
Bourgain and Milman in convex geometry, substantially improving upon the previous quasipolynomial lower
bound and implying that doubly-exponentially many linear inequalities in the number of qubits are required
for an exact description of the magic-free region.Where the paper says it
Where the paper says it
Detectability Bounds
The geometric results also have direct implications for the difficulty of detecting magic, leading to a bound on the required number of observables. Theorem 4 shows that any single-copy linear detection protocol requires M = omega(k) observables to certify the magic of ρ ∼ πd,k. p. 2 Let
ρ ∼ πd,k
. Any single-copy linear detection protocol based on
fixed observables that certifies the magic of ρ with constant
probability requires
M = Ω(k) (13)
observables. The proof is given in Appendix D. Consequently, detecting
magic in typical mixed states requires exponentially many
single-copy observables as the environment size.Where the paper says it
Where the paper says it
Discussion and Open Problems
The overall message is that the stabilizer polytope exhibits near-extremal geometric complexity allowed by its dimension and number of vertices. A natural open problem is to determine the exact inradius of the stabilizer polytope, as closing the constant gap between a∗ = 0. p. 3 This is parametrically more robust than entanglement, revealing a pronounced separation between the typical robustness of these
archetypal quantum resources. A natural open problem is to determine the exact inradius of
the stabilizer polytope. The Triangle Criterion gives a boundary construction at purity 1/(d−1/2), whereas our result guarantees stabilizerness up to 1/(d − a∗) with a∗ = 0. Closing this remaining constant gap would completely determine the purity threshold for the onset of magic. Such an
improvement will likely require exploiting the discrete stabilizer structure beyond the spectral information captured by the
present second- and third-moment analysis. Another important direction is to understand how the geometric transition identified here manifests itself in concrete
physical systems.Where the paper says it
Where the paper says it
Where the paper says it
Acknowledgments
The authors thank Hao Dai, Zhenyu Du, Shunlong Luo, and Fuchuan Wei for insightful discussions. Z.-W.L. is supported in part by NSFC under Grant No. p. 4 5
in part by NSFC under Grant No. 12475023, Dushi Program, and startup funding from YMSC. 5
in part by NSFC under Grant No. 12475023, Dushi Program, and startup funding from YMSC.Where the paper says it
Where the paper says it
References
[1] E. Chitambar and G. p. 4 12475023, Dushi Program, and startup funding from YMSC. Chitambar and G. Chitambar and G. Gour, Quantum resource theories, Rev.Where the paper says it
Where the paper says it
[2] R. Horodecki, P. p. 4 91, 025001 (2019). Horodecki, P. 91, 025001 (2019). Horodecki, P. 91, 025001 (2019). Horodecki, P.Where the paper says it
Where the paper says it
Where the paper says it
[3] V. Veitch, S. A. H. Mousavian, D. p. 4 Horodecki,
Quantum entanglement, Reviews of Modern Physics 81, 865
(2009). Mousavian, D. Mousavian, D. Gottesman, and J.Where the paper says it
Where the paper says it
[4] K. Zyczkowski, P. p. 4 Emerson,
The resource theory of stabilizer quantum computation, New
Journal of Physics 16, 013009 (2014). Zyczkowski, P. 91, 025001 (2019). Horodecki, P. Horodecki, A. Sanpera, and M.Where the paper says it
Where the paper says it
Where the paper says it
[5] L. Gurvits and H. p. 4 Lewenstein, ˙
Volume of the set of separable states, Physical Review A 58,
883 (1998). Gurvits and H. Gurvits and H. Barnum, Largest separable balls around the
maximally mixed bipartite quantum state, Phys.Where the paper says it
Where the paper says it
[6] S. J. Szarek, Volume of separable states is super-doublyexponentially small in the number of qubits, Phys. p. 4 A 66,
062311 (2002). Szarek, Volume of separable states is super-doublyexponentially small in the number of qubits, Phys.Where the paper says it
[7] G. Aubrun and S. p. 4 A 72,
032304 (2005). Aubrun and S.Where the paper says it
[8] O. Guhne and G. p. 4 Szarek, Tensor products of convex sets and
the volume of separable states on n qudits, Physical Review A
73, 022109 (2006). Guhne and G.Where the paper says it
[9] J. T. Barreiro, P. p. 4 T ¨ oth, Entanglement detection, ´ Physics Reports 474, 1 (2009). Barreiro, P. Barreiro, P. Schindler, O. Schindler, O. Chwalla, ¨
C.Where the paper says it
Where the paper says it
Where the paper says it
[10] K. Zyczkowski and H. p. 4 Emerson,
The resource theory of stabilizer quantum computation, New
Journal of Physics 16, 013009 (2014). Zyczkowski, P.Where the paper says it
[11] G. Aubrun, S. J. Szarek, and D. p. 4 A 66,
062311 (2002). Szarek, Volume of separable states is super-doublyexponentially small in the number of qubits, Phys. A 66,
062311 (2002). Szarek, Volume of separable states is super-doublyexponentially small in the number of qubits, Phys. Szarek, and D. Ye, Phase transitions for random states and a semicircle law for the partial transpose, Phys.Where the paper says it
Where the paper says it
Where the paper says it
[12] G. Aubrun, S. J. Szarek, and D. Ye, Entanglement thresholds for random induced states, Communications on Pure and Applied Mathematics 67, 129 (2014)
[13] A. Bakshi, A. Liu, A. Moitra, and E. p. 4 Ye, Entanglement thresholds for
random induced states, Communications on Pure and Applied
Mathematics 67, 129 (2014). Moitra, and E. Moitra, and E. Tang, High-temperature
gibbs states are unentangled and efficiently preparable, in 2024
IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) (2024) pp.Where the paper says it
Where the paper says it
[14] D. Gottesman, The heisenberg representation of quantum computers, arXiv quant-ph/9807006 (1998)
[15] S. Aaronson and D. p. 4 Gottesman, The heisenberg representation of quantum computers, arXiv quant-ph/9807006 (1998). Aaronson and D. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Phys.Where the paper says it
Where the paper says it
[16] S. Bravyi and A. p. 4 A 70, 052328 (2004). Bravyi and A. Bravyi and A. Kitaev, Universal quantum computation with
ideal clifford gates and noisy ancillas, Phys.Where the paper says it
Where the paper says it
[17] H. J. García, I. L. Markov, and A. p. 4 Garc´ıa, I. Markov, and A.Where the paper says it
[18] C. Okay, M. Zurel, and R Raussendorf On the extremal points of the Λ-polytopes and classical simulation of quantum computation with magic states Quantum Information and Computation 21, 1091 (2021)
[19] S. Ipek and C. p. 4 Raussendorf, On the extremal points
of the Λ-polytopes and classical simulation of quantum computation with magic states, Quantum Information and Computation 21, 1091 (2021). Ipek and C. Ipek and C. Okay, The degenerate vertices of the 2-
qubit λ-polytope and their update rules, arXiv preprint
arXiv:2312.Where the paper says it
Where the paper says it
[20] M. Zurel, C. Okay, R Raussendorf, and A Heimendahl Hidden variable model for quantum computation with magic states on qudits of any dimension Quantum 8, 1323 (2024)
[21] Z.-W. Liu and A Winter Many-body quantum magic PRX Quantum 3, 020333 (2022)
[22] Z Liu, T. Haug, Q Ye, Z.-W. Liu, and I Roth Triangle criterion: A mixed-state magic criterion with applications in distillation and detection PRX Quantum 7, 033016 (2026)
[23] M. Zurel and J Davis Basis-independent stabilizerness and maximally noisy magic states arXiv preprint arXiv:2602.22336 (2026)
[24] A Karanjai, J. J Wallman, and S. p. 4 Karanjai, J. Wallman, and S. Wallman, and S. Bartlett, Contextuality
bounds the efficiency of classical simulation of quantum processes, arXiv preprint arXiv:1802.Where the paper says it
Where the paper says it
[25] M. Zurel, C Okay, and R Raussendorf Simulating quantum computation How many “bits” for “it”? p. 4 Okay, and R. Raussendorf, Simulating quantum
computation: How many “bits” for “it”?Where the paper says it
[26] J Bourgain and V. D Milman New volume ratio properties for convex symmetric bodies in R n Inventiones Mathematicae 88, 319 (1987)
[27] B. W Reichardt, Quantum universality by state distillation Quantum Information and Computation 9, 1030 (2009)
[28] B Carl and A Pajor, Gelfand numbers of operators with values in a hilbert space Inventiones Mathematicae 94, 479 (1988)
[29] I Bar´ any and Z. F ´ uredi Approximation of the sphere by polytopes having few vertices Proceedings of the American Mathematical Society 102, 651 (1988)
[30] P. McMullen, The maximum numbers of faces of a convex polytope, Mathematika 17, 179 (1970)
[31] L. Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2602. p. 4 Eisert, and S. Oliviero, The unbearable hardness of deciding about magic, arXiv preprint arXiv:2602.Where the paper says it
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (2026)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (2026)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (2026)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (2016)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (2016)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (2016)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (2016)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (2016)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (2016)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (2016)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (2016)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (2016)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (2016)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (2016)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (2016)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (16)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (16)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (16)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (16)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (16)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (16)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (16)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (16)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (16)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (16)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (16)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (16)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (16)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (16)
[31] L Leone, J Eisert, and S F Oliviero The unbearable hardness of deciding about magic arXiv preprint arXiv:2608.25950 (16) <ref:2609. p. 0 Together, these results quantitatively connect the local, global,
and combinatorial geometry of the stabilizer polytope to the
robustness, typicality, and detectability of quantum magic. arXiv:2609.Where the paper says it
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Improved typicality threshold determination: The system can now precisely calculate k star d, which is bounded between Omega(d 2/log2 d) and O(d 2), providing a sharp phase transition scale for magic in random induced states.
-
Enhanced magic detection complexity analysis: The AI can predict the number of required single-copy observables M for constant probability detection, showing that M is Omega(k), allowing for more efficient experimental design in detecting magic.
-
Quantified polytope characterization: The system can establish quantitative estimates for the Hilbert–Schmidt inradius and volume radius of the stabilizer polytope, giving a near-extremal geometric understanding of these states.
-
Improved facet complexity bounds: The AI can provide a sharp lower bound on the number of facets Fd of the stabilizer polytope, showing that it lies between exp[Omega(d 2/log2 d)] and exp[O(d squared log2 d)], which is a substantial improvement over previous quasipolynomial bounds.
Abstract
Quantum magic, or nonstabilizerness, is a central resource for quantum computation, motivating a systematic study of its mathematical structure and physical behavior. Here we characterize the geometry of the stabilizer polytope, obtaining near-tight bounds on its inradius, volume radius, and number of facets. These results reveal a pronounced separation between the typical presence of magic and its detectability. In particular, random mixed states obtained by tracing out an environment remain magical with high probability even when the environment contains nearly twice as many qubits as the system, demonstrating parametrically greater robustness to environmental mixing than bipartite entanglement. In contrast, commonly used magic criteria, including the Triangle and Pauli-norm-based criteria, lose detection power under much weaker mixing. More generally, when the number of environment qubits scales proportionally with the system size, certification with constant success probability requires exponentially many linear observables, even given their exact expectation values. We also prove that the number of facets of the stabilizer polytope grows doubly exponentially with the number of qubits, making exhaustive witness enumeration impractical for complete magic certification and motivating approaches that exploit the structure and symmetries of stabilizer states.
Sources
- The degenerate vertices of the $2$-qubit $\Lambda$-polytope and their update rules
- Basis-independent stabilizerness and maximally noisy magic states
- Contextuality bounds the efficiency of classical simulation of quantum processes
- The unbearable hardness of deciding about magic
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements