Problem 5: Test problem: Hilbert–Schmidt inradius of the multiqubit stabilizer polytope (edit)
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 ?
Background
Stabilizer states, Clifford gates and Pauli measurements can be simulated efficiently, i.e. in polynomial time, on a probabilistic classical computer. This is the content of the Gottesman-Knill theorem. States outside the stabilizer polytope (also known as magic states) are the resource that lifts this to universal quantum computation. A basic question is how noisy a state can be while still being magic. Since purity is the simplest basis-independent measure of noise, the problem above asks for the largest Hilbert–Schmidt ball centred at the maximally mixed state that fits inside the polytope , i.e. the inradius of the polytope.
For one qubit the answer is elementary and has been discussed in Ref. [2]: the stabilizer octahedron contains the Bloch ball of radius , which is related to the purity .
The problem asks whether the same formula holds for every value of qubit systems.
What is known:
- The statement was posed as Conjecture 1 by Liu et al. [1], who verified it for and numerically up to . They prove the weaker threshold , and they show that cannot be improved: there are magic states with purity arbitrarily close to it.
- Zurel and Davis [2] obtain the same inradius conditionally on an equivalent conjecture, and resolve the analogous question unconditionally for odd prime local dimension, where the threshold is for total dimension . There they also discuss other problems of interest, and constructions related to distinct polytopes, such as the -polytope.
- By polarity, the statement is equivalent to a bound on the dual polytope
namely
The bound is attained by a one-qubit phase-point operator tensored with a stabilizer state.
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: 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.
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 ;
- 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 .
A counterexample would be equally informative: it would exhibit a new kind of vertex of and a magic state noisier than any currently known.
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.
Feasibility
For each fixed the question is finite-dimensional convex geometry: maximise a convex quadratic over a polytope with known facets. It has been checked exactly for and numerically for [1,2]. The difficulty is uniformity in : the number of vertices of grows too fast to enumerate, and no classification exists.
Known obstructions to simple proofs (the last three items come from an AI-assisted exploration and have not been independently checked):
- The naive 2-design argument gives only .
- Induction on by measuring one Pauli and applying the case gives , which approaches but never reaches . Any argument that uses only the squares of the Pauli coefficients, and not their signs, is subject to the same limit.
- For there is no certificate of degree 2 in the stabilizer probabilities, even allowing sum-of-squares terms.
- For a degree-4 certificate does exist: is a non-negative combination of products of four stabilizer probabilities.
Plausible routes are therefore (i) a family of positivity certificates whose degree grows with , generalising the one; (ii) a quantitative Mermin-square inequality that supplies the missing sign information in the induction step; or (iii) a structural result on the vertices of . The tools are elementary, but the problem has resisted two independent groups, so it should be regarded as hard rather than routine.
Testing if edits work by adding a small line at the end
Permanent link:open-context.jan-bulling.com/contribution/5v7
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)
Versions
- 20 Nov 2026
- 19 Nov 2026
- 19 Nov 2026
- 18 Nov 2026
Version 95v9
I think that the Relevance and Significance could be improved
by Rafael Wagner · fully AI-generated
- 18 Nov 2026
Version 85v8
I've suggested improvements on the background of the problem
by Rafael Wagner · fully AI-generated
- 18 Nov 2026
- 17 Nov 2026
- 17 Nov 2026
- 17 Nov 2026
- 17 Nov 2026
- 17 Nov 2026
Version 25v2
Erased an earlier comment from the question posed, and added context to the question.
by Rafael Wagner
- 17 Nov 2026
Version 15v1
First recorded version.