Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/9703045

Quantum Reed-Muller Codes

Zhang, Lin, Ian Fuss

Published Mar 24, 1997• 10 citations
arXivHTMLPDF

Abstract

This paper presents a set of quantum Reed-Muller codes which are typically 100 times more effective than existing quantum Reed-Muller codes.
DOI
10.48550/arxiv.quant-ph/9703045

Related papers

Quantum punctured Reed-Muller codes

Robin Sinurat, Khoirul Anwar, Muhammad Reza Kahar Aziz

AIP conference proceedings•Jan 1, 2023•2 citations

On Viterbi-like algorithms and their application to Reed–Muller codes

Yuansheng Tang, San Ling

Journal of Complexity•Mar 20, 2004•0 citations

Quantum Reed-Muller codes

Andrew M. Steane

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

arXiv:quant-ph/9608026•IEEE Transactions on Information Theory•Jul 1, 1999•175 citations

Asymmetric quantum Reed-Solomon and generalized Reed-Solomon codes

Giuliano G. La Guardia

Quantum Information Processing•Aug 2, 2011•58 citations

Quantum error-correcting codes from projective Reed–Muller codes and their hull variation problem

Diego Ruano, Rodrigo San–José

Long quantum codes using projective Reed–Muller codes are constructed. Projective Reed–Muller codes are evaluation codes obtained by evaluating homogeneous polynomials at the projective space. We obtain asymmetric and symmetric quantum codes by using the CSS construction and the Hermitian construction, respectively. We provide entanglement-assisted quantum error-correcting codes from projective Reed–Muller codes with flexible amounts of entanglement by considering equivalent codes. Moreover, we also construct quantum codes from subfield subcodes of projective Reed–Muller codes.

arXiv:2312.15308•Journal of Algebra and Its Applications•Feb 13, 2025•7 citations

Recursive List Decoding for Reed-Muller Codes and Their Subcodes

Ilya I. Dumer, Kirill Shabunov

Springer eBooks•Jan 1, 2002•8 citations
Long quantum codes using projective Reed–Muller codes are constructed. Projective Reed–Muller codes are evaluation codes obtained by evaluating homogeneous polynomials at the projective space. We obtain asymmetric and symmetric quantum codes by using the CSS construction and the Hermitian construction, respectively. We provide entanglement-assisted quantum error-correcting codes from projective Reed–Muller codes with flexible amounts of entanglement by considering equivalent codes. Moreover, we also construct quantum codes from subfield subcodes of projective Reed–Muller codes.