REVIEW 4 cited by
Codes for the Quantum Erasure Channel
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
read the original abstract
The quantum erasure channel (QEC) is considered. Codes for the QEC have to correct for erasures, i. e., arbitrary errors at known positions. We show that four qubits are necessary and sufficient to encode one qubit and correct one erasure, in contrast to five qubits for unknown positions. Moreover, a family of quantum codes for the QEC, the quantum BCH codes, that can be efficiently decoded is introduced.
Forward citations
Cited by 4 Pith papers
-
Approximate Quantum Error Correction at Chiral Topological Edges
Chiral edge codes have local-erasure robustness governed by power-law exponents with hierarchy γ≥α≥min{α,β}, so the 2D code is at least as robust as its 1D CFT reduction.
-
Fault-tolerant quantum computation with a neutral atom processor
A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.
-
Quantum Error Correction Codes for Truncated SU(2) Lattice Gauge Theories
Gauss's law constraints in jmax=1/2 SU(2) lattice gauge theory are converted into stabilizer codes that correct single-qubit errors using about 9N or 12N physical qubits per N plaquettes.
-
The limits of erasure-based postselection for quantum error mitigation
Postselection on erasure qubits fully mitigates erasure noise in QFT for erasure-check error rates below 3% and enables dual-rail systems to exceed noise floors unreachable by single-rail at kiloquop scale.
Discussion (0). Continue with ORCID to comment.