arXiv:2610.18905
Arithmetic of qudit dimensions governs erasure correction on the Fano plane and stabilizer-state entanglement
Xidan Song, Ruifeng Cao
Abstract
Qudit codes often inherit the parameters of qubit codes, but not necessarily their correctable erasures. We show that a code encoding one qudit of dimension D into seven such qudits that corrects every erasure Steane's code corrects exists exactly when D is a power of 2; for the qutrit color code, exactly when D is odd. This needs no stabilizer assumption: these codes are, up to local unitaries, stabilizer codes of qubits, respectively prime-power qudits. The two patterns differ in one line, which completes the Fano plane only where 1+1=0. As ideal secret sharing schemes, these codes exist exactly where classical ones do: entanglement does not help, unlike for Euler's 36 officers. The same arithmetic makes the entropy cones of qubit and odd-dimensional stabilizer states incomparable from six parties on. At five, the stabilizer cone is strictly smaller than the quantum linear rank cone, answering an open question.
AI Summary
The paper asks whether changing qudit dimension preserves a code’s exact correctable erasures, rather than just its length, rate and distance, and how dimension constrains stabilizer-state entropy patterns. For codes encoding one $D$-dimensional system into seven $D$-dimensional sites, Steane’s erasure pattern is possible exactly when $D$ is a power of two; the odd-dimensional seven-qudit color-code pattern is possible exactly when $D$ is odd. These statements require no stabilizer assumption and extend to ideal quantum secret sharing, including mixed encodings. Every qualifying scheme is pure and locally unitarily equivalent to a stabilizer state; for $D=2$, Steane’s pattern determines Steane’s code up to local unitaries. The proof derives entropies from access conditions using matroid results, then uses equality in strong subadditivity and compatible operator bases to establish stabilizer rigidity and arithmetic restrictions. A dictionary identifies stabilizer entropy cones with self-dual slices of finite-abelian-group rank cones. It yields incomparable qubit and odd-dimensional stabilizer cones from six parties onward. With sufficiently many parties, inclusion for $\mathbb Z_d$ and $\mathbb Z_{d'}$ stabilizers holds exactly when $d\mid d'$, with the sufficient threshold $n\ge2\max(d,d')+2$. At five parties, an explicit facet inequality separates the stabilizer cone from the quantum linear rank cone, answering a stated open question. These separations use transferred rank inequalities and exact computational certificates. Except for ideal-code rigidity, the obstructions concern stabilizers, not general states. Five-party dimension dependence, optimal nonideal share sizes, and quantum validity of the five-party separating inequality remain open; the numerical extreme-ray catalog is incomplete.
draft the text of this paper and write the TikZ code for the figures
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- v2: revised and extended version with a new title. Main text 20 pages, 3 figures; Supplementary Information (41 pages) appended. Data, certificates and code: https://doi.org/10.5281/zenodo.23841282