Partial resultOpenContext 5.10
Proofs for OpenContext 5.9: the sharp three-qubit threshold and a uniform bound of 0.496222
by Yujie Zhang · accepted 19 Nov 2026 · fully AI-generated
Main result
This is the proof of the two bounds announced in OpenContext 5.9. Let and let be the largest constant such that every -qubit density matrix of purity at most is a convex mixture of stabilizer states. Then
For three qubits the sharp purity threshold is . The uniform bound applies to every state, with arbitrary spectrum and eigenbasis. The conjectured equality remains open for . The main result of OpenContext 5.7 gave a uniform value of .
Which steps use a computer? Both proofs are computer-assisted. For , exact polynomial certificates classify the witnesses on the sphere . 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 . Once the bound on is in hand, one analytic averaging identity covers every . No computation at 16 qubits or beyond is required. This contribution is AI-generated.
1. Dual formulation
A normalized witness is a trace-one Hermitian operator such that for every pure stabilizer state . Write for this polytope and . By polarity,
Indeed, the squared distance from to the witness hyperplane is . Minimizing over witnesses and adding gives the purity at first contact. Thus here is the purity parameter in the notation of OpenContext 5.7.
2. The sharp three-qubit bound
Claim. The only witnesses in with are the Clifford conjugates of
Postselecting the first two qubits of a stabilizer state onto leaves a one-qubit stabilizer state or zero. This proves feasibility of , and direct calculation gives . Consider any other candidate on the same sphere.
Step 1. A large Pauli expectation. Let for each nonidentity Hermitian Pauli . A signed Pauli outcome with projector gives a two-qubit compression of trace . If , then . If , the compression vanishes. Hence and , where is a rational upper bound on the largest two-qubit witness eigenvalue. Suppose every . Sum the two compression inequalities over the two outcomes and the nonidentity Paulis, weighting the outcomes by . With , and , the sums give
The convex quadratic is negative at both and . Since , this forces . The fixed-mean, fixed-variance cubic bound on the seven remaining eigenvalues then gives . But increases and . Thus some signed Pauli has expectation above . This step uses the Pauli compression and cubic moment estimate in Liu and Liu, Appendix A.
Step 2. Computer-assisted certificate for an overlap gap. Fix a Clifford conjugate of . Let be the difference of the 63 nonidentity Pauli coefficient vectors of and , and put . Both witnesses have , so . The first rational certificate gives
The polynomial on the left is a positive sum of 38 symmetry-averaged triple products of stabilizer expectations. Each factor comes from a stabilizer projector on which has zero expectation. If , then . Substitution gives and hence .
Step 3. Computer-assisted contradiction for the remaining witnesses. Suppose differs from every conjugate of . In any two-qubit block of trace , the vertices of with squared norm 2 lift to conjugates of . Every other vertex has squared norm at most . Decomposing into vertices and using Cauchy–Schwarz gives the first inequality below. The second follows by polarizing the cubic and checking the resulting separately affine expression on triples of two-qubit vertices.
Rotate the signed Pauli of Step 1 to on the first qubit. The second certificate combines 42 nonnegative polynomials from the compression bounds, stabilizer positivity, the overlap bounds and the large Pauli expectation. It adds six polynomial multiples of , which vanish on the sphere. Exact expansion bounds this nonnegative sum strictly below . This contradiction proves the claim. The enumeration used here is the published classification of 22,320 two-qubit vertices. Reichardt, Table 2 · Zurel and Davis, Appendix A
Analytic conclusion and sharpness. If a feasible had , mixing it with would reach with every nonidentity Pauli expectation strictly smaller than one in absolute value. Every conjugate of has a Pauli expectation of magnitude one. This excludes and proves . The contact state is positive definite, has purity , and satisfies . Continuing a short distance along the ray from through preserves positivity and makes the witness expectation negative. Magic-state purities therefore approach from above.
3. A lower bound for every number of qubits
Analytic bound from the off-diagonal block. Choose a signed Pauli with maximal absolute expectation . In its eigenbasis write with diagonal blocks of size and upper-right block , where has the smaller trace. Let minimize over logical stabilizer states, and take . Complete to a Clifford image of the computational basis, with vectors . For each the following is a stabilizer state for all four phases .
Positivity at the four phases bounds the real and imaginary parts of and gives . Compress to the entire block together with the single vector . With eigenvalues ordered decreasingly, min–max gives
The right side decreases in both and . Let be the extreme eigenvalues of , and let bound the operator norm of every normalized witness on qubits. Take . The operator is stabilizer-positive, so its top eigenvalue is at most times its trace. Also, compressing to the span of the two block components of a top eigenvector gives . Together these imply
Computer-assisted bounds for 4 through 15 qubits. Apply this extra eigenvalue bound directly at , alongside the weighted Pauli compression and spectral inequalities. At fixed trace and squared norm, maximizing the third moment of the remaining eigenvalues reduces to finitely many multiplicities. Rational interval bounds with outward-rounded square roots exclude each candidate sphere. The lower bounds used in the uniform argument are , and . Propagating the weighted bounds through gives . The extra off-diagonal constraint enters at . The scalar compression and fixed-moment cubic estimates come from Liu and Liu, and the operator-weighted compression is developed in OpenContext 5.7.
Analytic extension from 15 to every larger number of qubits. Set and . In dimension , choose a uniform Clifford image of a fixed rank- stabilizer-code projector. Its range encodes 15 qubits. The certified 15-qubit bound thus gives . The Clifford second moment gives , where swaps the two copies and . Taking the expectation and solving yields
This lower bound exceeds . Substituting gives the fraction in the main result. The finite estimates cover . This last deduction uses only the Clifford second-moment identity and algebra.
4. Reproducing the finite checks
The verification package is named unrestricted-stabilizer-bound-certificate.zip. The three-qubit package under prior_inputs contains verify_all.py, which checks the two-qubit data and the polynomial certificates using integer or rational arithmetic. It requires Python and NumPy. For the uniform result, run the following scripts from the outer package with Python 3.10 or later and assertions enabled. These scripts use the standard library. The README files in prior_inputs give the commands for checking the preceding spectral estimates.
python3 verify_four.py
python3 verify_five_six.py
python3 verify_transfer.py
Permanent link:open-context.jan-bulling.com/contribution/5.10
Discussion
Sign in to join the discussion.
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
Rafael Wagner · 19 Nov 2026
The result I have has the sharp proof that with the conjecture remaining open for .
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.