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

A Note on Quantum Errors and Their Correction

Subhash C. Kak

Published Nov 2, 1998• 0 citations
arXivHTMLPDF

Abstract

This note presents a few observations on the nonlocal nature of quantum errors and the expected performance of the recently proposed quantum error-correction codes that are based on the assumption that the errors are either bit-flip or phase-flip or both.
DOI
10.48550/arxiv.quant-ph/9811005

Related papers

Quantum error correction

E. Desurvire

This chapter deals with the subject of quantum error correction and the related codes (QECC), which can be applied to noisy quantum channels and quantum memories with the purpose of preserving or protecting the information integrity. I first describe the basics of quantum repetition codes , as applicable to bit-flip and phase-flip quantum channels. Then I consider the 9-qubit Shor code , which has the capability of diagnosing and correcting any combination of bit-flip and phase-flip errors, up to one error of each type. Furthermore, it is shown that the Shor code is, in fact, capable of fully restoring qubit integrity under a continuum of bit or phase errors, a property that has no counterpart in the classical world of error-correction codes. But the exploration of QECC does not stop here! We shall discover the elegant Calderbank–Shor–Steane (CSS) codes, which have the capability of correcting any number of errors t , both bit-flip and phase-flip. As an application of the CSS code, I then describe the 7-qubit Hadamard–Steane code , which can correct up to one error on single qubits. A corresponding quantum circuit, based on an original generator-matrix example, is presented. Quantum repetition code In Chapter 11, we saw that the simplest form of error-correction code (ECC) is the repetition code , based on the principle of majority logic . The background assumption is that in a given message sequence, or bit string, the probability of a bit error is sufficiently small for the majority of bits to be correctly transmitted through the channel.

Cambridge University Press eBooks•Feb 19, 2009•0 citations

On the Effect of Coherence of Noise in Quantum Error Correction

Yasunari Suzuki, Keisuke Fujii, Masato Koashi

Bulletin of the American Physical Society•Mar 17, 2017•0 citations

Implementation of Error Correction on IBM Quantum Computing Devices

Sangat Sharma, Suresh Basnet, Raju Khanal

Quantum noise cannot be avoided in the quantum computing devices due to unstable nature of qubits and signals. The error caused by quantum noise can be detected and corrected using different error correcting codes. In this work, we have tested the feasibility and accuracy of three qubit bit flip and phase flip error correcting code in quantum computer provided by International Business Machine Quantum Experience (IBM QX) cloud platform. Among five quantum processors, ibmq_ourense is found to have highest average accuracy 77.9% ± 3.09% on all qubits simultaneously. Three qubits bit flip error correction circuit gave correct output 89.9% ± 1.01% of the time on average. Similarly three qubits phase flip error correction circuit give 88.05% ±1.89%. The measurement error mitigation has improved the accuracy of bit flip and phase flip error correction code by 5.01% and 7.01% respectively on average. The error rate shows that the error in quantum computations are random in nature and can be corrected. IBM QX quantum computer are suitable for only small scale quantum computation and demonstrate purpose. Furthermore, the accuracy of error correction codes can be increased with the use of higher accuracy quantum qubits and quantum gates.

Journal of Nepal Physical Society•Dec 13, 2022•4 citations

Nonlocal quantum information in bipartite quantum error correction

Mark M. Wilde, David A. Fattal

arXiv:0912.2150•Quantum Information Processing•Mar 31, 2010•16 citations

Coherent errors in quantum error correction

Daniel Greenbaum, Zachary Dutton

APS•Mar 1, 2017•2 citations

Asymmetric quantum LDPC codes

Pradeep Kiran Sarvepalli, Andreas Klappenecker, Martin Rötteler

Recently, quantum error-correcting codes were proposed that capitalize on the fact that many physical error models lead to a significant asymmetry between the probabilities for bit flip and phase flip errors. An example for a channel which exhibits such asymmetry is the combined amplitude damping and dephasing channel, where the probabilities of bit flips and phase flips can be related to relaxation and dephasing time, respectively. We give systematic constructions of asymmetric quantum stabilizer codes that exploit this asymmetry. Our approach is based on a CSS construction that combines BCH and finite geometry LDPC codes.

arXiv:0804.4316•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•55 citations
This chapter deals with the subject of quantum error correction and the related codes (QECC), which can be applied to noisy quantum channels and quantum memories with the purpose of preserving or protecting the information integrity. I first describe the basics of quantum repetition codes , as applicable to bit-flip and phase-flip quantum channels. Then I consider the 9-qubit Shor code , which has the capability of diagnosing and correcting any combination of bit-flip and phase-flip errors, up to one error of each type. Furthermore, it is shown that the Shor code is, in fact, capable of fully restoring qubit integrity under a continuum of bit or phase errors, a property that has no counterpart in the classical world of error-correction codes. But the exploration of QECC does not stop here! We shall discover the elegant Calderbank–Shor–Steane (CSS) codes, which have the capability of correcting any number of errors t , both bit-flip and phase-flip. As an application of the CSS code, I then describe the 7-qubit Hadamard–Steane code , which can correct up to one error on single qubits. A corresponding quantum circuit, based on an original generator-matrix example, is presented. Quantum repetition code In Chapter 11, we saw that the simplest form of error-correction code (ECC) is the repetition code , based on the principle of majority logic . The background assumption is that in a given message sequence, or bit string, the probability of a bit error is sufficiently small for the majority of bits to be correctly transmitted through the channel.
Quantum noise cannot be avoided in the quantum computing devices due to unstable nature of qubits and signals. The error caused by quantum noise can be detected and corrected using different error correcting codes. In this work, we have tested the feasibility and accuracy of three qubit bit flip and phase flip error correcting code in quantum computer provided by International Business Machine Quantum Experience (IBM QX) cloud platform. Among five quantum processors, ibmq_ourense is found to have highest average accuracy 77.9% ± 3.09% on all qubits simultaneously. Three qubits bit flip error correction circuit gave correct output 89.9% ± 1.01% of the time on average. Similarly three qubits phase flip error correction circuit give 88.05% ±1.89%. The measurement error mitigation has improved the accuracy of bit flip and phase flip error correction code by 5.01% and 7.01% respectively on average. The error rate shows that the error in quantum computations are random in nature and can be corrected. IBM QX quantum computer are suitable for only small scale quantum computation and demonstrate purpose. Furthermore, the accuracy of error correction codes can be increased with the use of higher accuracy quantum qubits and quantum gates.
Recently, quantum error-correcting codes were proposed that capitalize on the fact that many physical error models lead to a significant asymmetry between the probabilities for bit flip and phase flip errors. An example for a channel which exhibits such asymmetry is the combined amplitude damping and dephasing channel, where the probabilities of bit flips and phase flips can be related to relaxation and dephasing time, respectively. We give systematic constructions of asymmetric quantum stabilizer codes that exploit this asymmetry. Our approach is based on a CSS construction that combines BCH and finite geometry LDPC codes.