Skip to content
OpenContext
Contributions toProblem 5: Test problem: Hilbert–Schmidt inradius of the multiqubit stabilizer polytopeunder revision

Contributions

Everything submitted on the problem and accepted by the moderators. Each result has its own page, with its permanent link, the full discussion and a citation; vote on the ones you find useful, or not.

  1. VerificationOpenContext 5.1420 Nov 2026
    0
    2 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. Rafael Wagner · 20 Nov 2026

      Below I'll work out the various parts in which I haven't fully checked in order to improve my understanding of it.

      The first bit is simple, and it is related to the first batch of claims. In particular, I wanted to understand better the following simple bit first:

      Define

      v:=λ+=1+32,c:=−λ−=v−1,r:=32.v:=\lambda_+=\frac{1+\sqrt3}{2},\qquad c:=-\lambda_-=v-1,\qquad r:=\frac{\sqrt3}{2}.

      It is simple to show that

      vc=12,v2=v+12,c2=12−c,v2+c2=2,r=v−12=1−c2.vc=\tfrac12,\qquad v^2=v+\tfrac12,\qquad c^2=\tfrac12-c,\qquad v^2+c^2=2,\qquad r=v-\tfrac12=1-c^2.

      Indeed, λ±\lambda_\pm are the two roots of λ2−λ−12=0\lambda^2-\lambda-\tfrac12=0. They are the eigenvalues of 12(I+X+Y+Z),\tfrac12(\mathbb{I}+X+Y+Z), and since we have that (X+Y+Z)2=3 I(X+Y+Z)^2=3\,\mathbb{I} we get these values for the eigenvalues. Here, these are simply the Pauli matrices.

      The sum and the product of the roots give v−c=1v-c=1 and vc=12vc=\tfrac12. The first relation is trivial, the product follows from

      vc=−λ+λ−=1+32(1+32−1)=1+32(3−12)=(3)1−124=12.vc = -\lambda_+\lambda_- = \frac{1+\sqrt{3}}{2} \left(\frac{1+\sqrt{3}}{2}-1\right) = \frac{1+\sqrt{3}}{2} \left(\frac{\sqrt{3}-1}{2}\right) = \frac{(\sqrt{3})^1-1^2}{4} = \frac{1}{2}.

      Now, for v2=v+12v^2=v+\tfrac12 and c2=12−cc^2=\tfrac12-c. Inserting each root in the equation gives

      v2=(1+32)2=4+234=1+32=12+(1+32⏟=v).v^2 = \left ( \frac{1+\sqrt{3}}{2} \right)^2 = \frac{4+2\sqrt{3}}{4} = 1 + \frac{\sqrt{3}}{2} = \frac{1}{2} + \left(\underbrace{\frac{1+\sqrt{3}}{2}}_{=v}\right).

      Then v2+c2=(v−c)2+2vc=12+2vc⏟=12=2v^2+c^2=(v-c)^2+2vc=1^2+2\underbrace{vc}_{=\frac{1}{2}} = 2 and 1−c2=12+c=v−12=r1-c^2=\tfrac12+c=v-\tfrac12=r. So, these are simply aspects.

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

  5. Partial resultOpenContext 5.1019 Nov 2026
    +1
    2 comments

    Proofs for OpenContext 5.9: the sharp three-qubit threshold and a uniform bound of 0.496222

    by Yujie Zhang · fully AI-generated

    Main result

    This is the proof of the two bounds announced in OpenContext 5.9. Let d=2nd=2^n and let cnc_n be the largest constant such that every nn-qubit density matrix of purity at most 1/(d−cn)1/(d-c_n) is a convex mixture of stabilizer states. Then

    c3=12,cn≥c∗=327659848669660308814208=0.496222133672421…(n≥1).\begin{aligned} c_3&=\tfrac12,\\ c_n&\ge c_* =\frac{327659848669}{660308814208}\\ &=0.496222133672421\ldots \qquad(n\ge1). \end{aligned}

    For three qubits the sharp purity threshold is 2/152/15. The uniform bound applies to every state, with arbitrary spectrum and eigenbasis. The conjectured equality cn=1/2c_n=1/2 remains open for n≥4n\ge4. The main result of OpenContext 5.7 gave a uniform value of 0.48590.4859.

    Which steps use a computer? Both proofs are computer-assisted. For c3=1/2c_3=1/2, exact polynomial certificates classify the witnesses on the sphere Tr⁡(A2)=2\operatorname{Tr}(A^2)=2. Interpolation then excludes witnesses outside that sphere, and an explicit contact state proves sharpness. These last two deductions are analytic. For the uniform bound, rigorous interval computations establish the finite estimates for n=4,…,15n=4,\ldots,15. Once the bound on c15c_{15} is in hand, one analytic averaging identity covers every n>15n>15. No computation at 16 qubits or beyond is required. This contribution is AI-generated.

    Read more

    1. Rafael Wagner · 19 Nov 2026

      This is quite interesting; I am reviewing and digesting the proof of 0.4996 and will upload it soon today. I really think that, given more time we could be closing the problem entirely?!

      Crazy

      1. Rafael Wagner · 19 Nov 2026

        The result I have has the sharp proof that c=1/2c=1/2 with the conjecture remaining open for n≥6n\geq 6.

        I wonder whether we could simply use an insight that, nothing in principle seems to be stopping us from just making the bound tighter and tigther.

    All 2 comments →
  6. ChallengeOpenContext 5.818 Nov 2026
    0
    0 comments

    I want to challenge your solution

    by Jan · partially AI-assisted

    This should appear automatically as an "edit" in the history section. Hope it does!

  7. Partial resultOpenContext 5.718 Nov 2026
    0
    3 comments

    An improved bound relative to Liu and Liu's result: from approximately 0.4583 to 0.4589.

    by Rafael Wagner · fully AI-generated

    Main result

    The following is an output from Claude Fable 5.2. The main claim is that it has improved the best bounds known for n=3,4,5n=3,4,5 and also the one valid for all nn. The claimed bound is

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

    Furthermore, the values for n=3,4,5n=3,4,5 are all improved by numerical checks:

    • For n=3n=3: 1/2.0082≈0.49795831/2.0082 \approx 0.4979583.
    • For n=4n=4: 1/2.0314≈0.49227131/2.0314 \approx 0.4922713.
    • For n=5n=5: 1/2.0444≈0.489141061/2.0444 \approx 0.48914106.

    The results below have not been polished nor revised by a human.

    1. Setting

    Throughout d=2nd=2^n, Λn={A=A†: Tr[A]=1, ⟨s∣A∣s⟩≥0 for all stabilizer states s}\Lambda_n=\{A=A^\dagger:\ \mathrm{Tr}[A]=1,\ \langle s|A|s\rangle\ge 0\ \text{for all stabilizer states } s\}, LnL_n is the cone over Λn\Lambda_n, SnS_n is the cone generated by stabilizer states, and Mn:=max⁡A∈ΛnTr[A2].M_n:=\max_{A\in\Lambda_n}\mathrm{Tr}[A^2]. Elements of Λn\Lambda_n are called (normalised stabilizer) witnesses below. By polarity, every state with Tr[ρ2]≤1/(d−1/Mn)\mathrm{Tr}[\rho^2]\le 1/(d-1/M_n) lies in STABn\mathrm{STAB}_n, and this threshold is sharp; the conjecture is Mn=2M_n=2. It is known that M1=M2=2M_1=M_2=2.

    For a Pauli operator P≠IP\neq\mathbb{I} write Π±=(I±P)/2\Pi_\pm=(\mathbb{I}\pm P)/2, aP=Tr[PA]a_P=\mathrm{Tr}[PA], p±=Tr[Π±A]=(1±aP)/2p_\pm=\mathrm{Tr}[\Pi_\pm A]=(1\pm a_P)/2 and B±=Π±AΠ±B_\pm=\Pi_\pm A\Pi_\pm.

    Read more

    1. Jan · 18 Nov 2026

      This looks nice. I can also btw now use \tag (this worked actually before, if one writes math in different lines. Now it always works 2+2=4(1)2+2=4\tag{1}.

      1. Jan · 18 Nov 2026

        Replying to my own comment!

      2. Rafael Wagner · 19 Nov 2026

        Nice!

        I have just found out another proof, which is improving the bound for all nn much more.

    All 3 comments →
  8. Partial resultOpenContext 5.618 Nov 2026
    +1
    0 comments

    Partial Results on the Hilbert–Schmidt Inradius of the Multiqubit Stabilizer Polytope

    by Yixuan Wang · fully AI-generated

    Scope: Analytical statements and proofs under additional spectral or structural hypotheses. This note does not claim priority or originality for the derived implications; a comprehensive prior-art comparison has not been carried out.

    Abstract

    Let STABn\mathrm{STAB}_n be the convex hull of pure nn-qubit stabilizer states and d=2nd=2^n. The open inradius conjecture asserts that Tr⁡(ρ2)≤(d−1/2)−1\operatorname{Tr}(\rho^2)\le(d-1/2)^{-1} implies ρ∈STABn\rho\in\mathrm{STAB}_n. This note gives partial results, not a proof of the unrestricted conjecture. We prove the equivalent dual norm bound for stabilizer-positive trace-one operators with at most one negative eigenvalue, and classify equality within that class using the known closed-noncontextual (CNC) classification. We prove the primal bound for states block diagonal in stabilizer-code sectors of dimension at most four, and show sharpness. An explicit two-negative-eigenvalue example obstructs extending the cubic-moment lemma without further hypotheses. We also constrain the spectrum of any minimal-dimensional counterexample.

    1. Problem, notation, and dual formulation

    Write

    STABn=conv⁡{ ∣s⟩⟨s∣: ∣s⟩ is a pure n-qubit stabilizer state },d=2n.\mathrm{STAB}_n=\operatorname{conv}\{\,|s\rangle\langle s|:\ |s\rangle\text{ is a pure }n\text{-qubit stabilizer state}\,\}, \quad d=2^n.

    The conjecture posed in [P] is

    Tr⁡(ρ2)≤1d−12⟹ρ∈STABnfor all n≥1.(C)\boxed{ \operatorname{Tr}(\rho^2)\le\frac{1}{d-\frac12} \quad\Longrightarrow\quad \rho\in\mathrm{STAB}_n \qquad\text{for all }n\ge1. }\tag{C}

    It is established for n=1,2n=1,2 and remains open in general. The best unconditional constant reported in [L2] is a∗≃0.458327a_*\simeq0.458327, in place of the conjectured 1/21/2.

    Read more

  9. Reference

    Ben W. Reichardt, Quantum universality by state distillation, arXiv preprint: quant-ph/0608085 (2006) arXiv:quant-ph/0608085

    Suggested by Rafael Wagner · 18 Nov 2026 · Why it is relevant ▾

    Motivated by quantum error correction and distillation, the author investigated properties of the geometry of stabilizer states which might be useful.

  10. Reference

    Zhenhuan Liu and Zi-Wen Liu, On the geometry, typicality, and detectability of quantum magic, arXiv preprint:2609.03944 (2026) arXiv:2609.03944

    Suggested by Rafael Wagner · 18 Nov 2026 · Why it is relevant ▾

    They have, as far as I am aware, the largest known value for the bound which gets closer to the conjectured 1/2.

  11. Reference

    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)

    Suggested by Rafael Wagner · 18 Nov 2026 · Why it is relevant ▾

    It introduces a notion of Lambda polytope which is crucial for the whole topic.

  12. Partial resultOpenContext 5.518 Nov 2026
    0
    0 comments

    A weaker bound on the stabilizer-inradius conjecture

    by Rafael Wagner · partially AI-assisted

    Result

    Using Claude Fable 5.2 and a few prompts, it was possible to prove the following weaker statement:

    Proposition: 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, with n≥2n\geq 2. Denote, furthermore, dn=2nd_n = 2^n and the function c(⋅):N→Qc_{(\cdot)}:\mathbb{N}\to\mathbb{Q} given by

    cn=2dn+77dn+2>27.c_n=\frac{2d_n+7}{7d_n+2}>\frac{2}{7}.

    Then,

    Tr[ρ2]≤1dn−cn  ⟹  ρ∈STABn.\mathrm{Tr}[\rho^2] \leq \frac{1}{d_n-c_n} \implies \rho \in \mathrm{STAB}_n.

    In particular, for all n≥2n \geq 2 it holds that

    Tr[ρ2]≤1dn−27  ⟹  ρ∈STABn.\mathrm{Tr}[\rho^2] \leq \frac{1}{d_n-\frac{2}{7}} \implies \rho \in \mathrm{STAB}_n.

    Note that this is only a partial result because the conjecture claims that the implication holds with cn=12c_n=\frac{1}{2} for arbitrary nn.

    Background

    The key technical idea is to use the fact that one can investigate the easier properties associated with the convex cones generated by the set of states and the stabilizer polytopes, as opposed to the sets themselves. In this case, one replaces rotations and the more complicated geometry of the inradius by properties of cone-preservation and related ideas.

    Read more

  13. VerificationOpenContext 5.417 Nov 2026
    −1
    3 comments

    Test

    by Jan · partially AI-assisted

    Hello, this is a test

    1. Rafael Wagner · 18 Nov 2026

      Is this a reply to the verification part?

      1. Jan · 18 Nov 2026

        Yes! At least one can discuss the contribution.

    2. Jan · 17 Nov 2026

      I think this is completely wrong

    All 3 comments →
  14. EvidenceOpenContext 5.317 Nov 2026
    +2
    0 comments

    Numerical test of the stabilizer-polytope inradius conjecture for small values of $n$

    by Rafael Wagner · fully AI-generated

    Numerical test of the stabilizer-polytope inradius conjecture, n = 1, 2, 3

    Claim tested. For d=2nd = 2^n: Tr(ρ2)≤1/(d−12)  ⟹  ρ∈STABn\mathrm{Tr}(\rho^2) \le 1/(d-\tfrac12) \implies \rho \in \mathrm{STAB}_n.

    Outcome. No violation was found for n=1,2,3n = 1, 2, 3. In every case the search reaches the conjectured bound exactly and never exceeds it. This is numerical evidence, not a proof: the search is a multi-start local optimisation and cannot certify a global maximum for n=3n = 3.

    AI-generated (Claude, Fable 5.2); not independently checked.

    Method

    A state is represented by its d2−1d^2-1 Pauli expectation values bP=Tr(ρP)b_P = \mathrm{Tr}(\rho P), so that Tr(ρ2)=(1+∣b∣2)/d\mathrm{Tr}(\rho^2) = (1+|b|^2)/d and STABn\mathrm{STAB}_n is the convex hull of the stabilizer-state vectors (6, 60 and 1080 of them for n=1,2,3n=1,2,3).

    Experiment 1 (dual search). A witness W=I−∑PwPPW = I - \sum_P w_P P is non-negative on all stabilizer states iff Vw≤1Vw \le 1, where the rows of VV are the stabilizer vectors. Then A=W/dA = W/d lies in the dual polytope Λn\Lambda_n and Tr(A2)=(1+∣w∣2)/d\mathrm{Tr}(A^2) = (1+|w|^2)/d. The conjecture is equivalent to max⁡A∈ΛnTr(A2)=2\max_{A\in\Lambda_n} \mathrm{Tr}(A^2) = 2. Since this maximises a convex function over a polytope, I iterate linear programs (each step maximises ⟨wk,w⟩\langle w_k, w\rangle) from random starting directions until a vertex is a fixed point, and record Tr(A2)\mathrm{Tr}(A^2) there.

    Read more

  15. Partial resultOpenContext 5.217 Nov 2026
    −1
    2 comments

    The solution for N=1

    by Rudi B. P. Pietsch · partially AI-assisted

    Let us just consider the case of n=1n=1.

    In that case, we have d=21=2d=2^1=2.

    The state can be expressed as ϱ=1+rσ2\varrho = \frac{\mathbb{1} + r \sigma}{2}. An octahedron with ∣r∣≤1|r| \leq 1 defines the stabilizer polytope, and the purity is given by Tr(ϱ2)=1+∣r∣22\mathrm{Tr} (\varrho^2) = \frac{1 + |r|^2}{2}.

    For the implication Tr(ϱ2)≤1d−1/2=23\mathrm{Tr}(\varrho^2) \leq \frac{1}{d-1/2} = \frac{2}{3} to hold, we need ∣r∣2≤13|r|^2 \leq \frac{1}{3}, which holds as ∣r∣≤3∣r∣≤1|r| \leq \sqrt{3} |r| \leq 1.

    1. Rafael Wagner · 18 Nov 2026

      I dont understand the downvotes! this is clearly a good (albeit trivial) advance

    2. Rafael Wagner · 18 Nov 2026

      I think it might be possible to have advance these results to the cases (at least numerically) for up to n=5 using neat mathematical tricks.

  16. ExpositionOpenContext 5.117 Nov 2026
    +1
    1 comments

    On the geometry of the inner ball

    by Rafael Wagner · no AI assistance

    Background

    If we consider Ref. [2], we can note that the set of all states which lie in the inner ball - i.e., the one inside the octahedron - are of a special kind of nonstabilizer states. The way in which they are special is as follows: take any arbitrary number of states ρ1,…,ρn\rho_1,\ldots, \rho_n. Regardless of how one rotates these states, if they lie inside the inner ball, they will certainly remain inside the set of stabilizer states of the qubit.

    The question is then what is the value of the purity for arbitrary number of qubits.

    Important considerations

    The most crucial consideration one needs to take here is the fact that for arbitrary dimensions, the one-to-one correspondance between the Bloch ball and quantum states is lost. Specifically, while in two dimensions every point in the ball corresponds to one and only one state, and vice versa, the same does not holds for arbitrary dimensions. In arbitrary dimensions, the set of states is contained in a real ball of radius 1, but it is simple to find points in the ball which corresponds to no quantum state.

    1. Rafael Wagner · 18 Nov 2026

      I cannot revise my own contribution. I wonder whether we should warn people of that, or allow for small edits to be made.

  17. Reference

    On the geometry, typicality, and detectability of quantum magic arXiv:2609.03944

    Suggested by Rudi B. P. Pietsch · 17 Nov 2026 · Why it is relevant ▾

    This seems to be a relevant recent preprint that might include advancements towards the problem.

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.