diff --git a/codes/quantum/properties/block/block_quantum.yml b/codes/quantum/properties/block/block_quantum.yml index e2021ecb6..cb9ef49c0 100644 --- a/codes/quantum/properties/block/block_quantum.yml +++ b/codes/quantum/properties/block/block_quantum.yml @@ -34,6 +34,9 @@ protection: | \subsection{Bounds on code parameters} Bounds on finite dimensional block code performance include the quantum Singleton bound, quantum Hamming bound, \hyperref[topic:quantum-gv-bound]{quantum GV bound}, various quantum linear programming (LP) bounds \cite{arxiv:quant-ph/9611001,arxiv:quant-ph/9709049} (see the book \cite{preset:GottesmanBook}), and other bounds \cite{doi:10.1109/TIT.2005.862086,arxiv:1007.3655}. A code whose parameters attain the quantum Hamming bound (quantum Singleton bound) is called a perfect quantum code (a quantum MDS code). + Every \(((n,K,d))\) code with \(K>1\) on qudits of any integer dimension \(q\geq 2\), including \hyperref[topic:quantum-weight-enumerator]{impure} and non-stabilizer codes, satisfies \(Kf(0)\leq q^{n}\,\mathbb{E}f(X)\) for \(X\sim\mathrm{Bin}(n,1-q^{-2})\) \cite[Sec. 2]{arxiv:2610.30088}. + Here, \(f\) is any real polynomial of degree less than \(d\) that is nonnegative on \(\{0,1,\ldots,n\}\) and positive at zero. + Particular choices of \(f\) yield the \hyperref[code:quantum_perfect]{strengthened quantum Hamming bounds} \cite{arxiv:2610.30088}. We are often interested in how parameters of particular infinite block quantum code families scale with increasing block length \(n\), necessitating the use of \hyperref[topic:asymptotics]{asymptotic notation}. A code family is called \textit{good} when its rate \(k/n\) and relative error-correction capability \(t/n\), equivalently relative distance up to constant factors, remain bounded away from zero as \(n\to\infty\) \cite[Ch. 2]{preset:GottesmanBook}. @@ -81,6 +84,10 @@ relations: _meta: # Change log - most recent first changelog: + - user_id: VictorVAlbert + date: '2026-11-12' + - user_id: VictorVAlbert + date: '2026-11-07' - user_id: VictorVAlbert date: '2026-09-28' - user_id: VictorVAlbert diff --git a/codes/quantum/properties/block/quantum_perfect.yml b/codes/quantum/properties/block/quantum_perfect.yml index 482903192..978c47e3d 100644 --- a/codes/quantum/properties/block/quantum_perfect.yml +++ b/codes/quantum/properties/block/quantum_perfect.yml @@ -12,7 +12,7 @@ name: 'Perfect quantum code' description: | A type of block quantum code whose parameters satisfy the quantum Hamming bound with equality. - A \hyperref[topic:degeneracy]{non-degenerate} code constructed out of \(q\)-dimensional qudits and having parameters \(((n,K,2t+1))\) is perfect if \(n\), \(K\), \(t\), and \(q\) are such that the quantum Hamming bound \cite{arxiv:quant-ph/9602022}, + A code constructed out of \(q\)-dimensional qudits and having parameters \(((n,K,2t+1))\) is perfect if \(n\), \(K\), \(t\), and \(q\) are such that the quantum Hamming bound \cite{arxiv:quant-ph/9602022}, \begin{align} \sum_{j=0}^{t}(q^2-1)^{j}{n \choose j}\leq q^{n}/K \end{align} @@ -27,16 +27,27 @@ description: | where \(h\) is the binary entropy function. The standard counting proof of the bound assumes a \hyperref[topic:degeneracy]{non-degenerate} code \cite{arxiv:2606.15558}. - All \(((n,K,d))\) qubit codes with \(K>1\), including degenerate and nonadditive codes, satisfy the quantum Hamming bound \cite{arxiv:2606.15558}. + All \(((n,K,d))\) codes with \(K>1\) on qudits of any integer dimension \(q\geq 2\), including \hyperref[topic:quantum-weight-enumerator]{impure} and non-stabilizer codes, satisfy the quantum Hamming bound \cite{arxiv:2606.15558,arxiv:2606.22538,arxiv:2610.30088}. Qubit stabilizer codes correcting up to two errors \cite{arxiv:quant-ph/9705052} and qudit stabilizer codes correcting two errors \cite{arxiv:0711.4603} do not violate the bound. The same holds for qudit CSS codes of qudit dimension \(q\geq 5\) along with certain other codes \cite{arxiv:0811.1621} and for qubit codes of distance \(d<127\) \cite{arxiv:2208.11800}. A quantum Hamming-like bound exists for \hyperref[topic:degeneracy]{degenerate} qubit stabilizer codes \cite{arxiv:2306.00048}. protection: | - Perfect codes have been classified. - For qubits (\(q=2\)), the only nontrivial perfect codes are the stabilizer code family \([[(4^r-1)/3, (4^r-1)/3 - 2r, 3]]\) for \(r \geq 2\), obtained from Hamming codes over \(\mathbb{F}_4\) via the Hermitian construction \cite{arxiv:quant-ph/9607027,arxiv:quant-ph/9608006}. These codes are related to partial spreads in projective geometry \cite{doi:10.2140/iig.2008.6.53}. + \hyperref[topic:quantum-weight-enumerator]{Pure} perfect codes have been classified. + For qubits (\(q=2\)), the only nontrivial pure perfect codes are the stabilizer code family \([[(4^r-1)/3, (4^r-1)/3 - 2r, 3]]\) for \(r \geq 2\), obtained from Hamming codes over \(\mathbb{F}_4\) via the Hermitian construction \cite{arxiv:quant-ph/9607027,arxiv:quant-ph/9608006}. These codes are related to partial spreads in projective geometry \cite{doi:10.2140/iig.2008.6.53}. For qudits, the corresponding family is the \([[\frac{q^{2r}-1}{q^{2}-1},\frac{q^{2r}-1}{q^{2}-1}-2r,3]]_q\) family of quantum twisted codes \cite{arxiv:0907.0049,doi:10.1002/(SICI)1520-6610(2000)8:3<174::AID-JCD3>3.0.CO;2-T}. + For codes of distance \(2t+1+\sigma\) with \(t\geq 1\) and \(\sigma\in\{0,1\}\), the \textit{quantum Hamming-Singleton bounds} \cite[Thm. 1]{arxiv:1005.4758} + \begin{align} + K\,q^{4e+2\sigma}\sum_{j=0}^{t-e}(q^2-1)^{j}{n-2e-\sigma \choose j}\leq q^{n}\qquad(0\leq e\leq t) + \end{align} + reduce to the quantum Hamming bound for \(e=\sigma=0\) and to the \hyperref[code:quantum_mds]{quantum Singleton bound} for \(e=t\). + The \textit{strengthened quantum Hamming bounds} \cite[Thm. 2]{arxiv:1005.4758} read \(Kg(0)\leq q^{n}\,\mathbb{E}g(X)\) for \(X\sim\mathrm{Bin}(n,1-q^{-2})\), where \(g(x)=\binom{n-x}{2e+\sigma}\prod_{\xi}(x-\lfloor\xi\rfloor)(x-\lfloor\xi\rfloor-1)\) \cite[Sec. 2.1]{arxiv:2610.30088}. + Here, \(\xi\) runs over the zeros of the degree-\((t-e)\) Lloyd polynomial at length \(n-2e-\sigma\) over an alphabet of size \(q^2\). + In other words, each zero is rounded to a pair of adjacent integers. + Each strengthened bound is strictly stronger than its Hamming-Singleton counterpart exactly when some Lloyd zero is not an integer \cite[Sec. 5.1]{arxiv:2610.30088}. + The strengthened bounds hold for all codes with \(K>1\) \cite[Thm. 2.1]{arxiv:2610.30088}, proving a conjecture of Ref. \cite{arxiv:1005.4758}. + # The trivial code (\(k=n\)) is also perfect. features: @@ -49,15 +60,15 @@ notes: relations: parents: - code_id: small_distance_quantum - detail: 'All non-trivial perfect codes have distance three.' + detail: 'All non-trivial \hyperref[topic:quantum-weight-enumerator]{pure} perfect codes have distance three.' - code_id: qecc_finite cousins: - code_id: perfect detail: 'A classical (quantum) perfect code saturates the classical (quantum) Hamming bound.' - code_id: stabilizer_over_gf4 - detail: 'For qubits (\(q=2\)), the only nontrivial perfect codes are the stabilizer code family \([[(4^r-1)/3, (4^r-1)/3 - 2r, 3]]\) for \(r \geq 2\), obtained from Hamming codes over \(\mathbb{F}_4\) via the Hermitian construction \cite{arxiv:quant-ph/9607027,arxiv:quant-ph/9608006}. These codes are related to partial spreads in projective geometry \cite{doi:10.2140/iig.2008.6.53}.' + detail: 'For qubits (\(q=2\)), the only nontrivial \hyperref[topic:quantum-weight-enumerator]{pure} perfect codes are the stabilizer code family \([[(4^r-1)/3, (4^r-1)/3 - 2r, 3]]\) for \(r \geq 2\), obtained from Hamming codes over \(\mathbb{F}_4\) via the Hermitian construction \cite{arxiv:quant-ph/9607027,arxiv:quant-ph/9608006}. These codes are related to partial spreads in projective geometry \cite{doi:10.2140/iig.2008.6.53}.' - code_id: q-ary_hamming - detail: 'For qubits (\(q=2\)), the only nontrivial perfect codes are the stabilizer code family \([[(4^r-1)/3, (4^r-1)/3 - 2r, 3]]\) for \(r \geq 2\), obtained from Hamming codes over \(\mathbb{F}_4\) via the Hermitian construction \cite{arxiv:quant-ph/9607027,arxiv:quant-ph/9608006}. These codes are related to partial spreads in projective geometry \cite{doi:10.2140/iig.2008.6.53}.' + detail: 'For qubits (\(q=2\)), the only nontrivial \hyperref[topic:quantum-weight-enumerator]{pure} perfect codes are the stabilizer code family \([[(4^r-1)/3, (4^r-1)/3 - 2r, 3]]\) for \(r \geq 2\), obtained from Hamming codes over \(\mathbb{F}_4\) via the Hermitian construction \cite{arxiv:quant-ph/9607027,arxiv:quant-ph/9608006}. These codes are related to partial spreads in projective geometry \cite{doi:10.2140/iig.2008.6.53}.' @@ -65,6 +76,12 @@ relations: _meta: # Change log - most recent first changelog: + - user_id: VictorVAlbert + date: '2026-11-12' + - user_id: VictorVAlbert + date: '2026-11-11' + - user_id: VictorVAlbert + date: '2026-11-07' - user_id: VictorVAlbert date: '2026-10-27' - user_id: VictorVAlbert diff --git a/codes/quantum/qudits_galois/stabilizer/bch/quantum_twisted.yml b/codes/quantum/qudits_galois/stabilizer/bch/quantum_twisted.yml index 13aab1133..9dafc1700 100644 --- a/codes/quantum/qudits_galois/stabilizer/bch/quantum_twisted.yml +++ b/codes/quantum/qudits_galois/stabilizer/bch/quantum_twisted.yml @@ -22,7 +22,7 @@ relations: - code_id: stabilizer_over_gfqsq cousins: - code_id: quantum_perfect - detail: 'The \([[\frac{q^{2r}-1}{q^{2}-1},q^{n-2r},3]]_q\) family of quantum twisted codes are the only perfect Galois-qudit codes \cite{arxiv:0907.0049,doi:10.1002/(SICI)1520-6610(2000)8:3<174::AID-JCD3>3.0.CO;2-T}.' + detail: 'The \([[\frac{q^{2r}-1}{q^{2}-1},q^{n-2r},3]]_q\) family of quantum twisted codes are the only \hyperref[topic:quantum-weight-enumerator]{pure} perfect Galois-qudit codes \cite{arxiv:0907.0049,doi:10.1002/(SICI)1520-6610(2000)8:3<174::AID-JCD3>3.0.CO;2-T}.' - code_id: twisted_bch detail: 'Quantum twisted codes are quantum analogues of twisted BCH codes.' @@ -31,6 +31,8 @@ relations: _meta: # Change log - most recent first changelog: + - user_id: VictorVAlbert + date: '2026-11-11' - user_id: VictorVAlbert date: '2026-06-08' - user_id: VictorVAlbert