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:2509.03413

An angular momentum approach to quantum insertion errors

Lewis Bulled, Yingkai Ouyang

Published Sep 3, 2025• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2509.03413

Related papers

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

A theory of quantum error correction for permutation-invariant codes

Yingkai Ouyang, Gavin K. Brennen

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.

quant-pharXiv:2602.13638•Feb 17, 2026•13 citations

A Generalization of the Four Qubits Single Insertion Error-Correcting Code

Taro Shibayama

The first quantum insertion code is the four qubits code given by Hagiwara in 2021. Since then, several quantum insertion codes have been proposed, but they are all unrelated to Hagiwara's four qubits code. This article provides a new class of quantum single insertion codes that include the Hagiwara code. Furthermore, this construction gives a new decoder for insertion errors in the Hagiwara codes.

IEICE Communications Express•Feb 16, 2024•0 citations

Initializing a permutation-invariant quantum error-correction code

Chunfeng Wu, Yimin Wang, Chu Guo +3 more

Recently, there has been growing interest in using quantum error correction in practical devices. A central issue in quantum error correction is the initialization of quantum data into a quantum error-correction code. Most studies have concentrated on generating quantum codes based on their encoding quantum circuits. However, this often leads to a large number of steps required in the initialization, and hence this process can be prone to errors. The purpose of this work is to demonstrate that permutation-invariant quantum error-correction codes can be created with high fidelity by exploiting their underlying symmetry. The code is initialized on multiple qubits that mutually interact or are themselves coupled to a quantum harmonic oscillator. We show that the so-called selective resonant interaction is derivable on such physical systems. By utilizing the selective resonant interaction, these highly symmetric codes may be rapidly generated with excellent fidelity. We also discuss the potential of initializing permutation-invariant quantum error-correction codes based on the state-of-art experimental techniques.

Physical Review A•Jan 22, 2019•13 citations

Permutation-invariant codes encoding more than one qubit

Yingkai Ouyang, Joseph F. Fitzsimons

A permutation-invariant code on $m$ qubits is a subspace of the symmetric subspace of the $m$ qubits. We derive permutation-invariant codes that can encode an increasing amount of quantum information while suppressing leading-order spontaneous decay errors. To prove the result, we use elementary number theory with prior theory on permutation-invariant codes and quantum error correction.

arXiv:1512.02469•Physical Review A•Apr 26, 2016•41 citations

Approximate Error Correction for Quantum Simulations of SU(2) Lattice Gauge Theories

Zachary P. Bradshaw

We present a protocol for actively suppressing Gauss law violations in quantum simulations of SU(2) lattice gauge theory. Mid-circuit measurements extract a syndrome $(J,M,N)$ characterising the gauge-violation sector at each vertex by resolving both the total angular momentum and the magnetic quantum numbers of the violation through a group quantum Fourier transform. A syndrome-conditional recovery operation maps the state back to the gauge-invariant subspace, and the procedure is iterated as a sweep over vertices in a process we call gauge cooling. We prove that every single-qubit Pauli error at a coordination-four vertex with four spin-$1/2$ edges is detected by the gauge syndrome, and we show that the Knill--Laflamme conditions fail for syndrome-based recovery alone whenever the singlet multiplicity exceeds one. The residual physical-subspace errors carry a structured Pauli decomposition with vanishing $Y$ component, which suggests compatibility with concatenation by a CSS stabilizer code. We demonstrate the protocol on a single-plaquette simulation of the Kogut--Susskind Hamiltonian truncated to the spin-$1/2$ representation under depolarising and amplitude damping noise, and we observe that gauge cooling restores approximate gauge invariance and improves fidelity at noise rates representative of current superconducting hardware.

quant-pharXiv:2603.26819•Physical Review A•Mar 30, 2026•3 citations
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.
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 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.
Recently, there has been growing interest in using quantum error correction in practical devices. A central issue in quantum error correction is the initialization of quantum data into a quantum error-correction code. Most studies have concentrated on generating quantum codes based on their encoding quantum circuits. However, this often leads to a large number of steps required in the initialization, and hence this process can be prone to errors. The purpose of this work is to demonstrate that permutation-invariant quantum error-correction codes can be created with high fidelity by exploiting their underlying symmetry. The code is initialized on multiple qubits that mutually interact or are themselves coupled to a quantum harmonic oscillator. We show that the so-called selective resonant interaction is derivable on such physical systems. By utilizing the selective resonant interaction, these highly symmetric codes may be rapidly generated with excellent fidelity. We also discuss the potential of initializing permutation-invariant quantum error-correction codes based on the state-of-art experimental techniques.
A permutation-invariant code on mmm qubits is a subspace of the symmetric subspace of the mmm qubits. We derive permutation-invariant codes that can encode an increasing amount of quantum information while suppressing leading-order spontaneous decay errors. To prove the result, we use elementary number theory with prior theory on permutation-invariant codes and quantum error correction.
We present a protocol for actively suppressing Gauss law violations in quantum simulations of SU(2) lattice gauge theory. Mid-circuit measurements extract a syndrome (J,M,N)(J,M,N)(J,M,N) characterising the gauge-violation sector at each vertex by resolving both the total angular momentum and the magnetic quantum numbers of the violation through a group quantum Fourier transform. A syndrome-conditional recovery operation maps the state back to the gauge-invariant subspace, and the procedure is iterated as a sweep over vertices in a process we call gauge cooling. We prove that every single-qubit Pauli error at a coordination-four vertex with four spin-1/21/21/2 edges is detected by the gauge syndrome, and we show that the Knill--Laflamme conditions fail for syndrome-based recovery alone whenever the singlet multiplicity exceeds one. The residual physical-subspace errors carry a structured Pauli decomposition with vanishing YYY component, which suggests compatibility with concatenation by a CSS stabilizer code. We demonstrate the protocol on a single-plaquette simulation of the Kogut--Susskind Hamiltonian truncated to the spin-1/21/21/2 representation under depolarising and amplitude damping noise, and we observe that gauge cooling restores approximate gauge invariance and improves fidelity at noise rates representative of current superconducting hardware.