Qudit GNU permutation-invariant code[1] 

Description

Extension of the GNU permutation-invariant codes to those encoding logical qudits. 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 permutation-invariant codes.

Parents

Child

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 permutation-invariant 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 permutation-invariant 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 permutation-invariant 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/spins/transversal/qudit_gnu_permutation_invariant.yml.