Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.18905

Arithmetic of qudit dimensions governs erasure correction on the Fano plane and stabilizer-state entanglement

Xidan Song, Ruifeng Cao

cs.ITmath.COquant-phSubmitted Oct 11, 2026• Announced Oct 13, 2026• 0 citations• Revised Oct 31, 2026 (v2)
v1 · Oct 11, 2026v2 · Oct 31, 2026
arXivHTMLPDF

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.

Almost certainly largely AI-generatedAI use disclosed
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

Related papers

Entanglement purification of any stabilizer state

Scott Glancy, Emanuel H. Knill, H. M. Vasconcelos

We present a method for multipartite entanglement purification of any stabilizer state shared by several parties. In our protocol each party measures the stabilizer operators of a quantum error-correcting code on his or her qubits. The parties exchange their measurement results, detect or correct errors, and decode the desired purified state. We give sufficient conditions on the stabilizer codes that may be used in this procedure and find that Steane's seven-qubit code is the smallest error-correcting code sufficient to purify any stabilizer state. An error-detecting code that encodes two qubits in six can also be used to purify any stabilizer state. We further specify which classes of stabilizer codes can purify which classes of stabilizer states.

arXiv:quant-ph/0606125•Physical Review A•Sep 19, 2006•48 citations

Counting stabiliser codes for arbitrary dimension

Tanmay Singal, Che Chiang, Eugene Hsu +3 more

In this work, we compute the number of [[n,k]]d stabilizer codes made up of d -dimensional qudits, for arbitrary positive integers d . In a seminal work by Gross \cite{Gross2006} the number of [[n,k]]d stabilizer codes was computed for the case when d is a prime (or the power of a prime, i.e., d=pm , but when the qudits are Galois-qudits). The proof in \cite{Gross2006} is inapplicable to the non-prime case. For our proof, we introduce a group structure to [[n,k]]d codes, and use this in conjunction with the Chinese remainder theorem to count the number of [[n,k]]d codes. Our work overlaps with \cite{Gross2006} when d is a prime and in this case our results match exactly, but the results differ for the more generic case. Despite that, the overall order of magnitude of the number of stabilizer codes scales agnostic of whether the dimension is prime or non-prime. This is surprising since the method employed to count the number of stabilizer states (or more generally stabilizer codes) depends on whether d is prime or not. The cardinality of stabilizer states, which was so far known only for the prime-dimensional case (and the Galois qudit prime-power dimensional case) plays an important role as a quantifier in many topics in quantum computing. Salient among these are the resource theory of magic, design theory, de Finetti theorem for stabilizer states, the study and optimisation of the classical simulability of Clifford circuits, the study of quantum contextuality of small-dimensional systems and the study of Wigner-functions. Our work makes available this quantifier for the generic case, and thus is an important step needed to place results for quantum computing with non-prime dimensional quantum systems on the same pedestal as prime-dimensional systems.

arXiv:2209.01449•Quantum•Jul 6, 2023•9 citations

Changing the Local-Dimension of an Entanglement-Assisted Stabilizer Code Removes Entanglement Need

Lane G. Gunderman

Having protected quantum information is essential to perform quantum computations. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers. In this paper we show that codes for these systems can be derived from already known codes, and in particular this procedure removes the need for shared entanglement in entanglement-assisted quantum error-correcting codes, which is a result which could prove to be useful for fault-tolerant qudit, and even qubit, quantum computers.

arXiv:2012.13395•Dec 24, 2020•0 citations

Exact entanglement trade-offs in qutrit and composite-dimensional stabilizer states

Zakaria Dahbi

When absolute maximal entanglement is unavailable in a state family, different objectives can select different distributions of residual entanglement. We determine exact trade-offs for qutrit stabilizer states and binary--ternary product states. For eight qutrits, evaluation of the complete published classification gives three nondominated balanced-cut entanglement profiles, characterized by the probabilities of obtaining three or four maximally entangled qutrit pairs. We relate the squared entropy-deficit objective to code weight enumerators and use a uniformity-forcing bound to prove that its eleven-qutrit minimum is six. The unique minimizing Clifford class is an already classified code, whose entropy profile also attains a sharp bound on average reference--erasure mutual information among four-uniform eleven-qutrit stabilizer states. In local dimension six, explicit sector alignments attain 56 maximally mixed four-party reductions, the maximum for arbitrary binary--ternary product states. Within the stabilizer product family, the exact cost--count Pareto boundary consists of $(44,48)$ and $(48,56)$. These results identify when aggregate optimization determines operational entanglement properties and when it does not. Published classifications supply coverage; analytical bounds, explicit witnesses, and independent arithmetic checks establish the stated consequences.

quant-pharXiv:2605.05167•May 7, 2026•0 citations

Tripartite entanglement in qudit stabilizer states and application in quantum error correction

Shiang Yong Looi, Robert B. Griffiths

Consider a stabilizer state on $n$ qudits, each of dimension $D$ with $D$ being a prime or squarefree integer, divided into three mutually disjoint sets or parts. Generalizing a result of Bravyi et al. [J. Math. Phys. 47, 062106 (2006)] for qubits ($D=2$), we show that up to local unitaries, the three parts of the state can be written as tensor product of unentangled signle-qudit states, maximally entangled Einstein-Podolsky-Rosen (EPR) pairs, and tripartite Greenberger-Horne-Zeilinger (GHZ) states. We employ this result to obtain a complete characterization of the properties of a class of channels associated with stabilizer error-correcting codes, along with their complementary channels.

arXiv:1107.1761•Physical Review A•Nov 7, 2011•26 citations

Chiral Color Code: Single-Shot Error Correction for Exotic Topological Order

Dongjin Lee, Beni Yoshida

We present a family of simple three-dimensional stabilizer codes, called the chiral color codes, that realize fermionic and chiral topological orders. In the qubit case, the code realizes the topological phase of a single copy of the fermionic toric code. For qudit systems with local dimension d , the model features a chiral parameter α and realizes 3D topological phases characterized by Z d ( α ) anyon theories with anomalous chiral surface topological order. On closed manifolds, the code has a unique ground state after removing bulk transparent fermions or bosons. Furthermore, we prove that the bulk is short-range entangled (for odd d , coprime α ) by constructing an explicit local quantum channel that prepares the ground state. The chiral color codes are constructed within the gauge color code and hence inherit its fault-tolerant features: they admit single-shot error correction and allow code switching to other stabilizer color codes. These properties position the chiral color codes as particularly useful platforms for realizing and manipulating fermions and chiral anyons.

arXiv:2509.18324•PRX Quantum•May 14, 2026•1 citation
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.
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 DDD-dimensional system into seven DDD-dimensional sites, Steane’s erasure pattern is possible exactly when DDD is a power of two; the odd-dimensional seven-qudit color-code pattern is possible exactly when DDD 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=2D=2D=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 Zd\mathbb Z_dZd​ and Zd′\mathbb Z_{d'}Zd′​ stabilizers holds exactly when d∣d′d\mid d'd∣d′, with the sufficient threshold n≥2max⁡(d,d′)+2n\ge2\max(d,d')+2n≥2max(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.
We present a method for multipartite entanglement purification of any stabilizer state shared by several parties. In our protocol each party measures the stabilizer operators of a quantum error-correcting code on his or her qubits. The parties exchange their measurement results, detect or correct errors, and decode the desired purified state. We give sufficient conditions on the stabilizer codes that may be used in this procedure and find that Steane's seven-qubit code is the smallest error-correcting code sufficient to purify any stabilizer state. An error-detecting code that encodes two qubits in six can also be used to purify any stabilizer state. We further specify which classes of stabilizer codes can purify which classes of stabilizer states.
In this work, we compute the number of [[n,k]]d stabilizer codes made up of d -dimensional qudits, for arbitrary positive integers d . In a seminal work by Gross \cite{Gross2006} the number of [[n,k]]d stabilizer codes was computed for the case when d is a prime (or the power of a prime, i.e., d=pm , but when the qudits are Galois-qudits). The proof in \cite{Gross2006} is inapplicable to the non-prime case. For our proof, we introduce a group structure to [[n,k]]d codes, and use this in conjunction with the Chinese remainder theorem to count the number of [[n,k]]d codes. Our work overlaps with \cite{Gross2006} when d is a prime and in this case our results match exactly, but the results differ for the more generic case. Despite that, the overall order of magnitude of the number of stabilizer codes scales agnostic of whether the dimension is prime or non-prime. This is surprising since the method employed to count the number of stabilizer states (or more generally stabilizer codes) depends on whether d is prime or not. The cardinality of stabilizer states, which was so far known only for the prime-dimensional case (and the Galois qudit prime-power dimensional case) plays an important role as a quantifier in many topics in quantum computing. Salient among these are the resource theory of magic, design theory, de Finetti theorem for stabilizer states, the study and optimisation of the classical simulability of Clifford circuits, the study of quantum contextuality of small-dimensional systems and the study of Wigner-functions. Our work makes available this quantifier for the generic case, and thus is an important step needed to place results for quantum computing with non-prime dimensional quantum systems on the same pedestal as prime-dimensional systems.
Having protected quantum information is essential to perform quantum computations. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers. In this paper we show that codes for these systems can be derived from already known codes, and in particular this procedure removes the need for shared entanglement in entanglement-assisted quantum error-correcting codes, which is a result which could prove to be useful for fault-tolerant qudit, and even qubit, quantum computers.
When absolute maximal entanglement is unavailable in a state family, different objectives can select different distributions of residual entanglement. We determine exact trade-offs for qutrit stabilizer states and binary--ternary product states. For eight qutrits, evaluation of the complete published classification gives three nondominated balanced-cut entanglement profiles, characterized by the probabilities of obtaining three or four maximally entangled qutrit pairs. We relate the squared entropy-deficit objective to code weight enumerators and use a uniformity-forcing bound to prove that its eleven-qutrit minimum is six. The unique minimizing Clifford class is an already classified code, whose entropy profile also attains a sharp bound on average reference--erasure mutual information among four-uniform eleven-qutrit stabilizer states. In local dimension six, explicit sector alignments attain 56 maximally mixed four-party reductions, the maximum for arbitrary binary--ternary product states. Within the stabilizer product family, the exact cost--count Pareto boundary consists of (44,48)(44,48)(44,48) and (48,56)(48,56)(48,56). These results identify when aggregate optimization determines operational entanglement properties and when it does not. Published classifications supply coverage; analytical bounds, explicit witnesses, and independent arithmetic checks establish the stated consequences.
Consider a stabilizer state on nnn qudits, each of dimension DDD with DDD being a prime or squarefree integer, divided into three mutually disjoint sets or parts. Generalizing a result of Bravyi et al. [J. Math. Phys. 47, 062106 (2006)] for qubits (D=2D=2D=2), we show that up to local unitaries, the three parts of the state can be written as tensor product of unentangled signle-qudit states, maximally entangled Einstein-Podolsky-Rosen (EPR) pairs, and tripartite Greenberger-Horne-Zeilinger (GHZ) states. We employ this result to obtain a complete characterization of the properties of a class of channels associated with stabilizer error-correcting codes, along with their complementary channels.
We present a family of simple three-dimensional stabilizer codes, called the chiral color codes, that realize fermionic and chiral topological orders. In the qubit case, the code realizes the topological phase of a single copy of the fermionic toric code. For qudit systems with local dimension d , the model features a chiral parameter α and realizes 3D topological phases characterized by Z d ( α ) anyon theories with anomalous chiral surface topological order. On closed manifolds, the code has a unique ground state after removing bulk transparent fermions or bosons. Furthermore, we prove that the bulk is short-range entangled (for odd d , coprime α ) by constructing an explicit local quantum channel that prepares the ground state. The chiral color codes are constructed within the gauge color code and hence inherit its fault-tolerant features: they admit single-shot error correction and allow code switching to other stabilizer color codes. These properties position the chiral color codes as particularly useful platforms for realizing and manipulating fermions and chiral anyons.