Problem 5: Test problem: Hilbert–Schmidt inradius of the multiqubit stabilizer polytope
Is every -qubit state of purity at most a convex mixture of stabilizer states, i.e., not a magic state?
In other words, let and
Is the following implication valid for every ?
- Status
- under revision since 20 Nov 2026
- Updated
- 20 Nov 2026
- Posed by
- Rafael Wagner, 17 Nov 2026
- Contributors
- Rafael Wagner, Yujie Zhang, Jan, Yixuan Wang and 3 others · See all and what they did →
Background
Stabilizer states, Clifford gates and Pauli measurements can be simulated efficiently on a classical computer (Gottesman–Knill theorem); states outside the stabilizer polytope ("magic" states) are the resource that lifts this to universal quantum computation, for instance through magic state distillation [5]. A basic question is how noisy a state can be while still being magic. Since purity is the simplest basis-independent measure of noise, this asks for the largest Hilbert–Schmidt ball centred at the maximally mixed state that fits inside , i.e. the inradius of the polytope.
For one qubit the answer is elementary: the stabilizer octahedron contains the Bloch ball of radius , which is purity . The problem asks whether the same formula holds for every .
What is known:
- The statement was posed as Conjecture 1 in [1], where it is verified for and numerically up to . The authors prove the weaker threshold , and they show that cannot be improved: there are magic states with purity arbitrarily close to it.
- In [2] the same inradius is obtained conditionally on an equivalent conjecture, and the analogous question is resolved unconditionally for odd prime local dimension, where the threshold is for total dimension .
- The strongest proved result we are aware of is in [3]: purity at most with suffices for every , which leaves a small gap to the conjectured constant .
- By polarity, the statement is equivalent to a bound on the dual polytope of [4], namely for all . The bound is attained by a one-qubit phase-point operator tensored with a stabilizer state. The two-qubit case follows from the enumeration of the facets of the two-qubit stabilizer polytope in [5]. So only one direction is open: that every state below the threshold is a stabilizer mixture, for .
Relevance
The dual polytope is the state space of a hidden-variable description of quantum computation with magic states [4]: its elements assign non-negative probabilities to every stabilizer measurement. The problem therefore asks how large such a "classical-looking" object can be, measured by .
The link to contextuality is direct. Non-negativity on each stabilizer basis alone gives only the trivial bound , and that bound would be reached exactly by a deterministic, noncontextual value assignment to all Pauli observables. Such an assignment is forbidden by Mermin-square (Kochen–Specker) arguments. The conjectured value is thus a quantitative statement of how strongly state-independent contextuality of the multiqubit Pauli group constrains these assignments.
This is also why qubits are the hard case. For odd prime dimension the stabilizer subtheory admits a noncontextual (Wigner-function) model and the corresponding inradius is already known [2]; for qubits the stabilizer subtheory is itself contextual, and no such model is available.
For the applications agenda, a proof would give a certified, basis-independent purity threshold: below it, no magic and hence no contextuality-based advantage can be present, whatever the state. The best threshold of this kind proved so far is that of [3]; the conjecture of [1] asserts the optimal one.
Significance
A proof would:
- settle the exact Hilbert–Schmidt inradius of the multiqubit stabilizer polytope, and with it the minimal purity of a magic state, for all , closing the constant gap left open by [3];
- turn the conditional results of [2] on absolutely stabilizer states into theorems;
- show that the largest-norm vertices of are of the simplest known (closed-noncontextual) type, which is structural information about a polytope whose vertices are unclassified for (for they follow from the facet enumeration of [5]). A counterexample would be equally informative: it would exhibit a new kind of vertex of and a magic state noisier than any currently known. By [3], such a state could only exist in a narrow window of purities, between with and .
The scope is limited. The problem concerns one geometric constant of the stabilizer subtheory, and it bears on generalized noncontextuality only through the identification of magic with contextuality. It is best read as a sharp, well-posed test case rather than a step that would by itself advance the framework.
This problem can also be found at the QIQCOP Zoo database. See Ref. [6].
Permanent link:open-context.jan-bulling.com/contribution/5
References
- Zhenhuan Liu, Tobias Haug, Qi Ye, Zi-Wen Liu, and Ingo Roth, Triangle Criterion: a mixed-state magic criterion with applications in distillation and detection, arXiv:2512.16777 (2025)
- Michael Zurel and Jack Davis, Basis-independent stabilizerness and maximally noisy magic states, arXiv:2602.22336 (2026)
- Zhenhuan Liu and Zi-Wen Liu, On the geometry, typicality, and detectability of quantum magic, arXiv:2609.03944 (2026)
- Michael Zurel, Cihan Okay, and Robert Raussendorf, Hidden Variable Model for Universal Quantum Computation with Magic States on Qubits, Phys. Rev. Lett. 125, 260404 (2020)
- Ben W. Reichardt, Quantum universality by state distillation, arXiv:quant-ph/0608085 (2006)
- Hilbert–Schmidt inradius of the multiqubit stabilizer polytope, Quantum Information and Quantum Computation Open Problem Zoo (QIQCOP Zoo), (2026)
- John Watrous, The Theory of Quantum Information, Cambridge University Press (2018)
- Cihan Okay, Michael Zurel, Robert Raussendorf, On the extremal points of the $\Lambda$-polytopes and classical simulation of quantum computation with magic states, Quantum Information and Computation Vol.21 No.13&14, 1533-7146 (2021) doi:10.26421/QIC21.13-14-2
- Michael Zurel, Cihan Okay, Robert Raussendorf, and Arne Heimendahl, Hidden variable model for quantum computation with magic states on qudits of any dimension, Quantum 8, 1323 (2024)
- Michael Zurel, Cihan Okay, and Robert Raussendorf, Simulating Quantum Computation: How Many “Bits” for “It”?, PRX Quantum 5, 030343 (2024)
Progress and history
- 20 Nov 2026AdvanceIndependent verification: A solution to the problem which uses Aronszajn's inequality
OpenContext 5.14 by Rafael Wagner · partially AI-assisted
- 20 Nov 2026EditImprovements on the references
Version 12 by Rafael Wagner
- 20 Nov 2026Under revisionStatus changed to under revision.
- 20 Nov 2026AdvanceClaimed solution: A proposed analytic proof of the sharp bound cₙ = 1/2 for every number of qubits
OpenContext 5.13 by Yujie Zhang · partially AI-assisted
- 19 Nov 2026AdvancePartial result: An improved computer-assisted bound at 0.4996 for all , and a sharp 0.5 value for (part II)
OpenContext 5.12 by Rafael Wagner · partially AI-assisted
- 19 Nov 2026AdvancePartial result: An improved computer-assisted bound at 0.4996 for all , and a sharp 0.5 value for (part I)
OpenContext 5.11 by Rafael Wagner · partially AI-assisted
- 19 Nov 2026NoteOpenContext contribution 5.9 has been retracted
- 19 Nov 2026EditImprovements on the references
Version 11 by Rafael Wagner
Contributions
Jan · 20 Nov 2026
Wow, nice that this was solved! Amazing!
Rafael Wagner · 20 Nov 2026
I think that my Claude's solution is along similar lines
Contribute to this problem
You need to be signed in. Every contribution is reviewed by a moderator before it appears, and is credited to the people you name.
Discussion
Sign in to join the discussion.
Yixuan Wang · 18 Nov 2026
Test
🙌
Rafael Wagner · 18 Nov 2026
This is another test
yujie4phy · 18 Nov 2026
Ref 1 was published and could be updated
https://journals.aps.org/prxquantum/abstract/10.1103/rcpf-8nh9
Rafael Wagner · 18 Nov 2026
Nice! Well do so
Rafael Wagner · 18 Nov 2026
I have recently found an interesting advance to this problem; a comment section is too short for it, and I am revising the generated data from Claude
Rafael Wagner · 18 Nov 2026
It is taking time to do it, but the thing is that I found a bound which is distinct from 1/2 int he denominator.
Rafael Wagner · 17 Nov 2026
Nice
Jan · 17 Nov 2026
Another test comment
Rudi B. P. Pietsch · 17 Nov 2026
I would like to comment that the partial result is already known in the literature: "Basis-independent stabilizerness and maximally noisy magic states" https://arxiv.org/abs/2602.22336
Rafael Wagner · 17 Nov 2026
Test
Rafael Wagner · 18 Nov 2026
Nice, I really like how comments are shown here.
Rafael Wagner · 18 Nov 2026
Btw, we cite this work in the problem statement
Rafael Wagner · 17 Nov 2026
I would like to respond to a comment made by Rudi above.
Note that here we are treating a formal notion of magic, best put it as nonstabilizerness. This is related to the failure of having a state to be a stabilizer state.
Rudi B. P. Pietsch · 17 Nov 2026
Hey I am joining the discussion now. I don't believe in magic so everybody should stop working on this problem ASAP.
Rafael Wagner · 17 Nov 2026
Hi, are you sure you’re understanding magic well?
Rafael Wagner · 18 Nov 2026
Just to make a more concrete comment about it. It is important to note that magic is not the "subjective" term commonly used. Here, it has a rather precise meaning: magic is the property that a quantum state can have.
Different communities tend to use the term distinctively, but the most common use is that magic is just the property that states have whenever they are not elements of the stabilizer polytope .
To construct one such polytope, what one does is the following: take a reference stabilizer state, for example, the +1 eigenvalue of . Then, the vertices of the stabilizer polytope are found by applying all possible Clifford unitaries on . In this way, one ends up with all vertices. The polytope is then the convex-hull (in the space of quantum states) of these vertices.