The equivalence between correctability of deletions and insertions of separable states in quantum codes

Abstract

In this paper, we prove the equivalence of inserting separable quantum states and deletions. Hence any quantum code that corrects deletions automatically corrects separable insertions. First, we describe the quantum insertion/deletion error using the Kraus operators. Next, we develop an algebra for commuting Kraus operators corresponding to insertions and deletions. Using this algebra, we prove the equivalence between quantum insertion codes and quantum deletion codes using the Knill-Laflamme conditions.

arXiv comment15 pages, 2 figures

References in corpus (10)

• Permutation-invariant quantum codes
• Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound
• Permutation-invariant qudit codes from polynomials
• Permutation-invariant constant-excitation quantum codes for amplitude damping
• Permutation-invariant codes encoding more than one qubit
• Quantum storage in quantum ferromagnets
• Permutation-invariant quantum coding for quantum deletion channels
• Permutation-Invariant Quantum Codes for Deletion Errors
• Single Quantum Deletion Error-Correcting Codes
• Robust quantum metrology with explicit symmetric states