[Jump to code hierarchy]

Qudit GNU PI code[1]

Description

Extension of the GNU PI codes to those encoding logical qudits into physical qubits. Codewords can be expressed as superpositions of Dicke states with coefficients are square-roots of polynomial coefficients, with the case of binomial coefficients reducing to the GNU PI codes.

Primary Hierarchy

Parents
Qudit GNU PI codes protect against AD errors.
Qudit GNU PI code
Children
Qudit GNU codes encoding logical qubits reduce to GNU codes.

References

[1]
Y. Ouyang, “Permutation-invariant qudit codes from polynomials”, Linear Algebra and its Applications 532, 43 (2017) arXiv:1604.07925 DOI
Page edit log

Your contribution is welcome!

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

edit on this site

Zoo Code ID: qudit_gnu_permutation_invariant

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

Cite as:

“Qudit GNU PI code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/qudit_gnu_permutation_invariant

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/quantum/qubits/permutation_invariant/gnu/qudit_gnu_permutation_invariant.yml.