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.Member of code lists
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
- Victor V. Albert (2024-02-12) — most recent
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