Quantum Reed-Muller Codes

1996/08/16 by Andrew Steane, Steane, Andrew · 1 citation
Computer Science · Physics and Astronomy · #Coding theory and cryptography #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata #quant-ph

paper · pdf · doi:10.48550/arxiv.quant-ph/9608026

9 pages LaTeX. Replaced version corrects an important oversight. Further information at http://eve.physics.ox.ac.uk/ASGhome.html

openalex publication_date 1996/08/16 · arxiv created 1996/08/22 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A set of quantum error correcting codes based on classical Reed-Muller codes is described. The codes have parameters [[n,k,d]] = [[2^r, 2^r - C(r,t) - 2 sum_i=0^t-1 C(r,i), 2^t + 2^t-1 ]].

Citations

• Good Quantum Error-Correcting Codes Exist

Cited by

• Magic state distillation without measurements and post-selection

Related

• Quantum Reed-Muller Codes
• Reed-Muller Codes on CQ Channels via a New Correlation Bound for Quantum Observables
• Coxeter codes: Extending the Reed-Muller family
• Constructing quantum error-correcting codes for p^m-state systems from classical error-correcting codes
• Enlargement of Calderbank Shor Steane quantum codes