Skip to content
OpenContext

← All problems

Problem 5: Test problem: Hilbert–Schmidt inradius of the multiqubit stabilizer polytope

Is every nn-qubit state ρ\rho of purity Tr[ρ2]\mathrm{Tr}[\rho^2] at most 1/(2n−1/2)1/(2^n-1/2) a convex mixture of stabilizer states, i.e., not a magic state?

In other words, let d=2nd=2^n and

STABn=conv{∣s⟩⟨s∣ : ∣s⟩ is an n-qubit stabililzer state}.\mathrm{STAB}_n = \mathrm{conv}\{ \vert s \rangle \langle s \vert \ : \ \vert s \rangle \text{ is an }n\text{-qubit stabililzer state}\}.

Is the following implication valid for every n≥1n\geq 1?

Tr(ρ2)≤1d−1/2  ⟹  ρ∈STABn.\mathrm{Tr}(\rho^2) \leq \frac{1}{d-1/2} \implies \rho \in \mathrm{STAB}_n.
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 STABn\mathrm{STAB}_n ("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 I/d\mathbb{I}/d that fits inside STABn\mathrm{STAB}_n, i.e. the inradius of the polytope.

For one qubit the answer is elementary: the stabilizer octahedron contains the Bloch ball of radius 1/31/\sqrt{3}, which is purity 2/3=1/(d−1/2)2/3 = 1/(d-1/2). The problem asks whether the same formula holds for every nn.

What is known:

  • The statement was posed as Conjecture 1 in [1], where it is verified for n=1,2n=1,2 and numerically up to n=4n=4. The authors prove the weaker threshold 1/(d−1/d)1/(d-1/d), and they show that 1/(d−1/2)1/(d-1/2) 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 1/(D−1/D)1/(D-1/D) for total dimension DD.
  • The strongest proved result we are aware of is in [3]: purity at most 1/(d−a∗)1/(d-a_*) with a∗=0.458327…a_* = 0.458327\ldots suffices for every nn, which leaves a small gap to the conjectured constant 1/21/2.
  • By polarity, the statement is equivalent to a bound on the dual polytope Λn={A:Tr[A]=1, ⟨s∣A∣s⟩≥0 for all stabilizer states s}\Lambda_n = \{A : \mathrm{Tr}[A]=1,\ \langle s|A|s\rangle \ge 0 \text{ for all stabilizer states } s\} of [4], namely Tr[A2]≤2\mathrm{Tr}[A^2]\le 2 for all A∈ΛnA\in\Lambda_n. 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 n≥3n\ge 3.

Relevance

The dual polytope Λn\Lambda_n 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 Tr[A2]\mathrm{Tr}[A^2].

The link to contextuality is direct. Non-negativity on each stabilizer basis alone gives only the trivial bound Tr[A2]≤d\mathrm{Tr}[A^2]\le d, and that bound would be reached exactly by a deterministic, noncontextual ±1\pm1 value assignment to all Pauli observables. Such an assignment is forbidden by Mermin-square (Kochen–Specker) arguments. The conjectured value 22 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 nn, 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 Λn\Lambda_n are of the simplest known (closed-noncontextual) type, which is structural information about a polytope whose vertices are unclassified for n≥3n\ge 3 (for n=2n=2 they follow from the facet enumeration of [5]). A counterexample would be equally informative: it would exhibit a new kind of vertex of Λn\Lambda_n and a magic state noisier than any currently known. By [3], such a state could only exist in a narrow window of purities, between 1/(d−a∗)1/(d-a_*) with a∗=0.458327…a_*=0.458327\ldots and 1/(d−12)1/(d-\frac{1}{2}).

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.

NonstabilizernessMagicPurityConvex polytopesClifford groupStabilizer statesQubits
Note

This problem can also be found at the QIQCOP Zoo database. See Ref. [6].

Permanent link:open-context.jan-bulling.com/contribution/5

References

  1. 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)
  2. Michael Zurel and Jack Davis, Basis-independent stabilizerness and maximally noisy magic states, arXiv:2602.22336 (2026)
  3. Zhenhuan Liu and Zi-Wen Liu, On the geometry, typicality, and detectability of quantum magic, arXiv:2609.03944 (2026)
  4. 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)
  5. Ben W. Reichardt, Quantum universality by state distillation, arXiv:quant-ph/0608085 (2006)
  6. Hilbert–Schmidt inradius of the multiqubit stabilizer polytope, Quantum Information and Quantum Computation Open Problem Zoo (QIQCOP Zoo), (2026)
  7. John Watrous, The Theory of Quantum Information, Cambridge University Press (2018)
  8. 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
  9. 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)
  10. Michael Zurel, Cihan Okay, and Robert Raussendorf, Simulating Quantum Computation: How Many “Bits” for “It”?, PRX Quantum 5, 030343 (2024)

Progress and history

  1. 20 Nov 2026
    AdvanceIndependent verification: A solution to the problem which uses Aronszajn's inequality

    OpenContext 5.14 by Rafael Wagner · partially AI-assisted

  2. 20 Nov 2026
    EditImprovements on the references

    Version 12 by Rafael Wagner

  3. 20 Nov 2026
    Under revisionStatus changed to under revision.
  4. 20 Nov 2026
    AdvanceClaimed 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

  5. 19 Nov 2026
    AdvancePartial result: An improved computer-assisted bound at 0.4996 for all nn, and a sharp 0.5 value for n≤5n\leq 5 (part II)

    OpenContext 5.12 by Rafael Wagner · partially AI-assisted

  6. 19 Nov 2026
    AdvancePartial result: An improved computer-assisted bound at 0.4996 for all nn, and a sharp 0.5 value for n≤5n\leq 5 (part I)

    OpenContext 5.11 by Rafael Wagner · partially AI-assisted

  7. 19 Nov 2026
    NoteOpenContext contribution 5.9 has been retracted
  8. 19 Nov 2026
    EditImprovements on the references

    Version 11 by Rafael Wagner

Contributions

  1. VerificationOpenContext 5.1420 Nov 2026
    0
    1 comments

    A solution to the problem which uses Aronszajn's inequality

    by Rafael Wagner · partially AI-assisted

    Main result

    Below, I present an independent claim from the one by Yujie where it seems that Fable 5.2 found a solution to the problem. The interesting aspects is that it clearly has succeeded by building on the theory of Λ\Lambda-polytopes. Below, I mark all the points where I believe further exposition is needed with a triple star (⋆⋆⋆)(\star\star\star).

    This is the main output:

    Theorem (inradius of the stabilizer polytope). Let Λn\Lambda_n be the Λ\Lambda-polytope of nn qubits. Denote by d=2nd=2^n the Hilbert space dimension, and Mn:=max⁡A∈Λn Tr[A2].M_n:=\max_{A\in\Lambda_n}\,\mathrm{Tr}[A^2]. For every integer n≥1n\ge1,

    Mn=2.M_n=2 .

    Consequently, for every nn-qubit state ρ\rho,

    Tr[ρ2]≤1d−12   ⟹   ρ∈STABn,\mathrm{Tr}[\rho^2]\le\frac{1}{d-\frac12}\ \implies\ \rho\in\mathrm{STAB}_n ,

    and the constant 12\tfrac12 cannot be improved [1]. Moreover, A∈ΛnA\in\Lambda_n has Tr[A2]=2\mathrm{Tr}[A^2]=2 if and only if A=UA⋆U†A=UA^\star U^\dagger for a Clifford unitary UU, where A⋆=12(I+X+Y+Z)⊗∣0…0⟩⟨0…0∣A^\star=\tfrac12(\mathbb{I}+X+Y+Z)\otimes|0\ldots0\rangle\langle0\ldots0|.

    This is the first contribution of two parts. First part proves Mn=2M_n=2 and shows that every maximiser has largest eigenvalue λ+=1+32\lambda_+=\tfrac{1+\sqrt3}{2}. The second part proves that such an operator lies in the Clifford orbit of A⋆A^\star and reports numerical experiments on sub-polytopes of STABn\mathrm{STAB}_n.

    Read more

    1. Jan · 20 Nov 2026

      Wow, nice that this was solved! Amazing!

  2. Claimed solutionOpenContext 5.1320 Nov 2026
    +1
    1 comments

    A proposed analytic proof of the sharp bound cₙ = 1/2 for every number of qubits

    by Yujie Zhang · partially AI-assisted

    Main result

    Proposed theorem. Write d=2nd=2^n. Let cnc_n be the largest constant such that every nn-qubit density operator of purity at most 1/(d−cn)1/(d-c_n) is a convex mixture of stabilizer states. Then

    cn=12for every n≥1.\boxed{c_n=\tfrac12\qquad\text{for every }n\ge1.}

    The centered Hilbert–Schmidt inradius is 1/d(2d−1)1/\sqrt{d(2d-1)}. The proof also determines every equality witness. If a trace-one Hermitian AA is nonnegative on all pure stabilizer states and Tr⁡(A2)=2\operatorname{Tr}(A^2)=2, then AA is Clifford-equivalent to

    Vn=∣0n−1⟩⟨0n−1∣⊗I+X+Y+Z2.V_n=|0^{n-1}\rangle\langle0^{n-1}|\otimes\frac{I+X+Y+Z}{2}.

    Which steps use a computer? The argument below is analytic throughout. This is a fully AI-generated proposed proof for independent review. Its external spectral input is Rafael Wagner’s upper eigenvalue bound in OpenContext 5.11, §2.1. All other estimates below follow from the displayed Pauli identities and inequalities. The earlier computer-assisted estimates in 5.10 and the grid checks in 5.12 are unnecessary for this proof. OpenContext 5.10 · OpenContext 5.11 · OpenContext 5.12

    Read more

    1. Rafael Wagner · 20 Nov 2026

      I think that my Claude's solution is along similar lines

  3. Partial resultOpenContext 5.1219 Nov 2026
    0
    0 comments

    An improved computer-assisted bound at 0.4996 for all $n$, and a sharp 0.5 value for $n\leq 5$ (part II)

    by Rafael Wagner · partially AI-assisted

    Main result

    After a couple of prompts, Claude Fable 5.2 found another advance:

    Theorem (0.49960.4996 bound): Let ρ∈D(C2⊗⋯⊗C2⏟n times)\rho \in \mathcal{D}(\underbrace{\mathbb{C}^2 \otimes \cdots \otimes \mathbb{C}^2}_{n\text{ times}}) be an arbitrary nn-qubit state, and denote STABn\mathrm{STAB}_n the convex polytope of nn-qubit stabilizer states. For every integer n≥1n \geq 1, it holds that

    Tr[ρ2]≤1dn−a∗  ⟹  ρ∈STABn,\mathrm{Tr}[\rho^2] \leq \frac{1}{d_n-a^*} \implies \rho \in \mathrm{STAB}_n,

    where dn=2nd_n = 2^n is the dimension of the underlying Hilbert space and a∗=0.4996a^*=0.4996. Furthermore, for 1≤n≤51\leq n \leq 5 the conjecture is shown to hold, i.e., a∗=12a^*=\tfrac{1}{2}.

    The results have used the strategy present in the notes by Y. Wang. "Partial Results on the Hilbert–Schmidt Inradius of the Multiqubit Stabilizer Polytope", in collaboration with ChatGPT 6 Astra.

    How this contribution is organised. This is the second of two parts. The first part proves two results on the spectrum of the operators in the Λ\Lambda-polytope, which are recalled below without proof. Here they are combined with the Liu–Liu inequality of Ref. [3] to bound the purity of these operators, which proves the theorem above. The numbering of the sections continues that of the first part.

    Read more

  4. Partial resultOpenContext 5.1119 Nov 2026
    0
    0 comments

    An improved computer-assisted bound at 0.4996 for all $n$, and a sharp 0.5 value for $n\leq 5$ (part I)

    by Rafael Wagner · partially AI-assisted

    Main result

    After a couple of prompts, Claude Fable 5.2 found another advance:

    Theorem (0.49960.4996 bound): Let ρ∈D(C2⊗⋯⊗C2⏟n times)\rho \in \mathcal{D}(\underbrace{\mathbb{C}^2 \otimes \cdots \otimes \mathbb{C}^2}_{n\text{ times}}) be an arbitrary nn-qubit state, and denote STABn\mathrm{STAB}_n the convex polytope of nn-qubit stabilizer states. For every integer n≥1n \geq 1, it holds that

    Tr[ρ2]≤1dn−a∗  ⟹  ρ∈STABn,\mathrm{Tr}[\rho^2] \leq \frac{1}{d_n-a^*} \implies \rho \in \mathrm{STAB}_n,

    where dn=2nd_n = 2^n is the dimension of the underlying Hilbert space and a∗=0.4996a^*=0.4996. Furthermore, for 1≤n≤51\leq n \leq 5 the conjecture is shown to hold, i.e., a∗=12a^*=\tfrac{1}{2}.

    The results have used the strategy present in the notes by Y. Wang. "Partial Results on the Hilbert–Schmidt Inradius of the Multiqubit Stabilizer Polytope", in collaboration with ChatGPT 6 Astra.

    How this contribution is organised. Because of its length, the argument is divided into two parts. This first part contains the preliminaries and two new results on the spectrum of the operators in the Λ\Lambda-polytope: the theorem on the spectrum of a witness and the star inequality. Both are proved analytically. The second part combines them with the Liu–Liu inequality of Ref. [3] to prove the theorem above.

    Read more

All 17 contributions →

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

    Tr(A2)=?Tr(A^2)=?

    🙌

  • Rafael Wagner · 18 Nov 2026

    This is another test

  • yujie4phy · 18 Nov 2026

    1. 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

    1. Rafael Wagner · 18 Nov 2026

      It is taking time to do it, but the thing is that I found a bound cnc_n 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

    1. Rafael Wagner · 17 Nov 2026

      Test

    2. Rafael Wagner · 18 Nov 2026

      Nice, I really like how comments are shown here.

    3. 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.

    1. Rafael Wagner · 17 Nov 2026

      Hi, are you sure you’re understanding magic well?

    2. 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 STABn\mathrm{STAB}_n.

      To construct one such polytope, what one does is the following: take ∣0⟩\vert 0 \rangle a reference stabilizer state, for example, the +1 eigenvalue of Z⋯ZZ \cdots Z. Then, the vertices of the stabilizer polytope are found by applying all possible Clifford unitaries on ∣0⟩\vert 0 \rangle. 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.