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

AIP conference proceedings

Construction of Quantum Error Correcting Code for Specific Position Errors

Shogo Usami

Published Jan 1, 2004• 0 citations
Publisher

Abstract

Quantum error correcting codes for specific position errors, which are a different type from ordinary quantum error correcting codes, are proposed. The quantum Hamming bound is modified to apply to such codes. Furthermore, an example of the code which breaks the modified quantum Hamming bound is shown.
DOI
10.1063/1.1834413

Related papers

Class of quantum error-correcting codes saturating the quantum Hamming bound

Daniel Gottesman

I develop methods for analyzing quantum error-correcting codes, and use these methods to construct an infinite class of codes saturating the quantum Hamming bound. These codes encode k=n-j-2 quantum bits (qubits) in n=${2}^{\mathit{j}}$ qubits and correct t=1 error. \textcopyright{} 1996 The American Physical Society.

arXiv:quant-ph/9604038•Physical Review A•Sep 1, 1996•1,266 citations

Upper bounds on the size of quantum codes

Alexei Ashikhmin, Simon N. Litsyn

Upper bounds on the size of quantum error correcting codes are considered. We generalize the linear programming approach to the quantum case and obtain the Singleton, Hamming and first linear programming type bounds for quantum codes.

IEEE International Symposium on Information Theory (ISIT)•Nov 27, 2002•3 citations

Approximate quantum error correction can lead to better codes

Debbie Leung, Michael A. Nielsen, Isaac L. Chuang +1 more

We present relaxed criteria for quantum error correction that are useful when the specific dominant quantum noise process is known. As an example, we provide a four-bit code that corrects for a single amplitude damping error. This code violates the usual Hamming bound calculated for a Pauli description of the error process and has no simple explanation in terms of the usual Pauli basis GF(4) codes.

arXiv:quant-ph/9704002•Physical Review A•Oct 1, 1997•233 citations

Quantum Backup Protocol by Using Quantum Error Correcting Code for Specific Position Errors

Hiroyuki Nanjo, Tadashi Oohashi, Tsuyoshi Sasaki Usuda +1 more

A class of protocols for output with keeping an operation of a quantum channel is considered as an application of quantum error correcting codes for specific position errors.

IEEJ Transactions on Electronics Information and Systems•Jan 1, 2006•0 citations

Unified Approach to Construct Quantum Error-correcting Code

Jianfa Qian, Wenping Ma

Quantum error-correcting codes play an important role in not only quantum communication but also quantum computation.All kinds of cyclic codes,for example,Hamming codes,BCH codes and Reed-Solomon codes et al.,constacyclic codes and quasi-cyclic codes have been used to construct quantum error-correcting codes.An unified approach to construct quantum error-correcting codes was presented by using quasi-twisted codes.A sufficient and necessary condition for quasi-twisted contained its dual codes,and a new method for constructing quasi-twisted codes was given.Moreover,new quantum quasi-twisted codes were obtained by using quasi-twisted codes.

•Jan 1, 2010•0 citations

Upper bounds on the size of quantum codes

Alexei Ashikhmin, S. Litsyu

This paper is concerned with bounds for quantum error-correcting codes. Using the quantum MacWilliams (1972, 1977) identities, we generalize the linear programming approach from classical coding theory to the quantum case. Using this approach, we obtain Singleton-type, Hamming-type, and the first linear-programming-type bounds for quantum codes. Using the special structure of linear quantum codes, we derive an upper bound that is better than both Hamming and the first linear programming bounds on some subinterval of rates.

IEEE Transactions on Information Theory•May 1, 1999•77 citations
I develop methods for analyzing quantum error-correcting codes, and use these methods to construct an infinite class of codes saturating the quantum Hamming bound. These codes encode k=n-j-2 quantum bits (qubits) in n=2j{2}^{\mathit{j}}2j qubits and correct t=1 error. \textcopyright{} 1996 The American Physical Society.
Quantum error-correcting codes play an important role in not only quantum communication but also quantum computation.All kinds of cyclic codes,for example,Hamming codes,BCH codes and Reed-Solomon codes et al.,constacyclic codes and quasi-cyclic codes have been used to construct quantum error-correcting codes.An unified approach to construct quantum error-correcting codes was presented by using quasi-twisted codes.A sufficient and necessary condition for quasi-twisted contained its dual codes,and a new method for constructing quasi-twisted codes was given.Moreover,new quantum quasi-twisted codes were obtained by using quasi-twisted codes.
This paper is concerned with bounds for quantum error-correcting codes. Using the quantum MacWilliams (1972, 1977) identities, we generalize the linear programming approach from classical coding theory to the quantum case. Using this approach, we obtain Singleton-type, Hamming-type, and the first linear-programming-type bounds for quantum codes. Using the special structure of linear quantum codes, we derive an upper bound that is better than both Hamming and the first linear programming bounds on some subinterval of rates.