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

Decoherence and Efficiency of Quantum Error Correction

Marek Biskup, Pavel Cejnar, Roman Kotecký

Published Aug 8, 1996• 1 citation
arXivHTMLPDF

Abstract

Certain physical aspects of quantum error correction are discussed for a quantum computer (n-qubit register) in contact with a decohering environment. Under rather plausible assumptions upon the form of the computer-environment interaction, the efficiency of a general correcting procedure is evaluated as a function of the spontaneous-decay duration and the rank of errors covered by the procedure. It is proved that the probability of errors can be made arbitrarily small by enhancing the correction method, provided the decohering interaction is represented by a bounded operator.

DOI
10.48550/arxiv.quant-ph/9608010

Related papers

Bound on quantum computation time: Quantum error correction in a critical environment

E. Novais, Eduardo R. Mucciolo, Harold U. Baranger

We obtain an upper bound on the time available for quantum computation for a given quantum computer and decohering environment with quantum error correction implemented. First, we derive an explicit quantum evolution operator for the logical qubits and show that it has the same form as that for the physical qubits but with a reduced coupling strength to the environment. Using this evolution operator, we find the trace distance between the real and ideal states of the logical qubits in two cases. For a super-Ohmic bath, the trace distance saturates, while for Ohmic or sub-Ohmic baths, there is a finite time before the trace distance exceeds a value set by the user.

arXiv:1004.3247•Physical Review A•Aug 31, 2010•8 citations

Quantum error correction for quantum memories

Barbara M. Terhal

It may seem inevitable that highly entangled quantum states are susceptible to disturbance through interaction with a decohering environment. However, certain multiqubit entangled states are well protected from common forms of decoherence as the quantum information is hidden in inherently nonlocal degrees of freedom. This review shows that this robustness is enabled by specific measurements on subsets of qubits, implementing a quantum version of an error correction process. Beginning with the basics, the latest understanding of the relation between this form of error correction and the concept of two-dimensional topological order in many-body physics is reviewed.

arXiv:1302.3428•Reviews of Modern Physics•Apr 7, 2015•1,351 citations

5-qubit quantum error correction in a charge qubit quantum computer

Dave Touchette, Haleemur Ali, Michael Hilke

We implement the DiVincenzo-Shor 5 qubit quantum error correcting code into a solid-state quantum register. The quantum register is a multi charge-qubit system in a semiconductor environment, where the main sources of noise are phase decoherence and relaxation. We evaluate the decay of the density matrix for this multi-qubit system and perform regular quantum error corrections. The performance of the error correction in this realistic system is found to yield an improvement of the fidelity. The fidelity can be maintained arbitrarily close to one by sufficiently increasing the frequency of error correction. This opens the door for arbitrarily long quantum computations.

arXiv:1010.3242•Oct 15, 2010•3 citations

Reliable quantum computers

John P. Preskill

The new field of quantum error correction has developed spectacularly since its origin less than two years ago. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the environment. Recovery from errors can work effectively even if occasional mistakes occur during the recovery procedure. Furthermore, encoded quantum information can be processed without serious propagation of errors. Hence, an arbitrarily long quantum computation can be performed reliably, provided that the average probability of error per quantum gate is less than a certain critical value, the accuracy threshold. A quantum computer storing about 106 qubits, with a probability of error per quantum gate of order 10–6, would be a formidable factoring engine. Even a smaller less–accurate quantum computer would be able to perform many useful tasks. This paper is based on a talk presented at the ITP Conference on Quantum Coherence and Decoherence, 15 to 18 December 1996.

arXiv:quant-ph/9705031•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Jan 8, 1998•993 citations

Quantum error correction

Anirban Pathak

In Chapter 4 we introduced different quantum gates and quantum circuits and in Chapter 5 we described several quantum algorithms. So far the analysis of the algorithms and the circuits has been made with the assumption that the required unitary operations can be implemented exactly without any error. This is an abstraction. In an actual physical system that implements a quantum algorithm or a quantum circuit there are several sources of errors. The situation is similar in classical computation and to circumvent this problem error correcting codes are used in classical digital computing. Since qubits are more delicate and more susceptible to errors we need to introduce quantum error correcting codes. It is very important, as without such codes it will not be possible to build a scalable quantum computer. Such quantum error correcting codes are introduced in this chapter. However, we will not limit ourselves to the discussion of error correcting codes alone. We will also discuss more general aspects of errors and error correction, like decoherence, decoherence free subspace and fault-tolerance.

CRC Press eBooks•Jun 20, 2013•33 citations

Effects of noise on quantum error correction algorithms

Adriano Barenco, Todd A. Brun, Rüdiger Schack +1 more

It has recently been shown that there are efficient algorithms for quantum computers to solve certain problems, such as prime factorization, which are intractable to date on classical computers. The chances for practical implementation, however, are limited by decoherence, in which the effect of an external environment causes random errors in the quantum calculation. To combat this problem, quantum error correction schemes have been proposed, in which a single quantum bit (qubit) is ``encoded'' as a state of some larger number of qubits, chosen to resist particular types of errors. Most such schemes are vulnerable, however, to errors in the encoding and decoding itself. We examine two such schemes, in which a single qubit is encoded in a state of $n$ qubits while subject to dephasing or to arbitrary isotropic noise. Using both analytical and numerical calculations, we argue that error correction remains beneficial in the presence of weak noise, and that there is an optimal time between error correction steps, determined by the strength of the interaction with the environment and the parameters set by the encoding.

arXiv:quant-ph/9612047•Physical Review A•Aug 1, 1997•34 citations
Certain physical aspects of quantum error correction are discussed for a quantum computer (n-qubit register) in contact with a decohering environment. Under rather plausible assumptions upon the form of the computer-environment interaction, the efficiency of a general correcting procedure is evaluated as a function of the spontaneous-decay duration and the rank of errors covered by the procedure. It is proved that the probability of errors can be made arbitrarily small by enhancing the correction method, provided the decohering interaction is represented by a bounded operator.
We obtain an upper bound on the time available for quantum computation for a given quantum computer and decohering environment with quantum error correction implemented. First, we derive an explicit quantum evolution operator for the logical qubits and show that it has the same form as that for the physical qubits but with a reduced coupling strength to the environment. Using this evolution operator, we find the trace distance between the real and ideal states of the logical qubits in two cases. For a super-Ohmic bath, the trace distance saturates, while for Ohmic or sub-Ohmic baths, there is a finite time before the trace distance exceeds a value set by the user.
It may seem inevitable that highly entangled quantum states are susceptible to disturbance through interaction with a decohering environment. However, certain multiqubit entangled states are well protected from common forms of decoherence as the quantum information is hidden in inherently nonlocal degrees of freedom. This review shows that this robustness is enabled by specific measurements on subsets of qubits, implementing a quantum version of an error correction process. Beginning with the basics, the latest understanding of the relation between this form of error correction and the concept of two-dimensional topological order in many-body physics is reviewed.
We implement the DiVincenzo-Shor 5 qubit quantum error correcting code into a solid-state quantum register. The quantum register is a multi charge-qubit system in a semiconductor environment, where the main sources of noise are phase decoherence and relaxation. We evaluate the decay of the density matrix for this multi-qubit system and perform regular quantum error corrections. The performance of the error correction in this realistic system is found to yield an improvement of the fidelity. The fidelity can be maintained arbitrarily close to one by sufficiently increasing the frequency of error correction. This opens the door for arbitrarily long quantum computations.
The new field of quantum error correction has developed spectacularly since its origin less than two years ago. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the environment. Recovery from errors can work effectively even if occasional mistakes occur during the recovery procedure. Furthermore, encoded quantum information can be processed without serious propagation of errors. Hence, an arbitrarily long quantum computation can be performed reliably, provided that the average probability of error per quantum gate is less than a certain critical value, the accuracy threshold. A quantum computer storing about 106 qubits, with a probability of error per quantum gate of order 10–6, would be a formidable factoring engine. Even a smaller less–accurate quantum computer would be able to perform many useful tasks. This paper is based on a talk presented at the ITP Conference on Quantum Coherence and Decoherence, 15 to 18 December 1996.
In Chapter 4 we introduced different quantum gates and quantum circuits and in Chapter 5 we described several quantum algorithms. So far the analysis of the algorithms and the circuits has been made with the assumption that the required unitary operations can be implemented exactly without any error. This is an abstraction. In an actual physical system that implements a quantum algorithm or a quantum circuit there are several sources of errors. The situation is similar in classical computation and to circumvent this problem error correcting codes are used in classical digital computing. Since qubits are more delicate and more susceptible to errors we need to introduce quantum error correcting codes. It is very important, as without such codes it will not be possible to build a scalable quantum computer. Such quantum error correcting codes are introduced in this chapter. However, we will not limit ourselves to the discussion of error correcting codes alone. We will also discuss more general aspects of errors and error correction, like decoherence, decoherence free subspace and fault-tolerance.
It has recently been shown that there are efficient algorithms for quantum computers to solve certain problems, such as prime factorization, which are intractable to date on classical computers. The chances for practical implementation, however, are limited by decoherence, in which the effect of an external environment causes random errors in the quantum calculation. To combat this problem, quantum error correction schemes have been proposed, in which a single quantum bit (qubit) is ``encoded'' as a state of some larger number of qubits, chosen to resist particular types of errors. Most such schemes are vulnerable, however, to errors in the encoding and decoding itself. We examine two such schemes, in which a single qubit is encoded in a state of nnn qubits while subject to dephasing or to arbitrary isotropic noise. Using both analytical and numerical calculations, we argue that error correction remains beneficial in the presence of weak noise, and that there is an optimal time between error correction steps, determined by the strength of the interaction with the environment and the parameters set by the encoding.