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

arXiv:2602.13638

A theory of quantum error correction for permutation-invariant codes

Yingkai Ouyang, Gavin K. Brennen

quant-phSubmitted Feb 14, 2026• Announced Feb 17, 2026• 13 citations
arXivHTMLPDF

Abstract

We present for the first time a general theory of error correction for permutation invariant (PI) codes. Using representation theory of the symmetric group we construct efficient algorithms that can correct any correctible error on any PI code. These algorithms involve measurements of total angular momentum, quantum Schur transforms or logical state teleportations, and geometric phase gates. For erasure errors, or more generally deletion errors, on certain PI codes, we give a simpler quantum error correction algorithm.

Comments
15 pages, 2 sides, split from the QEC part of 2212.06285v4, and improved with new algorithms

Related papers

Permutation-Invariant Quantum Codes for Deletion Errors

Taro Shibayama, Manabu Hagiwara

This paper presents conditions for constructing permutation-invariant quantum codes for deletion errors and provides a method for constructing them. Our codes include examples of quantum codes that can correct two or more deletion errors, which have not been studied before. We also give examples of quantum codes that can correct both multiple-qubit errors and multiple-deletion errors. We discuss a generalization of the construction of our codes at the end.

arXiv:2102.03015•IEEE International Symposium on Information Theory (ISIT)•Jul 12, 2021•20 citations

Permutation-invariant codes: a numerical study and qudit constructions

Liam J. Bond, Jiří Minář, Māris Ozols +2 more

We investigate Permutation-Invariant (PI) quantum error-correcting codes encoding a logical qudit of dimension $\mathrm{d}_\mathrm{L}$ in PI states using physical qudits of dimension $\mathrm{d}_\mathrm{P}$. We extend the Knill--Laflamme (KL) conditions for $d-1$ deletion errors from qubits to qudits and investigate numerically both qubit ($\mathrm{d}_\mathrm{L} = \mathrm{d}_\mathrm{P} = 2$) and qudit ($\mathrm{d}_\mathrm{L} > 2$ or $\mathrm{d}_\mathrm{P} > 2$) PI codes. We analyze the scaling of the block length $n$ in terms of the code distance $d$, and compare to existing families of PI codes due to Ouyang, Aydin--Alekseyev--Barg (AAB) and Pollatsek--Ruskai (PR). Our three main findings are: (i) We conjecture that qubit PI codes correcting up to $d-1$ deletion errors have block length $n(d) \geq (3d^2 + 1) / 4$, which implies an upper bound $d \leq \sqrt{12n-3}/3$ on their code distance, and that PR codes can saturate this bound. (ii) For qudit PI codes encoding a single qudit we numerically observe that increasing $\mathrm{d}_\mathrm{P}$ results in $n$ monotonically decreasing and approaching the quantum Singleton bound $n(d) \geq 2d-1$. (iii) We propose a semi-analytic extension of the qubit AAB construction to qudits that finds explicit solutions by solving a linear program. Our results therefore provide key insights into lower bounds on the block length scaling of both qubit and qudit PI codes, and demonstrate the benefit of increased physical local dimension in the context of PI codes.

quant-pharXiv:2603.10981•Mar 12, 2026•2 citations

The equivalence of quantum deletion and insertion errors on permutation-invariant codes

Lewis Bulled, Yingkai Ouyang

Quantum synchronisation errors are a class of errors that change the number of qubits in a quantum system. The classical error correction of synchronisation errors has been well-studied, including an insertion-deletion equivalence more than a half-century ago, but little progress has been made towards the quantum counterpart since the birth of quantum error correction. We address the longstanding problem of a quantum insertion-deletion equivalence on permutation-invariant codes, detailing the conditions under which such codes are $t$-insertion error-correctable. We extend these conditions to quantum insertion-deletion errors, formulating a more restrictive set of conditions under which permutation-invariant codes are $(t,s)$-insdel error-correctable. For completeness, we extend our approach to qudit errors on qudit permutation-invariant codes. Our work resolves many of the outstanding questions regarding the quantum error correction of synchronisation errors.

quant-pharXiv:2602.08780•npj Quantum Information•Feb 10, 2026•3 citations

Permutation-invariant codes:a numerical study and qudit constructions

Liam J. Bond, Jiří Minář, Māris Ozols +2 more

We investigate Permutation-Invariant (PI) quantum error-correcting codes encoding a logical qudit of dimension $\mathrm{d}_\mathrm{L}$ in PI states using physical qudits of dimension $\mathrm{d}_\mathrm{P}$. We extend the Knill--Laflamme (KL) conditions for $d-1$ deletion errors from qubits to qudits and investigate numerically both qubit ($\mathrm{d}_\mathrm{L} = \mathrm{d}_\mathrm{P} = 2$) and qudit ($\mathrm{d}_\mathrm{L} > 2$ or $\mathrm{d}_\mathrm{P} > 2$) PI codes. We analyze the scaling of the block length $n$ in terms of the code distance $d$, and compare to existing families of PI codes due to Ouyang, Aydin--Alekseyev--Barg (AAB) and Pollatsek--Ruskai (PR). Our three main findings are: (i) We conjecture that qubit PI codes correcting up to $d-1$ deletion errors have block length $n(d) \geq (3d^2 + 1) / 4$, which implies an upper bound $d \leq \sqrt{12n-3}/3$ on their code distance, and that PR codes can saturate this bound. (ii) For qudit PI codes encoding a single qudit we numerically observe that increasing $\mathrm{d}_\mathrm{P}$ results in $n$ monotonically decreasing and approaching the quantum Singleton bound $n(d) \geq 2d-1$. (iii) We propose a semi-analytic extension of the qubit AAB construction to qudits that finds explicit solutions by solving a linear program. Our results therefore provide key insights into lower bounds on the block length scaling of both qubit and qudit PI codes, and demonstrate the benefit of increased physical local dimension in the context of PI codes.

arXiv:2603.1098•Jan 1, 2026•0 citations

Recovery Algorithm for Correlated Errors in Permutation-Invariant Quantum Codes

Omprakash Chandra, Yingkai Ouyang, Gopikrishnan Muraleedharan +1 more

Quantum Error Recovery (QER) uses knowledge of the error channel acting on a quantum system to find optimal recovery maps. The scheme restores the uncorrupted state with a fidelity exceeding that achieved by noise parameter independent quantum error correction. We use a generic coherent QER map implemented with a quantum circuit acting on the system together with ancillary qubits to recover quantum information stored in permutation invariant (PI) codes. PI codes admit tunable parameters to suit the noise model and benefit from simple recovery operation circuits with reduced addressability requirements, unlike stabilizer codes. We showcase the method by modeling QER in PI codes after collective and local symmetric correlated amplitude-damping (AD) noise, a non-Pauli noise process for which stabilizer codes often require additional overhead. We also propose a new PI code family called CAD codes with explicit examples on 4 and 9 qubits for global symmetric AD errors. We show that CAD9 (supported on 9 qubits) code beats many existing codes by more than one order of magnitude. For the CAD4 code, which perfectly corrects 1 global symmetric AD error, the compiled recovery circuit consists of 10 system and system-ancilla gates which can be realized from linear geometric phase gates. Our work provides a direct path from optimized recovery maps to experimentally implementable, low-overhead protocols.

quant-pharXiv:2607.02346•Jul 3, 2026•1 citation

An angular momentum approach to quantum insertion errors

Lewis Bulled, Yingkai Ouyang

Quantum insertion errors are a class of errors that increase the number of qubits in a quantum system. Despite a wealth of research on classical insertion errors, there has been limited progress towards a general framework for correcting quantum insertion errors. We detail a quantum error correction protocol that can correct single insertion errors on a class of gapped permutation-invariant codes. We provide a simple two-stage syndrome extraction protocol that yields a two-bit syndrome, by measuring the total angular momentum and its projection along the $z$-axis (modulo the code gap) of the post-insertion state. We demonstrate that these measurements project the state onto a new codespace, and we detail a teleportation protocol to map the projected state back to a permutation-invariant code on the desired number of qubits.

arXiv:2509.03413•Sep 3, 2025•3 citations
We present for the first time a general theory of error correction for permutation invariant (PI) codes. Using representation theory of the symmetric group we construct efficient algorithms that can correct any correctible error on any PI code. These algorithms involve measurements of total angular momentum, quantum Schur transforms or logical state teleportations, and geometric phase gates. For erasure errors, or more generally deletion errors, on certain PI codes, we give a simpler quantum error correction algorithm.
We investigate Permutation-Invariant (PI) quantum error-correcting codes encoding a logical qudit of dimension dL\mathrm{d}_\mathrm{L}dL​ in PI states using physical qudits of dimension dP\mathrm{d}_\mathrm{P}dP​. We extend the Knill--Laflamme (KL) conditions for d−1d-1d−1 deletion errors from qubits to qudits and investigate numerically both qubit (dL=dP=2\mathrm{d}_\mathrm{L} = \mathrm{d}_\mathrm{P} = 2dL​=dP​=2) and qudit (dL>2\mathrm{d}_\mathrm{L} > 2dL​>2 or dP>2\mathrm{d}_\mathrm{P} > 2dP​>2) PI codes. We analyze the scaling of the block length nnn in terms of the code distance ddd, and compare to existing families of PI codes due to Ouyang, Aydin--Alekseyev--Barg (AAB) and Pollatsek--Ruskai (PR). Our three main findings are: (i) We conjecture that qubit PI codes correcting up to d−1d-1d−1 deletion errors have block length n(d)≥(3d2+1)/4n(d) \geq (3d^2 + 1) / 4n(d)≥(3d2+1)/4, which implies an upper bound d≤12n−3/3d \leq \sqrt{12n-3}/3d≤12n−3​/3 on their code distance, and that PR codes can saturate this bound. (ii) For qudit PI codes encoding a single qudit we numerically observe that increasing dP\mathrm{d}_\mathrm{P}dP​ results in nnn monotonically decreasing and approaching the quantum Singleton bound n(d)≥2d−1n(d) \geq 2d-1n(d)≥2d−1. (iii) We propose a semi-analytic extension of the qubit AAB construction to qudits that finds explicit solutions by solving a linear program. Our results therefore provide key insights into lower bounds on the block length scaling of both qubit and qudit PI codes, and demonstrate the benefit of increased physical local dimension in the context of PI codes.
Quantum synchronisation errors are a class of errors that change the number of qubits in a quantum system. The classical error correction of synchronisation errors has been well-studied, including an insertion-deletion equivalence more than a half-century ago, but little progress has been made towards the quantum counterpart since the birth of quantum error correction. We address the longstanding problem of a quantum insertion-deletion equivalence on permutation-invariant codes, detailing the conditions under which such codes are ttt-insertion error-correctable. We extend these conditions to quantum insertion-deletion errors, formulating a more restrictive set of conditions under which permutation-invariant codes are (t,s)(t,s)(t,s)-insdel error-correctable. For completeness, we extend our approach to qudit errors on qudit permutation-invariant codes. Our work resolves many of the outstanding questions regarding the quantum error correction of synchronisation errors.
We investigate Permutation-Invariant (PI) quantum error-correcting codes encoding a logical qudit of dimension dL\mathrm{d}_\mathrm{L}dL​ in PI states using physical qudits of dimension dP\mathrm{d}_\mathrm{P}dP​. We extend the Knill--Laflamme (KL) conditions for d−1d-1d−1 deletion errors from qubits to qudits and investigate numerically both qubit (dL=dP=2\mathrm{d}_\mathrm{L} = \mathrm{d}_\mathrm{P} = 2dL​=dP​=2) and qudit (dL>2\mathrm{d}_\mathrm{L} > 2dL​>2 or dP>2\mathrm{d}_\mathrm{P} > 2dP​>2) PI codes. We analyze the scaling of the block length nnn in terms of the code distance ddd, and compare to existing families of PI codes due to Ouyang, Aydin--Alekseyev--Barg (AAB) and Pollatsek--Ruskai (PR). Our three main findings are: (i) We conjecture that qubit PI codes correcting up to d−1d-1d−1 deletion errors have block length n(d)≥(3d2+1)/4n(d) \geq (3d^2 + 1) / 4n(d)≥(3d2+1)/4, which implies an upper bound d≤12n−3/3d \leq \sqrt{12n-3}/3d≤12n−3​/3 on their code distance, and that PR codes can saturate this bound. (ii) For qudit PI codes encoding a single qudit we numerically observe that increasing dP\mathrm{d}_\mathrm{P}dP​ results in nnn monotonically decreasing and approaching the quantum Singleton bound n(d)≥2d−1n(d) \geq 2d-1n(d)≥2d−1. (iii) We propose a semi-analytic extension of the qubit AAB construction to qudits that finds explicit solutions by solving a linear program. Our results therefore provide key insights into lower bounds on the block length scaling of both qubit and qudit PI codes, and demonstrate the benefit of increased physical local dimension in the context of PI codes.
Quantum Error Recovery (QER) uses knowledge of the error channel acting on a quantum system to find optimal recovery maps. The scheme restores the uncorrupted state with a fidelity exceeding that achieved by noise parameter independent quantum error correction. We use a generic coherent QER map implemented with a quantum circuit acting on the system together with ancillary qubits to recover quantum information stored in permutation invariant (PI) codes. PI codes admit tunable parameters to suit the noise model and benefit from simple recovery operation circuits with reduced addressability requirements, unlike stabilizer codes. We showcase the method by modeling QER in PI codes after collective and local symmetric correlated amplitude-damping (AD) noise, a non-Pauli noise process for which stabilizer codes often require additional overhead. We also propose a new PI code family called CAD codes with explicit examples on 4 and 9 qubits for global symmetric AD errors. We show that CAD9 (supported on 9 qubits) code beats many existing codes by more than one order of magnitude. For the CAD4 code, which perfectly corrects 1 global symmetric AD error, the compiled recovery circuit consists of 10 system and system-ancilla gates which can be realized from linear geometric phase gates. Our work provides a direct path from optimized recovery maps to experimentally implementable, low-overhead protocols.
Quantum insertion errors are a class of errors that increase the number of qubits in a quantum system. Despite a wealth of research on classical insertion errors, there has been limited progress towards a general framework for correcting quantum insertion errors. We detail a quantum error correction protocol that can correct single insertion errors on a class of gapped permutation-invariant codes. We provide a simple two-stage syndrome extraction protocol that yields a two-bit syndrome, by measuring the total angular momentum and its projection along the zzz-axis (modulo the code gap) of the post-insertion state. We demonstrate that these measurements project the state onto a new codespace, and we detail a teleportation protocol to map the projected state back to a permutation-invariant code on the desired number of qubits.