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/0701037

Quantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller Codes

Salah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli

Published Jan 9, 2007• 22 citations
arXivHTMLPDF

Abstract

Convolutional stabilizer codes promise to make quantum communication more reliable with attractive online encoding and decoding algorithms. This paper introduces a new approach to convolutional stabilizer codes based on direct limit constructions. Two families of quantum convolutional codes are derived from generalized Reed-Solomon codes and from Reed- Muller codes. A Singleton bound for pure convolutional stabilizer codes is given.

DOI
10.48550/arxiv.quant-ph/0701037

Related papers

Quantum Convolutional Codes Derived from Generalized Reed-Solomon Codes

Salah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli

Convolutional stabilizer codes promise to make quantum communication more reliable with attractive online encoding and decoding algorithms. This paper introduces a new approach to convolutional stabilizer codes based on direct limit constructions. A quantum Singleton bound for pure convolutional stabilizer codes is given. A familiy of quantum convolutional codes is derived from generalized Reed-Solomon codes. These codes are shown to be optimal with respect to the (quantum) Singleton bound.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•10 citations

QuantumConvolutional Codes Derived from GeneralizedReed-Solomon Codes

Salah A. Aly, Andreas Klappenecker, Pradeep KiranSarvepalli

Convolutional stabilizer codespromise tomake quantumcommunication morereliable withattractive online encoding anddecoding algorithms. Thispaperintroduces anew approach toconvolutional stabilizer codesbasedondirect limit constructions. A quantumSingleton boundforpureconvolutional stabilizer codesisgiven. A familiy ofquantumconvolutional codesisderived fromgeneralized Reed-Solomon codes. These codesareshowntobeoptimal withrespect tothe(quantum) Singleton bound. I.INTRODUCTION A keyobstacle tothecommunication ofquantuminfor- mationisdecoherence, thespontaneous interaction ofthe environment withtheinformation-carrying quantumsystem. Theprotection ofquantuminformation withquantumerror- correcting codestoreduce orperhaps nearly eliminate the impact ofdecoherence hasledtoahighly developed theory of quantum error-correcting block codes. Somewhat surprisingly, quantum convolutional codeshavereceived less attention. Ollivier andTillich developed thestabilizer framework for quantumconvolutional codes, andaddressed encoding and decoding aspects ofsuchcodes(11), (12). Almediaand Palazzo constructed aconcatenated convolutional codeofrate 1/4withmemorym = 3(1). Forney andGuhaconstructed quantum convolutional codes withrate1/3(3). Also, inajoint workwithGrassl, theyderived rate(n- 2)/n convolutional stabilizer codes(2). Grassl andRotteler constructed quantum convolutional codesfromproduct codes(6), andtheygavea general algorithm toobtain non-catastrophic encoders (5). Inthis paper, wegiveanewapproach toquantum convo- lutional codes based onadirect limit construction, generalize someofthepreviously knownresults. We proveaSingleton boundforpureconvolutional stabilizer codes. We construct afamily ofquantumconvolutional codesbasedonclassical generalized Reed-Solomon codes. Thequantum convolutional codesderived fromthegeneralized Reed-Solomon codesare showntobeoptimal. ~~~~~~q 0< i<p.We canassociate tothegenerator matrix G(D)its semi-infinite coefficient matrix

•Jan 1, 2007•0 citations

New constructions of quantum MDS convolutional codes derived from generalized Reed-Solomon codes

Baokun Ding, Tao Zhang, Gennian Ge

Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. In this paper, we give two new constructions of quantum MDS convolutional codes derived from generalized Reed-Solomon codes and obtain eighteen new classes of quantum MDS convolutional codes. Most of them are new in the sense that the parameters of the codes are different from all the previously known ones.

arXiv:1511.01616•Nov 5, 2015•0 citations

New optimal quantum convolutional codes

Shixin Zhu, Liqi Wang, Xiaoshan Kai

One of the most challenges to prove the feasibility of quantum computers is to protect the quantum nature of information. Quantum convolutional codes are aimed at protecting a stream of quantum information in a long distance communication, which are the correct generalization to the quantum domain of their classical analogs. In this paper, we construct some classes of quantum convolutional codes by employing classical constacyclic codes. These codes are optimal in the sense that they attain the Singleton bound for pure convolutional stabilizer codes.

International Journal of Quantum Information•Apr 1, 2015•6 citations

量子 Reed-Müller 碼

鄭閔鴻

In this thesis, we start from the theory of classical error-correcting codes. We also introduce classical Reed-Muller codes along with its properties. We discuss the encoding and decoding methods for classical Reed-Muller codes using the majority rule. Then we turn to the topic of quantum error-correcting codes.We talk about stabilizer codes and discuss how classical Reed-Muller codes can be transformed into quantum Reed-Muller codes using Steane's method. Finally, we give a construction of a quantum code with parameter [[8,3,3]], and discuss its encoding and decoding process.

•Jan 1, 2011•0 citations

Quantum Codes: A Comprehensive Survey of Techniques, Challenges, and Future Directions

Istiak Mahmud, Ahmed Abdelhadi

Quantum error correction is fundamental to enabling reliable quantum computation and communication in the presence of noise and decoherence. Over the years, a diverse range of quantum coding strategies has been developed, each offering distinct approaches to mitigate quantum errors and achieve fault tolerance. This paper presents a comprehensive survey of major quantum code families, including stabilizer codes, topological codes, quantum LDPC codes, convolutional codes, turbo codes, Reed-Muller codes, continuous-variable bosonic codes, and subsystem codes. For each class, we discuss their construction principles, operational strategies, advantages, and inherent limitations. In addition to reviewing existing methodologies, we compare different coding techniques through structured tables and highlight the practical challenges that persist, such as resource overhead, decoding complexity, and scalability. Furthermore, we identify future research directions aimed at overcoming these challenges, including hybrid error correction approaches, machine learning-assisted decoders, and fault-tolerant architectures without magic state distillation. By consolidating the landscape of quantum error correction research, this work aims to serve as a foundational reference for researchers and practitioners working toward scalable, robust quantum technologies.

IEEE Access•Jan 1, 2025•5 citations
Convolutional stabilizer codes promise to make quantum communication more reliable with attractive online encoding and decoding algorithms. This paper introduces a new approach to convolutional stabilizer codes based on direct limit constructions. Two families of quantum convolutional codes are derived from generalized Reed-Solomon codes and from Reed- Muller codes. A Singleton bound for pure convolutional stabilizer codes is given.
Convolutional stabilizer codespromise tomake quantumcommunication morereliable withattractive online encoding anddecoding algorithms. Thispaperintroduces anew approach toconvolutional stabilizer codesbasedondirect limit constructions. A quantumSingleton boundforpureconvolutional stabilizer codesisgiven. A familiy ofquantumconvolutional codesisderived fromgeneralized Reed-Solomon codes. These codesareshowntobeoptimal withrespect tothe(quantum) Singleton bound. I.INTRODUCTION A keyobstacle tothecommunication ofquantuminfor- mationisdecoherence, thespontaneous interaction ofthe environment withtheinformation-carrying quantumsystem. Theprotection ofquantuminformation withquantumerror- correcting codestoreduce orperhaps nearly eliminate the impact ofdecoherence hasledtoahighly developed theory of quantum error-correcting block codes. Somewhat surprisingly, quantum convolutional codeshavereceived less attention. Ollivier andTillich developed thestabilizer framework for quantumconvolutional codes, andaddressed encoding and decoding aspects ofsuchcodes(11), (12). Almediaand Palazzo constructed aconcatenated convolutional codeofrate 1/4withmemorym = 3(1). Forney andGuhaconstructed quantum convolutional codes withrate1/3(3). Also, inajoint workwithGrassl, theyderived rate(n- 2)/n convolutional stabilizer codes(2). Grassl andRotteler constructed quantum convolutional codesfromproduct codes(6), andtheygavea general algorithm toobtain non-catastrophic encoders (5). Inthis paper, wegiveanewapproach toquantum convo- lutional codes based onadirect limit construction, generalize someofthepreviously knownresults. We proveaSingleton boundforpureconvolutional stabilizer codes. We construct afamily ofquantumconvolutional codesbasedonclassical generalized Reed-Solomon codes. Thequantum convolutional codesderived fromthegeneralized Reed-Solomon codesare showntobeoptimal. ~~~~~~q 0< i<p.We canassociate tothegenerator matrix G(D)its semi-infinite coefficient matrix
One of the most challenges to prove the feasibility of quantum computers is to protect the quantum nature of information. Quantum convolutional codes are aimed at protecting a stream of quantum information in a long distance communication, which are the correct generalization to the quantum domain of their classical analogs. In this paper, we construct some classes of quantum convolutional codes by employing classical constacyclic codes. These codes are optimal in the sense that they attain the Singleton bound for pure convolutional stabilizer codes.
In this thesis, we start from the theory of classical error-correcting codes. We also introduce classical Reed-Muller codes along with its properties. We discuss the encoding and decoding methods for classical Reed-Muller codes using the majority rule. Then we turn to the topic of quantum error-correcting codes.We talk about stabilizer codes and discuss how classical Reed-Muller codes can be transformed into quantum Reed-Muller codes using Steane's method. Finally, we give a construction of a quantum code with parameter [[8,3,3]], and discuss its encoding and decoding process.
Quantum error correction is fundamental to enabling reliable quantum computation and communication in the presence of noise and decoherence. Over the years, a diverse range of quantum coding strategies has been developed, each offering distinct approaches to mitigate quantum errors and achieve fault tolerance. This paper presents a comprehensive survey of major quantum code families, including stabilizer codes, topological codes, quantum LDPC codes, convolutional codes, turbo codes, Reed-Muller codes, continuous-variable bosonic codes, and subsystem codes. For each class, we discuss their construction principles, operational strategies, advantages, and inherent limitations. In addition to reviewing existing methodologies, we compare different coding techniques through structured tables and highlight the practical challenges that persist, such as resource overhead, decoding complexity, and scalability. Furthermore, we identify future research directions aimed at overcoming these challenges, including hybrid error correction approaches, machine learning-assisted decoders, and fault-tolerant architectures without magic state distillation. By consolidating the landscape of quantum error correction research, this work aims to serve as a foundational reference for researchers and practitioners working toward scalable, robust quantum technologies.