[Jump to code hierarchy]

Binary quantum Goppa code[13]

Description

A quantum AG code obtained from algebraic-geometric Goppa codes via the Galois-qudit CSS construction.

For \(q=2^m\), let \(F/\mathbb{F}_q\) be an algebraic function field of one variable with an automorphism \(\sigma\) of order two fixing \(\mathbb{F}_q\), and let \(P_1,\ldots,P_n\) be pairwise distinct degree-one places such that \(\sigma P_i \neq P_j\) for all \(i,j\). If \(\eta\) is a differential with \(v_{P_i}(\eta)=v_{\sigma P_i}(\eta)=-1\), \(\operatorname{res}_{P_i}(\eta)=1\), and \(\operatorname{res}_{\sigma P_i}(\eta)=-1\), and if \(G\) is a \(\sigma\)-invariant divisor satisfying \(v_{P_i}(G)=v_{\sigma P_i}(G)=0\), then \begin{align} C(G)=\{(f(P_1),\ldots,f(P_n),f(\sigma P_1),\ldots,f(\sigma P_n))\,|\,f\in\mathcal{L}(G)\}\subseteq \mathbb{F}_q^{2n} \tag*{(1)}\end{align} obeys \(C(G)^{\perp_s}=C(H)\), where \(H=(P_1+\cdots+P_n+\sigma P_1+\cdots+\sigma P_n)-G+(\eta)\) [2; Ch. 5]. Whenever \(G \geq H\), this yields an \([[n,k,d]]_q\) quantum stabilizer code with \begin{align} k=\dim G-\dim(G-P_1-\cdots-P_n-\sigma P_1-\cdots-\sigma P_n)-n \tag*{(2)}\end{align} and \(d \geq n-\lfloor \deg G/2 \rfloor\) [1,3][2; Ch. 5].

Protection

For a code with distance \(d\), detects errors on up to \(d-1\) qudits and corrects errors on up to \(\lfloor (d-1)/2 \rfloor\) qudits. In Matsumoto’s construction, \(d \geq n-\lfloor \deg G/2 \rfloor\).

Rate

For every \(m \geq 2\), there are binary quantum Goppa-code families with \(\liminf k_i/n_i \geq 1-\frac{2}{2^m-1}-4m\delta\) and \(\liminf d_i/n_i \geq \delta\) [1,2].

Encoding

Encoding defined in Ref. [4] uses a technique from Ref. [5] to encode quantum stabilizer codes.

Decoding

Farran’s decoder can be used for the underlying AG construction; under the bound \(2\,\mathrm{wt}(e)+1 \leq n-\lfloor \deg G/2 \rfloor\), the relevant minimum-weight error can be recovered in \(O(n^{2.81})\) time [2,6].

Cousins

References

[1]
A. Ashikhmin, S. Litsyn, and M. Tsfasman, “Asymptotically good quantum codes”, Physical Review A 63, (2001) arXiv:quant-ph/0006061 DOI
[2]
A. Niehage, “Quantum Goppa Codes over Hyperelliptic Curves”, (2005) arXiv:quant-ph/0501074
[3]
A. Niehage, “Nonbinary Quantum Goppa Codes Exceeding the Quantum Gilbert-Varshamov Bound”, Quantum Information Processing 6, 143 (2006) DOI
[4]
R. Matsumoto, “Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes”, IEEE Transactions on Information Theory 48, 2122 (2002) arXiv:quant-ph/0107129 DOI
[5]
A. Ashikhmin and E. Knill, “Nonbinary Quantum Stabilizer Codes”, (2000) arXiv:quant-ph/0005008
[6]
J. I. Farran, “Decoding Algebraic Geometry codes by a key equation”, (1999) arXiv:math/9910151
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)— see instructions

edit on this site

Zoo Code ID: binary_quantum_goppa

Cite as:
“Binary quantum Goppa code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/binary_quantum_goppa
BibTeX:
@incollection{eczoo_binary_quantum_goppa, title={Binary quantum Goppa code}, booktitle={The Error Correction Zoo}, year={2024}, editor={Albert, Victor V. and Faist, Philippe}, url={https://errorcorrectionzoo.org/c/binary_quantum_goppa} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/binary_quantum_goppa

Cite as:

“Binary quantum Goppa code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/binary_quantum_goppa

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/quantum/qudits_galois/stabilizer/evaluation/ag/binary_quantum_goppa.yml.