Pith. sign in

REVIEW 3 cited by

Quantum Insertion-Deletion Channels

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1901.00984 v1 pith:DXTWENUQ submitted 2019-01-04 quant-ph cs.DS

Quantum Insertion-Deletion Channels

classification quant-ph cs.DS
keywords quantumerrorschannelscorruptioninsdeltheycodeserror-correcting
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We introduce a model of quantum insertion-deletion (insdel) channels. Insdel channels are meant to represent, for example, synchronization errors arising in data transmission. In the classical setting, they represent a strict generalization of the better-understood corruption error channels, and until recently, had mostly resisted effort toward a similar understanding as their corruption counterparts. They have received considerable attention in recent years. Very recently, Haeupler and Shahrasbi developed a framework, using what they call synchronisation strings, that allows one to turn insdel-type errors into corruption-type errors. These can then be handled by the use of standard error-correcting codes. We show that their framework can be extended to the quantum setting, providing a way to turn quantum insdel errors into quantum corruption errors, which can be handled with standard quantum error-correcting codes.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Microscopic Side Information Controls Ordered Hayden--Preskill Recovery

    quant-ph 2026-07 conditional novelty 7.0

    Without microscopic position labels, Hayden–Preskill recovery of a fixed diary requires Θ(n^{2/3}) output qubits; coarse block labels reduce this to n^{2/3}B^{-1/3} or n/B.

  2. Qubit Loss Inference with Stabilizer Codes without Leakage Detection Units

    quant-ph 2026-07 conditional novelty 6.0

    Loss locations can be inferred from repeated stabilizer syndrome data alone when punctured stabilizer checks anticommute, matching or beating noisy LDU-based correction at low loss rates.

  3. Decoding Algorithm to Composite Errors Consisting of Deletions and Insertions for Quantum Deletion-Correcting Codes Based on Quantum Reed-Solomon Codes

    cs.IT 2026-05 unverdicted novelty 6.0

    A decoding algorithm is provided for composite deletion-insertion errors in quantum deletion-correcting codes based on quantum Reed-Solomon codes.