Quantum error correction

Quantum error correction is for use in quantum computing to protect quantum information from errors due to decoherence and other quantum noise. Quantum error correction is essential for fault-tolerant quantum computation which is designed to deal not just with noise on stored quantum information, but also with faulty quantum gates, faulty quantum preparation, and faulty measurements.

Classical error correction employs redundancy: The simplest way is to store the information multiple times, and—if these copies are later found to disagree—just take a majority vote; e.g. If a bit has been copied three times but now one bit says 0 but two bits say 1, then it is probable that the original state was three 1s, and a single error occurred, than that originally it was three 0s and two errors occurred, though that could have happened. Although copying is not possible with quantum information, due to the no-cloning theorem, the information of one qubit may be spread onto several (physical) qubits by using a quantum error correcting code. Such encoded quantum information is protected, as in classical error correcting codes, against errors of a limited form.

As in classical error correcting codes, a syndrome measurement can determine whether a qubit has been corrupted, and if so, which one. What is more, the outcome of this operation (the syndrome) tells us not only which physical qubit was affected, but also, in which of several possible ways it was affected. The latter is counter-intuitive at first sight: Since noise is arbitrary, how can the effect of noise be one of only few distinct possibilities? In most codes, the effect is either a bit flip, or a sign (of the phase) flip, or both (corresponding to the Pauli matrices X, Z, and Y). The reason is that the measurement of the syndrome has the projective effect of a quantum measurement. So even if the error due to the noise was arbitrary, it can be expressed as a superposition of basis operations—the error basis (which is here given by the Pauli matrices and the identity). The syndrome measurement "forces" the qubit to "decide" for a certain specific "Pauli error" to "have happened", and the syndrome tells us which, so that we can let the same Pauli operator act again on the corrupted qubit to revert the effect of the error.

The syndrome measurement tells us as much as possible about the error that has happened, but nothing at all about the value that is stored in the logical qubit—as otherwise the measurement would destroy any quantum superposition of this logical qubit with other qubits in the quantum computer.

Models

Over time, researchers have come up with several codes:

• Peter Shor's 9-qubit-code, a.k.a. the Shor code, encodes 1 logical qubit in 9 physical qubits and can correct for arbitrary errors in a single qubit.
• Andrew Steane found a code which does the same with 7 instead of 9 qubits, see Steane code.
• A generalisation of this concept are the CSS codes, named for their inventors: A. R. Calderbank, Peter Shor and Andrew Steane. A more general class of codes (encompassing the former) are the stabilizer codes of Daniel Gottesman.
• A newer idea is Alexei Kitaev's topological quantum codes.

That these codes allow indeed for quantum computations of arbitrary length is the content of the threshold theorem, found by Michael Ben-Or and Dorit Aharonov, which asserts that you can correct for all errors if you concatenate quantum codes such as the CSS codes—i.e. re-encode each logical qubit by the same code again, and so on, on logarithmically many levels—provided the error rate of individual quantum gates is below a certain threshold; as otherwise, the attempts to measure the syndrome and correct the errors would introduce more new errors than they correct for.

As of late 2004, estimates for this threshold indicate that it could be as high as 1-3% [1], provided that there are sufficiently many qubits available. M.I. Dyakonov has criticized quantum error correction models as being being based on idealized elements and thus being unrealistic. [2]

External links

• Prospects
• Limitations
• Error-check breakthrough in quantum computing
• Is fault-tolerant quantum computing possible?