Contributors toProblem 5: Test problem: Hilbert–Schmidt inradius of the multiqubit stabilizer polytopeunder revision
Contributors
Everyone who posed, proposed, edited or added to the problem, in the order they first did, as credited.
Ingo Roth
1 contribution- PosedPosed the problem2026
Qi Ye
1 contribution- PosedPosed the problem2026
Tobias Haug
1 contribution- PosedPosed the problem2026
Zhenhuan Liu
1 contribution- PosedPosed the problem2026
Zi-Wen Liu
1 contribution- PosedPosed the problem2026
Rafael Wagner
18 contributions- ProposedProposed it for the site17 Nov 2026
- EditVersion 2: Erased an earlier comment from the question posed, and added context to the question.17 Nov 2026
- ExpositionOn the geometry of the inner ball17 Nov 2026
- EditVersion 5: Included background and other things17 Nov 2026
- EvidenceNumerical test of the stabilizer-polytope inradius conjecture for small values of $n$17 Nov 2026
- Partial resultA weaker bound on the stabilizer-inradius conjecture18 Nov 2026
- ReferenceMichael Zurel, Cihan Okay, and Robert Raussendorf, Hidden Variable Model for Universal Quantum Computation with Magic States on Qubits, Phys. Rev. Lett. 125, 260404 (2020)18 Nov 2026
- ReferenceBen W. Reichardt, Quantum universality by state distillation, arXiv preprint: quant-ph/0608085 (2006)18 Nov 2026
- ReferenceZhenhuan Liu and Zi-Wen Liu, On the geometry, typicality, and detectability of quantum magic, arXiv preprint:2609.03944 (2026)18 Nov 2026
- EditVersion 8: I've suggested improvements on the background of the problem18 Nov 2026
- EditVersion 9: I think that the Relevance and Significance could be improved18 Nov 2026
- Partial resultAn improved bound relative to Liu and Liu's result: from approximately 0.4583 to 0.4589.18 Nov 2026
- EditVersion 10: Improvements on the references19 Nov 2026
- EditVersion 11: Improvements on the references19 Nov 2026
- Partial resultAn improved computer-assisted bound at 0.4996 for all $n$, and a sharp 0.5 value for $n\leq 5$ (part I)19 Nov 2026
- Partial resultAn improved computer-assisted bound at 0.4996 for all $n$, and a sharp 0.5 value for $n\leq 5$ (part II)19 Nov 2026
- EditVersion 12: Improvements on the references20 Nov 2026
- VerificationA solution to the problem which uses Aronszajn's inequality20 Nov 2026
Rudi B. P. Pietsch
2 contributions- ReferenceOn the geometry, typicality, and detectability of quantum magic17 Nov 2026
- Partial resultThe solution for N=117 Nov 2026
Yìlè Yīng
1 contribution- EditVersion 3: add the term magic state to the statement17 Nov 2026
Jan
3 contributions- VerificationTest17 Nov 2026
- EditVersion 6: Tested if edits are now credited17 Nov 2026
- ChallengeI want to challenge your solution18 Nov 2026
Albert
1 contribution- EditVersion 6: Tested if edits are now credited17 Nov 2026
Yixuan Wang
1 contribution- Partial resultPartial Results on the Hilbert–Schmidt Inradius of the Multiqubit Stabilizer Polytope18 Nov 2026
Yujie Zhang
2 contributions- Partial resultProofs for OpenContext 5.9: the sharp three-qubit threshold and a uniform bound of 0.49622219 Nov 2026
- Claimed solutionA proposed analytic proof of the sharp bound cₙ = 1/2 for every number of qubits20 Nov 2026