Quantum Singleton Bound for QECC

• The Quantum Singleton Bound is a dimension–distance constraint for quantum error-correcting codes, establishing that k ≤ n - 2(d - 1) and setting fundamental error correction limits.
• It refines the classical Singleton bound by imposing a doubled distance factor, which directly influences the design and performance of both pure and impure quantum codes, including quantum MDS codes.
• Proof methods employing entropy inequalities and symplectic linear algebra, along with extensions to entanglement-assisted regimes, underscore its central role in advancing quantum error correction theory.

The Quantum Singleton Bound is the standard Singleton-type dimension–distance constraint for quantum error-correcting codes. For a standard quantum error-correcting code with parameters $[\![n,k,d]\!]_q$, it is stated as

$2d \le n-k+2,$

equivalently

$k \le n-2(d-1),$

and, in the $((n,K,d))_q$ notation,

$K \le q^{\,n-2(d-1)}.$

It is the quantum analogue of the classical Singleton bound, but it is stricter by a factor of two in the distance term. In the formulations summarized in the literature, the bound applies to both pure and impure QECCs, and codes meeting it with equality are quantum MDS codes (Yu et al., 2010).

1. Standard formulation and operational meaning

For a quantum code $[\![n,k,d]\!]_q$, $n$ is the block length, $k$ is the number of logical qudits, $q$ is the local dimension, and $d$ is the minimum distance. A code of distance $2d \le n-k+2,$0 can correct up to $2d \le n-k+2,$1 arbitrary errors, or up to $2d \le n-k+2,$2 erasures or located errors (Grassl, 2020). In the alternative $2d \le n-k+2,$3 notation, $2d \le n-k+2,$4 is the dimension of the code space, and the same bound becomes $2d \le n-k+2,$5 (Yu et al., 2010).

In rate form, if $2d \le n-k+2,$6, the standard quantum Singleton bound gives

$2d \le n-k+2,$7

This identifies $2d \le n-k+2,$8 as the asymptotic relative-distance ceiling for exact quantum codes. Since unique decoding from arbitrary adversarial errors uses roughly half the distance, the usual exact adversarial decoding radius is bounded by

$2d \le n-k+2,$9

which is the “half-distance” barrier emphasized in the approximate-coding literature (Bergamaschi et al., 2022).

The bound is also naturally interpreted through erasure correction. In the entropic formulation, a code of minimum distance $k \le n-2(d-1),$0 corrects erasures of up to $k \le n-2(d-1),$1 carriers. This makes the parameter $k \le n-2(d-1),$2 the effective amount of block length that must be sacrificed to protect quantum information against both $k \le n-2(d-1),$3- and $k \le n-2(d-1),$4-type logical obstruction, which is why the quantum constraint is stricter than its classical counterpart (Grassl et al., 2020).

2. Equality cases, quantum MDS codes, and strengthened analytic bounds

Codes attaining

$k \le n-2(d-1),$5

with equality are quantum MDS codes (Yu et al., 2010). In this sense the Quantum Singleton Bound plays the same extremal role for quantum codes that the classical Singleton bound plays for MDS codes. The literature summarized here does not merely treat equality as a nomenclature issue; it uses the bound as the baseline from which sharper analytic obstructions are derived.

A particularly explicit strengthening is the quantum Hamming–Singleton bound introduced for pure codes with

$k \le n-2(d-1),$6

The quantum Hamming bound has the form

$k \le n-2(d-1),$7

while the interpolating quantum Hamming–Singleton bound is

$k \le n-2(d-1),$8

for every integer $k \le n-2(d-1),$9 (Yu et al., 2010). When $((n,K,d))_q$0, this reduces to the quantum Hamming bound; when $((n,K,d))_q$1, it reduces to the quantum Singleton bound; and for intermediate $((n,K,d))_q$2, it can be strictly stronger than both. The optimal choice of $((n,K,d))_q$3 is given in that work by

$((n,K,d))_q$4

with $((n,K,d))_q$5 when $((n,K,d))_q$6 (Yu et al., 2010).

The same paper strengthens the combined bound further using Lloyd’s theorem. For a pure code with $((n,K,d))_q$7, it defines a polynomial $((n,K,d))_q$8 from the zeros $((n,K,d))_q$9 of the Lloyd polynomial $K \le q^{\,n-2(d-1)}.$0, and proves a strengthened inequality

$K \le q^{\,n-2(d-1)}.$1

If at least one zero $K \le q^{\,n-2(d-1)}.$2 of the Lloyd polynomial is non-integer, then

$K \le q^{\,n-2(d-1)}.$3

so the strengthened bound is strictly better than the quantum Hamming–Singleton bound, and therefore also better than the quantum Hamming bound (Yu et al., 2010). The paper proves this strengthened form for impure codes when $K \le q^{\,n-2(d-1)}.$4, conjectures that it should hold for impure codes at arbitrary distance, and notes that there is no strengthening for qubits ($K \le q^{\,n-2(d-1)}.$5).

For stabilizer codes, where $K \le q^{\,n-2(d-1)}.$6, these bounds translate into integer constraints on the number of logical qudits. The paper writes

$K \le q^{\,n-2(d-1)}.$7

and when $K \le q^{\,n-2(d-1)}.$8, integrality implies a 1-logical-qudit improvement over the ordinary quantum Hamming bound (Yu et al., 2010). An infinite family highlighted there is

$K \le q^{\,n-2(d-1)}.$9

for binary stabilizer codes with $[\![n,k,d]\!]_q$0.

3. Proof techniques: entropy inequalities and symplectic linear algebra

One modern route to the Quantum Singleton Bound is purely entropic. For an $[\![n,k,d]\!]_q$1-party code state with reference $[\![n,k,d]\!]_q$2, and any partition

$[\![n,k,d]\!]_q$3

perfect correction of a $[\![n,k,d]\!]_q$4 erasure gives the entropy identity

$[\![n,k,d]\!]_q$5

Averaging over all such partitions yields

$[\![n,k,d]\!]_q$6

Using an averaging lemma based on strong subadditivity,

$[\![n,k,d]\!]_q$7

one obtains

$[\![n,k,d]\!]_q$8

which is the standard quantum Singleton bound in logarithmic form (Grassl et al., 2020). The same work emphasizes that these entropic proofs are robust: if a code corrects most erasure patterns only approximately, the same inequalities persist up to continuity corrections.

A distinct recent route is a symplectic proof for stabilizer codes. In this formulation one works over a prime field $[\![n,k,d]\!]_q$9 with

$n$0

equipped with the standard nondegenerate symplectic bilinear form

$n$1

A stabilizer code is specified by an isotropic subspace

$n$2

and the distance is

$n$3

For a subset $n$4, correctable erasure is expressed as

$n$5

The key dimension identity is the cleaning relation

$n$6

where

$n$7

From this one proves that if two disjoint sets $n$8 are both correctable and $n$9, then

$k$0

Choosing $k$1 gives

$k$2

hence

$k$3

for any $k$4 stabilizer code (Dehmel et al., 21 Feb 2026). That paper also provides a Lean4 formalisation of the argument.

4. Entanglement-assisted and hybrid generalizations

For entanglement-assisted quantum error-correcting codes with parameters $k$5, the familiar entanglement-assisted Singleton bound quoted in the literature is

$k$6

Here $k$7 is the number of shared maximally entangled pairs. The same source notes a stronger validity condition from later work: this form is valid for

$k$8

(Grassl, 2020). The entropic converse literature subsequently showed that the generalized quantum Singleton story for EAQECC and CQECC is not captured by a single naive extension. Instead, the correct result is a tradeoff region between transmitted qubits and net entanglement consumption, and it changes qualitatively depending on whether $k$9 or $q$0 (Grassl et al., 2020).

For EAQECC, writing $q$1 for net entanglement consumption, the entropic bounds include

$q$2

$q$3

and, in the regime $q$4,

$q$5

(Grassl et al., 2020). The same work proves a propagation rule: any pure QECC $q$6 gives rise to EAQECC codes

$q$7

The hybrid entanglement-assisted classical–quantum setting is described by net rates $q$8, corresponding to cbits, qubits, and ebits. For a block erasure channel erasing $q$9 of $d$0 subsystems, the achievable triple-rate region is constrained by

$d$1

$d$2

$d$3

for some

$d$4

(Mamindlapally et al., 2022). Setting $d$5 and $d$6 recovers the ordinary quantum Singleton bound, while $d$7 and $d$8 recovers the classical Singleton bound.

In the related setting of entanglement-assisted classical coding, the standard EACC Singleton bound is

$d$9

and a 2026 result shows this bound is tight by a space-sharing construction. In the separate-encoder model, where entanglement is distributed across a subset of encoders and only local quantum operations are allowed, the tight entropic Singleton bound becomes

$2d \le n-k+2,$00

(Yao et al., 9 Mar 2026). These are not statements about standard QECCs, but they locate the Quantum Singleton Bound within a larger family of entropic Singleton-type constraints in quantum Shannon theory.

5. Approximate error correction and the near-Singleton regime

The exact Quantum Singleton Bound does not disappear in the approximate setting, but its operational implications change. For exact quantum codes of rate $2d \le n-k+2,$01, the maximum possible relative distance is approximately $2d \le n-k+2,$02, while exact adversarial unique decoding is limited to $2d \le n-k+2,$03 (Bergamaschi et al., 2022). The question posed in approximate quantum coding is whether approximate recovery can move adversarial correction closer to the full erasure-style Singleton limit.

An approximate quantum error-correcting code $2d \le n-k+2,$04 against a $2d \le n-k+2,$05 fraction of adversarially corrupted blocks is defined by the diamond-norm condition

$2d \le n-k+2,$06

A more general Singleton-type bound quoted in that setting is

$2d \le n-k+2,$07

so approximate correction still cannot exceed the erasure-style ceiling $2d \le n-k+2,$08, up to small additive terms (Bergamaschi et al., 2022).

What changes is achievability. For any $2d \le n-k+2,$09 and $2d \le n-k+2,$10, there exist families of approximate quantum $2d \le n-k+2,$11 codes over a constant alphabet size $2d \le n-k+2,$12 that correct errors on

$2d \le n-k+2,$13

registers, with recovery error

$2d \le n-k+2,$14

(Bergamaschi et al., 2022). The construction is efficiently decodable and combines three ingredients: quantum list decoding, folded quantum Reed–Solomon codes, and an Alon–Edmonds–Luby expander-based distance amplification step to obtain constant alphabet size. The list-decoding stage is then converted into approximate unique decoding via a purity testing code, yielding a private AQECC with error roughly $2d \le n-k+2,$15, and a robust secret sharing scheme removes the private side channel (Bergamaschi et al., 2022).

The significance is that, in the approximate regime, the distance and the adversarial decoding radius can be “nearly identical.” Exact quantum coding remains limited by the half-distance barrier, but approximate quantum coding can correct adversarial errors up to essentially the full Singleton limit $2d \le n-k+2,$16 (Bergamaschi et al., 2022).

6. Scope, limitations, and common misreadings

A common misreading is to treat every entanglement-assisted communication protocol as if it were governed by the standard EAQECC Singleton bound

$2d \le n-k+2,$17

A counterexample to that broader reading is a teleportation-based communication scheme in which shared maximally entangled states are used to teleport the logical qudits, while the resulting classical Bell-measurement outcomes are protected by a classical $2d \le n-k+2,$18 code. The relevant bound for that scheme is the classical Singleton bound

$2d \le n-k+2,$19

In the special case $2d \le n-k+2,$20, comparison with the EAQECC bound gives

$2d \le n-k+2,$21

and the teleportation-based scheme exceeds that whenever

$2d \le n-k+2,$22

The paper gives the explicit family

$2d \le n-k+2,$23

obtained by repeating the MDS code $2d \le n-k+2,$24, with normalized distance

$2d \le n-k+2,$25

(Grassl, 2020). The point is not that the ordinary Quantum Singleton Bound for standard QECCs fails, but that the usual entanglement-assisted Singleton bound does not capture all possible entanglement-assisted communication strategies.

Another important limitation is that the standard Quantum Singleton Bound is fundamentally an exact coding statement. In exact QECCs it implies a relative-distance ceiling near $2d \le n-k+2,$26 and an exact adversarial unique-decoding ceiling near $2d \le n-k+2,$27; in approximate QECCs, the same Singleton ceiling remains the asymptotic obstruction, but explicit constructions can approach it algorithmically (Bergamaschi et al., 2022). This separation is central to current work on approximate quantum coding.

Taken together, the literature presents the Quantum Singleton Bound not as a single isolated inequality, but as a structural organizing principle. It governs standard QECCs, admits sharper analytic refinements in the Hamming–Singleton and Lloyd-polynomial framework, has entropic and symplectic proofs, extends to assisted and hybrid settings in more elaborate piecewise forms, and remains the asymptotic frontier even when approximate recovery nearly closes the exact half-distance gap (Yu et al., 2010).