arXiv (All)
open access
Insertion Correcting Capability for Quantum Deletion-Correcting Codes
It is conjectured that a quantum code $C$ corrects $t$ deletion errors if and only if $C$ corrects a total of $t$ insertion and deletion errors. Although this conjecture has been proved only under certain conditions, it has not been proved in general. In this paper, we prove this conjecture for gene
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Elevator Codes: Concatenation for resource-efficient quantum memory under biased noise#1050804
- On the relation between A-codes and codes correcting independent errors#1107271
- Lower Bounds for all List-Decodable Deletion Codes#1062537
- Error Correction Properties of Covariant Bosonic Encodings#1062547
- Quantum Pseudorandom Error-Correcting Codes#1143953
Record · ID 1388338
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive