REVIEW 2 cited by
Quantum Deletion Codes Derived From Quantum Reed-Solomon Codes
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
Quantum Deletion Codes Derived From Quantum Reed-Solomon Codes
read the original abstract
This manuscript presents a construction method for quantum codes capable of correcting multiple deletion errors. By introducing two new alogorithms, the alternating sandwich mapping and the block error locator, the proposed method reduces deletion error correction to erasure error correction. Unlike previous quantum deletion error-correcting codes, our approach enables flexible code rates and eliminates the requirement of knowing the number of deletions.
Forward citations
Cited by 2 Pith papers
-
Microscopic Side Information Controls Ordered Hayden--Preskill Recovery
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.
-
Decoding Algorithm to Composite Errors Consisting of Deletions and Insertions for Quantum Deletion-Correcting Codes Based on Quantum Reed-Solomon Codes
A decoding algorithm is provided for composite deletion-insertion errors in quantum deletion-correcting codes based on quantum Reed-Solomon codes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.