Modular-qudit code 

Root code for the Modular-qudit Kingdom

Description

Also called a \(\mathbb{Z}_q\)-qudit code. Encodes \(K\)-dimensional Hilbert space into a \(q^n\)-dimensional (\(n\)-qudit) Hilbert space, with canonical qudit states \(|k\rangle\) labeled by elements \(k\) of the group \(\mathbb{Z}_q\) of integers modulo \(q\). Usually denoted as \(((n,K))_{\mathbb{Z}_q}\) or \(((n,K,d))_{\mathbb{Z}_q}\), whenever the code's distance \(d\) is defined, and with \(q=p\) when the dimension is prime.

Protection

A convenient and often considered error set is the modular-qudit analogue [1,2] of the Pauli string basis for qubit codes. For a single qudit, this set consists of products of powers of the qudit Pauli matrices \(X\) and \(Z\), which act on computational basis states \(|k\rangle\) for \(k\in\mathbb{Z}_q\) as \begin{align} X\left|k\right\rangle =\left|k+1\right\rangle \,\,\text{ and }\,\,Z\left|k\right\rangle =e^{i\frac{2\pi}{q}k}\left|k\right\rangle ~, \tag*{(1)}\end{align} with addition performed modulo \(q\). For multiple qudits, error set elements are tensor products of elements of the single-qudit error set.

The Pauli error set is a unitary basis for linear operators on the multi-qudit Hilbert space that is orthonormal under the Hilbert-Schmidt inner product; it is a nice error basis [35]. The distance associated with this set is often the minimum weight of a qudit Pauli string that implements a nontrivial logical operation in the code.

Decoding

For few-qudit codes (\(n\) is small), decoding can be based on a lookup table. For infinite code families, the size of such a table scales exponentially with \(n\), so approximate decoding algorithms scaling polynomially with \(n\) have to be used. The decoder determining the most likely error given a noise channel is called the maximum-likelihood (ML) decoder.

Notes

See Refs. [1,6,7] for reviews on qudits and descriptions of the qudit Clifford group.Weight distribution of a code depends on the average entanglement of codewords [8,9].

Parents

Children

Cousins

  • Entanglement-assisted (EA) QECC — Pure modular-qudit codes can be used to make EA-QECCs with the same distance and dimension; see Thm. 10 of Ref. [10].
  • Subsystem modular-qudit code — Subsystem modular-qudit codes reduce to (subspace) modular-qudit codes when there is no gauge subsystem.
  • Galois-qudit code — A Galois qudit for \(q=p^m\) can be decomposed into a Kronecker product of \(m\) modular qudits [11]; see Sec. 5.3 of Ref. [12]. The two coincide when \(q\) is prime, and reduce to qubits when \(q=2\). However, Pauli matrices for the two types of qudits are defined differently.

References

[1]
“Full length article”, Chaos, Solitons & Fractals 10, 1749 (1999) arXiv:quant-ph/9802007 DOI
[2]
R. Sarkar and T. J. Yoder, “The qudit Pauli group: non-commuting pairs, non-commuting sets, and structure theorems”, (2023) arXiv:2302.07966
[3]
E. Knill, “Non-binary Unitary Error Bases and Quantum Codes”, (1996) arXiv:quant-ph/9608048
[4]
E. Knill, “Group Representations, Error Bases and Quantum Codes”, (1996) arXiv:quant-ph/9608049
[5]
A. Klappenecker and M. Roetteler, “Beyond Stabilizer Codes I: Nice Error Bases”, (2001) arXiv:quant-ph/0010082
[6]
E. Hostens, J. Dehaene, and B. De Moor, “Stabilizer states and Clifford operations for systems of arbitrary dimensions and modular arithmetic”, Physical Review A 71, (2005) arXiv:quant-ph/0408190 DOI
[7]
Y. Wang et al., “Qudits and High-Dimensional Quantum Computing”, Frontiers in Physics 8, (2020) arXiv:2008.00959 DOI
[8]
A. J. Scott, “Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions”, Physical Review A 69, (2004) arXiv:quant-ph/0310137 DOI
[9]
L. Schatzki et al., “A Hierarchy of Multipartite Correlations Based on Concentratable Entanglement”, (2022) arXiv:2209.07607
[10]
M. Grassl, F. Huber, and A. Winter, “Entropic Proofs of Singleton Bounds for Quantum Error-Correcting Codes”, IEEE Transactions on Information Theory 68, 3942 (2022) arXiv:2010.07902 DOI
[11]
A. Ashikhmin and E. Knill, “Nonbinary quantum stabilizer codes”, IEEE Transactions on Information Theory 47, 3065 (2001) DOI
[12]
A. Niehage, “Quantum Goppa Codes over Hyperelliptic Curves”, (2005) arXiv:quant-ph/0501074
Page edit log

Your contribution is welcome!

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

edit on this site

Zoo Code ID: qudits_into_qudits

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

Cite as:

“Modular-qudit code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/qudits_into_qudits

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/quantum/qudits/qudits_into_qudits.yml.