The equivalence of quantum deletion and insertion errors on permutation-invariant codes
Lewis Bulled, Yingkai Ouyang

TL;DR
This paper establishes the conditions under which permutation-invariant quantum codes can correct insertion and deletion errors, advancing the understanding of quantum synchronization error correction.
Contribution
It provides the first detailed conditions for quantum insertion-deletion error correction on permutation-invariant codes, addressing a longstanding open problem.
Findings
Conditions for $t$-insertion error correction are derived.
Extended conditions for quantum insdel errors are formulated.
The work resolves key questions in quantum error correction of synchronization errors.
Abstract
Quantum synchronisation errors are a class of quantum 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 -insertion error-correctable. We extend these conditions to quantum insdel errors, formulating a more restrictive set of conditions under which permutation-invariant codes are -insdel error-correctable. Our work resolves many of the outstanding questions regarding the quantum error correction of synchronisation errors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · DNA and Biological Computing
