REVIEW 5 cited by
Quantum BCH 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
Signed reviews
read the original abstract
After a brief introduction to both quantum computation and quantum error correction, we show how to construct quantum error-correcting codes based on classical BCH codes. With these codes, decoding can exploit additional information about the position of errors. This error model - the quantum erasure channel - is discussed. Finally, parameters of quantum BCH codes are provided.
Forward citations
Cited by 5 Pith papers
-
Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates
High-rate self-dual quantum Reed–Muller codes admit ancilla-free addressable Clifford gates generated by transversal H and fold-transversal phase gates.
-
LDGM-Based Quantum Codes for Fault-Tolerant Quantum Computation
A rate-1/4 CSS construction from row-compressed LDGM matrices, decoded by correlation-aware belief propagation and tuned by discrete density evolution, gives low-weight logical operators with simulated depolarizing th...
-
Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry
A symmetry-leveraging framework for fault-tolerant ancilla preparation in quantum BCH codes yields lower spatial overhead and logical error rates than standard distillation in simulations up to 127 qubits.
-
QEC and EAQEC Codes from Hermitian Sums and Hulls of Cyclic Codes over $\mathbb{F}_2 \times (\mathbb{F}_2+v\mathbb{F}_2)$
Generator polynomials for Hermitian hulls and sums of cyclic codes over F2 × (F2 + vF2) yield QEC codes via Hermitian Construction X and EAQEC codes via matrix-product methods on LCD codes.
-
Fire and ice: Partially fault-tolerant quantum computing with selective state filtering
Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.
Discussion (0). Continue with ORCID to comment.