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

Discrete Mathematics

Nonbinary quantum error-correcting codes from algebraic curves

Jon-Lark Kim, Judy L. Walker

Published Dec 4, 2007• 31 citations
Publisher
DOI
10.1016/j.disc.2007.08.038

Related papers

Quantum computing, error correcting quantum codes and algebraic curves

Artur Elezi

ACM communications in computer algebra•Aug 14, 2015•0 citations

Nonbinary Quantum Codes from Hermitian Curves

Pradeep Kiran Sarvepalli, Andreas Klappenecker

Lecture notes in computer science•Jan 1, 2006•8 citations

Quantum Error-Correcting Codes from Algebraic Curves

Jon-Lark Kim, Gretchen L. Matthews

This chapter discusses quantum error-correcting codes constructed from algebraic curves. We give an introduction to quantum coding theory including bounds on quantum codes. We describe stabilizer codes which are the quantum analog of classical linear codes and discuss the binary and q-ary CSS construction. Then we focus on quantum codes from algebraic curves including the projective line, Hermitian curves, and hyperelliptic curves. In addition, we describe the asymptotic behaviors of quantum codes from the Garcia-Stichtenoth tower attaining the Drinfeld-Vlăduţ bound.

Series on coding theory and cryptology•Oct 1, 2008•14 citations

Threshold analysis with fault-tolerant operations for nonbinary quantum error correcting codes

Aparna Kanungo

Quantum error correcting codes have been introduced to encode the data bits\nin extra redundant bits in order to accommodate errors and correct them. However,\ndue to the delicate nature of the quantum states or faulty gate operations, there is\na possibility of catastrophic spread of errors which might render the error correction\ntechniques ineffective. Hence, in this thesis we concentrate on how various operations\ncan be carried out fault-tolerantly so that the errors are not propagated in the same\nblock. We prove universal fault-tolerance for nonbinary CSS codes. This thesis is\nfocussed only on nonbinary quantum codes and all the results pertain to nonbinary\ncodes.\nEfficient error detection and correction techniques using fault-tolerant techniques\ncan help as long as we ensure that the gate error probability is below a certain\nthreshold. The calculation of this threshold is therefore important to see if quantum\ncomputations are realizable or not, even with fault-tolerant operations. We derive an\nexpression to compute the gate error threshold for nonbinary quantum codes and test\nthis result for different classes of codes, to get codes with best threshold results.

•Nov 1, 2005•0 citations

A New Nonbinary Quasi-cyclic LDPC Codes Construction Algorithm

Tong Ningning -, WU Yu-ping

An algorithm for constructing nonbinary Quasi-cyclic LDPC (QC-LDPC) codes on the basis of masking and puncturing techniques in consideration of the shortage of algebraic construction algorithm and time-varying performance of wireless channels is proposed . This scheme can reduce the complexity of the hardware implementation, enhance the error correction performance of the LDPC codes constructed by structure algorithm based on masking technology, and improve the average effectiveness of the communication system by realizing a rate-compatible encoding based on puncturing technology. The simulation results show that the nonbinary LDPC codes constructed with masking and puncturing techniques can provide significantly stronger error correction capabilities as compared with those constructed with algebraic method which are used directly.

International Journal of Advancements in Computing Technology•Apr 30, 2013•3 citations

The mathematics of error correcting quantum codes

Kalyanapuram Rangachari Parthasarathy

Resonance•Mar 1, 2001•2 citations
This chapter discusses quantum error-correcting codes constructed from algebraic curves. We give an introduction to quantum coding theory including bounds on quantum codes. We describe stabilizer codes which are the quantum analog of classical linear codes and discuss the binary and q-ary CSS construction. Then we focus on quantum codes from algebraic curves including the projective line, Hermitian curves, and hyperelliptic curves. In addition, we describe the asymptotic behaviors of quantum codes from the Garcia-Stichtenoth tower attaining the Drinfeld-Vlăduţ bound.
Quantum error correcting codes have been introduced to encode the data bits\nin extra redundant bits in order to accommodate errors and correct them. However,\ndue to the delicate nature of the quantum states or faulty gate operations, there is\na possibility of catastrophic spread of errors which might render the error correction\ntechniques ineffective. Hence, in this thesis we concentrate on how various operations\ncan be carried out fault-tolerantly so that the errors are not propagated in the same\nblock. We prove universal fault-tolerance for nonbinary CSS codes. This thesis is\nfocussed only on nonbinary quantum codes and all the results pertain to nonbinary\ncodes.\nEfficient error detection and correction techniques using fault-tolerant techniques\ncan help as long as we ensure that the gate error probability is below a certain\nthreshold. The calculation of this threshold is therefore important to see if quantum\ncomputations are realizable or not, even with fault-tolerant operations. We derive an\nexpression to compute the gate error threshold for nonbinary quantum codes and test\nthis result for different classes of codes, to get codes with best threshold results.
An algorithm for constructing nonbinary Quasi-cyclic LDPC (QC-LDPC) codes on the basis of masking and puncturing techniques in consideration of the shortage of algebraic construction algorithm and time-varying performance of wireless channels is proposed . This scheme can reduce the complexity of the hardware implementation, enhance the error correction performance of the LDPC codes constructed by structure algorithm based on masking technology, and improve the average effectiveness of the communication system by realizing a rate-compatible encoding based on puncturing technology. The simulation results show that the nonbinary LDPC codes constructed with masking and puncturing techniques can provide significantly stronger error correction capabilities as compared with those constructed with algebraic method which are used directly.