Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A new take on permutation-invariant quantum codes

Yingkai Ouyang

Published May 13, 2024• 2 citations
Publisher
DOI
10.22331/qv-2024-05-13-80

Related papers

Permutationally invariant codes for quantum error correction

Harriet Pollatsek, Mary Beth Ruskai

arXiv:quant-ph/0304153•Linear Algebra and its Applications•Aug 17, 2004•64 citations

A family of permutationally invariant quantum codes

Arda Aydin, Max A. Alekseyev, Alexander Barg

We construct a new family of permutationally invariant codes that correct t Pauli errors for any t≥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.

arXiv:2310.05358•Quantum•Apr 30, 2024•28 citations

A Family of Permutationally Invariant Quantum Codes

Arda Aydin, Max A. Alekseyev, Alexander Barg

We construct a new family of permutationally in-variant codes that correct$t$Pauli errors for any$t\geqslant 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. 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. This is an extended abstract of the preprint [1].

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•0 citations

New Quantum Codes Derived from Cyclic Codes

Binbin Pang, Shixin Zhu, Jin Li +1 more

International Journal of Theoretical Physics•Jan 21, 2020•4 citations

New quantum codes from two linear codes

Xiusheng Liu, Peng Hu

Quantum Information Processing•Jan 11, 2020•30 citations

Minimal Permutation-Invariant Qudit Codes from Edge-Colorings of Complete Graphs

Eric Kubischta, Ian Teixeira

We study permutation-invariant quantum codes in the symmetric subspace $\mathrm{Sym}^n(\mathbb{C}^q) $ of $n$ qudits of local dimension $q$. For every integer $q\geq 2$, we construct a permutation-invariant code with parameters $((4,q,2))_q$. Thus four physical qudits suffice to encode one logical qudit with distance two in the symmetric sector for every local dimension. We also show, using linear-programming constraints for permutation-invariant quantum codes, that no permutation-invariant code of dimension $q$ and distance at least $2$ exists in $\mathrm{Sym}^n(\mathbb{C}^q)$ for $n\leq 3$. Hence four qudits are necessary and sufficient. The construction has a simple representation-theoretic and combinatorial description. In the irreducible $\mathrm{SU}(q)$-module $\mathrm{Sym}^4(\mathbb{C}^q)$, the distance-two Knill-Laflamme conditions split into root and Cartan parts. By restricting supports to the even-entry occupation layer, all root-error conditions vanish automatically. The remaining Cartan conditions reduce to linear balancing constraints on packets of occupation vectors. These packets admit a natural graph-theoretic interpretation in terms of the vertices and edges of the complete graph $K_q$: for odd $q$, they are organized by the midpoint rule, while for even $q$, they are organized by a decomposition of $K_q$ into perfect matchings. In this way, the existence of minimal $((4,q,2))_q$ permutation-invariant codes is reduced to a parity-dependent edge-coloring problem on $K_q$.

quant-pharXiv:2605.22439•May 22, 2026•0 citations
We construct a new family of permutationally invariant codes that correct t Pauli errors for any t≥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.
We construct a new family of permutationally in-variant codes that correcttttPauli errors for anyt⩾1t\geqslant 1t⩾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. 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. This is an extended abstract of the preprint [1].
We study permutation-invariant quantum codes in the symmetric subspace $\mathrm{Sym}^n(\mathbb{C}^q) $ of nnn qudits of local dimension qqq. For every integer q≥2q\geq 2q≥2, we construct a permutation-invariant code with parameters ((4,q,2))q((4,q,2))_q((4,q,2))q​. Thus four physical qudits suffice to encode one logical qudit with distance two in the symmetric sector for every local dimension. We also show, using linear-programming constraints for permutation-invariant quantum codes, that no permutation-invariant code of dimension qqq and distance at least 222 exists in Symn(Cq)\mathrm{Sym}^n(\mathbb{C}^q)Symn(Cq) for n≤3n\leq 3n≤3. Hence four qudits are necessary and sufficient. The construction has a simple representation-theoretic and combinatorial description. In the irreducible SU(q)\mathrm{SU}(q)SU(q)-module Sym4(Cq)\mathrm{Sym}^4(\mathbb{C}^q)Sym4(Cq), the distance-two Knill-Laflamme conditions split into root and Cartan parts. By restricting supports to the even-entry occupation layer, all root-error conditions vanish automatically. The remaining Cartan conditions reduce to linear balancing constraints on packets of occupation vectors. These packets admit a natural graph-theoretic interpretation in terms of the vertices and edges of the complete graph KqK_qKq​: for odd qqq, they are organized by the midpoint rule, while for even qqq, they are organized by a decomposition of KqK_qKq​ into perfect matchings. In this way, the existence of minimal ((4,q,2))q((4,q,2))_q((4,q,2))q​ permutation-invariant codes is reduced to a parity-dependent edge-coloring problem on KqK_qKq​.