A family of permutationally invariant quantum codes

Arda Aydin1, Max A. Alekseyev2, and Alexander Barg1

1Department of ECE and Institute for Systems Research, University of Maryland, College Park, MD 20742
2Department of Mathematics, The George Washington University, Washington, DC 20052

Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.


We construct a new family of permutationally invariant codes that correct $t$ Pauli errors for any $t\ge 1$. We also show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction contains some of the previously known permutationally invariant quantum codes as particular cases, which also admit transversal gates. In many cases, the codes in the new family are shorter than the best previously known explicit permutationally invariant codes for Pauli errors and deletions. Furthermore, our new code family includes a new $((4,2,2))$ optimal single-deletion-correcting code. As a separate result, we generalize the conditions for permutationally invariant codes to correct $t$ Pauli errors from the previously known results for $t=1$ to any number of errors. For small $t$, these conditions can be used to construct new examples of codes by computer.

► BibTeX data

► References

[1] J. Berthomieu, C. Eder, and M. Safey El Din. msolve: A library for solving polynomial systems. In 2021 Int. Sympos. Symb. and Alg. Comput., Saint Petersburg, Russia, 2021. doi:10.1145/​3452143.3465545.

[2] S. Blundell. Magnetism in Condensed Matter. Oxford University Press, 2001.

[3] N. P. Breuckmann and S. Burton. Fold-transversal Clifford gates for quantum codes. arXiv:2202.06647. doi:10.48550/​ARXIV.2202.06647.

[4] M. Cheraghchi and J. Ribeiro. An overview of capacity results for synchronization channels. IEEE Trans. Inf. Theory, 67(6):3207–3232, 2020. doi:10.1109/​TIT.2020.2997329.

[5] I. L. Chuang, D. W. Leung, and Y. Yamamoto. Bosonic quantum codes for amplitude damping. Phys. Rev. A, 56:1114–1125, 1997. doi:10.1103/​PhysRevA.56.1114.

[6] R. H. Dicke. Coherence in spontaneous radiation processes. Phys. Rev., 93:99–110, 1954. doi:10.1103/​PhysRev.93.99.

[7] P. Flajolet and R. Sedgewick. Analytic Combinatorics. Cambridge University Press, 2009.

[8] J. A. Gross. Designing codes around interactions: The case of a spin. Phys. Rev. Lett., 127:010504, 2021. doi:10.1103/​PhysRevLett.127.010504.

[9] B. Haeupler and A. Shahrasbi. Synchronization strings and codes for insertions and deletions–A survey. IEEE Trans. Inf. Theory, 67(6):3190–3206, 2021. doi:10.1109/​TIT.2021.3056317.

[10] M. Hagiwara and A. Nakayama. A four-qubits code that is a quantum deletion error-correcting code with the optimal length. In 2020 IEEE International Symposium on Information Theory (ISIT), pages 1870–1874, 2020. doi:10.1109/​ISIT44484.2020.9174339.

[11] D. B. Hume, C. W. Chou, T. Rosenband, and D. J. Wineland. Preparation of Dicke states in an ion chain. Phys. Rev. A, 80:052302, 2009. doi:10.1103/​PhysRevA.80.052302.

[12] E. Knill and R. Laflamme. A theory of quantum error-correcting codes. Phys. Rev. A, 55:900–911, 1997. doi:10.1103/​PhysRevA.55.900.

[13] E. Kubischta and I. Teixeira. A family of quantum codes with exotic transversal gates, 2023. arXiv:2305.07023.

[14] E. Kubischta and I. Teixeira. The not-so-secret fourth parameter of quantum codes, 2023. arXiv:2310.17652.

[15] V. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady, 10(8):707–710, 1966.

[16] J. E. Moussa. Transversal Clifford gates on folded surface codes. Phys. Rev. A, 94:042316, 2016. doi:10.1103/​PhysRevA.94.042316.

[17] C. S. Mukherjee, S. Maitra, V. Gaurav, and D. Roy. On actual preparation of Dicke state on a quantum computer, 2020. arXiv:2007.01681.

[18] A. Nakayama and M. Hagiwara. The first quantum error-correcting code for single deletion errors. IEICE Communications Express, 9(4):100–104, 2020. doi:10.1587/​comex.2019XBL0154.

[19] A. Nakayama and M. Hagiwara. Single quantum deletion error-correcting codes. In 2020 International Symposium on Information Theory and Its Applications (ISITA), pages 329–333, 2020.

[20] M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2010. doi:10.1017/​CBO9780511976667.

[21] Y. Ouyang. Permutation-invariant quantum codes. Phys. Rev. A, 90:062317, 2014. doi:10.1103/​PhysRevA.90.062317.

[22] Y. Ouyang. Permutation-invariant quantum coding for quantum deletion channels. In 2021 IEEE International Symposium on Information Theory (ISIT), pages 1499–1503, 2021. doi:10.1109/​ISIT45174.2021.9518078.

[23] Y. Ouyang. Quantum storage in quantum ferromagnets. Phys. Rev. B, 103:144417, 2021. doi:10.1103/​PhysRevB.103.144417.

[24] Y. Ouyang and G. K. Brennen. Quantum error correction on symmetric quantum sensors, 2022. arXiv:2212.06285.

[25] Y. Ouyang and R. Chao. Permutation-invariant constant-excitation quantum codes for amplitude damping. IEEE Trans. Inf. Theory, 66(5):2921–2933, 2020. doi:10.1109/​TIT.2019.2956142.

[26] Y. Ouyang and W. H. Ng. Truncated quantum channel representations for coupled harmonic oscillators. Journal of Physics A: Mathematical and Theoretical, 46(20):205301, 2013. doi:10.1088/​1751-8113/​46/​20/​205301.

[27] O. Parzanchevski and P. Sarnak. Super-golden-gates for PU$(2)$. Advances in Mathematics, 327:869–901, 2018. doi:https:/​/​doi.org/​10.1016/​j.aim.2017.06.022.

[28] H. Pollatsek and M. B. Ruskai. Permutationally invariant codes for quantum error correction. Linear Alg. Appl., 392:255–288, 2004. doi:https:/​/​doi.org/​10.1016/​j.laa.2004.06.014.

[29] E. M. Rains. Quantum weight enumerators. IEEE Trans. Inf. Theory, 44(4):1388–1394, 1998. doi:10.1109/​18.681316.

[30] M. B. Ruskai. Pauli exchange and quantum error correction, 2000. arXiv quant-ph/​0006008.

[31] B. Schumacher. Sending entanglement through noisy quantum channels. Phys. Rev. A, 54:2614–2628, 1996. doi:10.1103/​PhysRevA.54.2614.

[32] T. Shibayama and M. Hagiwara. Permutation-invariant quantum codes for deletion errors. In 2021 IEEE International Symposium on Information Theory (ISIT), pages 1493–1498. IEEE, 2021.

[33] T. Shibayama and Y. Ouyang. The equivalence between correctability of deletions and insertions of separable states in quantum codes. In 2021 IEEE Information Theory Workshop (ITW), pages 1–6, 2021. doi:10.1109/​ITW48936.2021.9611450.

[34] P. W. Shor. Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A, 52:R2493–R2496, 1995. doi:10.1103/​PhysRevA.52.R2493.

[35] R. Varshamov and G. Tenengolts. Codes which correct single asymmetric errors. Automatika i Telemkhanika, 161(3):288–292, 1965. (in Russian).

[36] M. M. Wilde. Quantum Information Theory. Cambridge University Press, 2nd edition, 2017. doi:10.1017/​9781316809976.

Cited by

[1] Yingkai Ouyang, "A new take on permutation-invariant quantum codes", Quantum Views 8, 80 (2024).

[2] Eric Kubischta and Ian Teixeira, "The Not-So-Secret Fourth Parameter of Quantum Codes", arXiv:2310.17652, (2023).

[3] Yingkai Ouyang, "Robust projective measurements through measuring code-inspired observables", arXiv:2402.04093, (2024).

The above citations are from Crossref's cited-by service (last updated successfully 2024-05-26 12:23:51) and SAO/NASA ADS (last updated successfully 2024-05-26 12:23:52). The list may be incomplete as not all publishers provide suitable and complete citation data.

1 thought on “A family of permutationally invariant quantum codes

  1. Pingback: Perspective in Quantum Views by Yingkai Ouyang "A new take on permutation-invariant quantum codes"