Quantum error correction
Quantum error correction is used in quantum computing to protect quantum information from errors due to decoherence and other quantum noise. Quantum error correction is essential if one is to achieve fault-tolerant quantum computation that can deal not only 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. Suppose we copy a bit three times. Suppose further that a noisy error corrupts the three-bit state so that one bit is equal to zero but the other two are equal to one. We also assume that noisy errors are independent and occur with some probability p. It is most likely that the error is a single-bit error and the transmitted message is three ones. It is possible that a double-bit error occurs and the transmitted message is equal to three zeros, but this outcome is less likely than the above outcome.
Copying quantum information is not possible due to the no-cloning theorem. This theorem seems to present an obstacle to formulating a theory of quantum error correction. But it is possible to spread the information of one qubit onto a highly-entangled state of several (physical) qubits. Peter Shor first discovered this method of formulating a quantum error correcting code by storing the information of one qubit onto a highly-entangled state of nine qubits. A quantum error correcting code protects quantum information against errors of a limited form.
Classical error correcting codes use a syndrome measurement to diagnose which error corrupts an encoded state. We then reverse an error by applying a corrective operation based on the syndrome. Quantum error correction also employs syndrome measurements. We perform a multi-qubit measurement that does not disturb the quantum information in the encoded state but retrieves information about the error. 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.
The bit flip code
The repetition code works in a classical channel, because classical bits are easy to measure and to repeat. However, in a quantum channel, it is no longer possible, due to the no-cloning theorem, which forbids the creation of identical copies of an arbitrary unknown quantum state. So a single qubit can not be repeated three times as in the previous example, as any measurement of the qubit will change its wave function. Nevertheless, in a quantum computer, there is another method, which is called the three qubits bit flip code. It uses entanglement and syndrome measurements, and can perform the similar results to the repetition code.
Let be an arbitrary qubit. The first step of the three qubit bit flip code is to entangle the qubit with two other qubits using two CNOT gates with input . The result will be This is just a tensor product of three qubits, and different from cloning a state.
Now these qubits will be sent through a channel where we assume that at most one bit flip may occur. For example, in the case where the first qubit is flipped, the result would be . To diagnose bit flips in any of the three possible qubits, syndrome diagnosis is needed, which includes four projection operators:
It can be obtained:
So it will be known that the error syndrome corresponding to . This three qubits bit flip code can correct one error if at most one bit-flip-error occurred in the channel. It is similar to the three bits repetition code in a classical computer.
The sign flip code
Flipped bits are the only kind of error in classical computer, but there is another possibility of an error with quantum computers, the sign flip. Through the transmission in a channel the relative sign between and can become inverted. For instance, a qubit in the state may have its sign flip to
The original state of the qubit
will be changed into the state
In the Hadamard basis, bit flips become sign flips and sign flips become bit flips. Let be a quantum channel that can cause at most one phase flip. Then the bit flip code from above can recover by transforming into the Hadamard basis before and after transmission through .
The Shor code
The error channel may induce either a bit flip, a sign flip, or both. It is possible to correct for both types of errors using one code, and the Shor code does just that. In fact, the Shor code corrects arbitrary single-qubit errors.
Let be a quantum channel that can arbitrarily corrupt a single qubit. The 1st, 4th and 7th qubits are for the sign flip code, while the three group of qubits (1,2,3), (4,5,6), and (7,8,9) are designed for the bit flip code. With the Shor code, a qubit state will be transformed into the product of 9 qubits , where
If a bit flip error happens to a qubit, the syndrome analysis will be performed on each set of states (1,2,3), (4,5,6), and (7,8,9), then correct the error.
If the three bit flip group (1,2,3), (4,5,6), and (7,8,9) are considered as three inputs, then the Shor code circuit can be reduced as a sign flip code. This means that the Shor code can also repair sign flip error for a single qubit.
The Shor code also can correct for any arbitrary errors (both bit flip and sign flip) to a single qubit. If an error is modeled by a unitary transform U, which will act on a qubit , then can be described in the form
where ,,, and are complex constants, I is the identity, and the Pauli matrices are given by
If U is equal to I, then no error occurs. If , a bit flip error occurs. If , a sign flip error occurs. If then both a bit flip error and a sign flip error occur. Due to linearity, it follows that the Shor code can correct arbitrary 1-qubit errors.
In general, a quantum code for a quantum channel is a subspace , where is the state Hilbert space, such that there exists another quantum channel with
where is the orthogonal projection onto . Here is known as the correction operation.
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.
- Raymond Laflamme found a class of 5-qubit codes which do the same, which also have the property of being fault-tolerant. A 5-qubit code is the smallest possible code which protects a single logical qubit against single-qubit errors.
- A generalisation of this concept are the CSS codes, named for their inventors: A. R. Calderbank, Peter Shor and Andrew Steane. According to the quantum Hamming bound, encoding a single logical qubit and providing for arbitrary error correction in a single qubit requires a minimum of 5 physical qubits.
- A more general class of codes (encompassing the former) are the stabilizer codes discovered by Daniel Gottesman (), and by A. R. Calderbank, Eric Rains, Peter Shor, and N. J. A. Sloane (, ); these are also called additive codes.
- A newer idea is Alexei Kitaev's topological quantum codes and the more general idea of a topological quantum computer.
- Todd Brun, Igor Devetak, and Min-Hsiu Hsieh also constructed the entanglement-assisted stabilizer formalism as an extension of the standard stabilizer formalism that incorporates quantum entanglement shared between a sender and a receiver.
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.
There have been several experimental realizations of CSS-based codes. The first demonstration was with NMR qubits. Subsequently demonstrations have been made with linear optics, trapped ions, and superconducting (transmon) qubits.
Other error correcting codes have also been implemented, such as one aimed at correcting for photon loss, the dominant error source in photonic qubit schemes.
- Michael A. Nielsen and Isaac L. Chuang (2000). "Quantum Computation and Quantum Information". Cambridge University Press.
- W.Shor, Peter (1995). "Scheme for reducing decoherence in quantum computer memory". AT&T Bell Laboratories.
- D. G. Cory, M. D. Price, W. Maas, E. Knill, R. Laflamme, W. H. Zurek, T. F. Havel and S. S. Somaroo, "Experimental Quantum Error Correction," Phys. Rev. Lett. 81, 2152–2155 (1998), doi:10.1103/PhysRevLett.81.2152
- T. B. Pittman, B. C. Jacobs and J. D. Franson, "Demonstration of quantum error correction using linear optics," Phys. Rev. A 71, 052332 (2005), doi:10.1103/PhysRevA.71.052332
- J. Chiaverini, D. Leibfried, T. Schaetz, M. D. Barrett, R. B. Blakestad, J. Britton, W. M. Itano, J. D. Jost, E. Knill, C. Langer, R. Ozeri and D. J. Wineland, "Realization of quantum error correction," Nature 432, 602-605 (2004), doi:10.1038/nature03074
- P. Schindler, J. T. Barreiro, T. Monz, V. Nebendahl, D. Nigg, M. Chwalla, M. Hennrich and R. Blatt, "Experimental Repetitive Quantum Error Correction," Science 332, 1059-1061 (2011), doi:10.1126/science.1203329
- M. D. Reed, L. DiCarlo, S. E. Nigg, L. Sun, L. Frunzio, S. M. Girvin and R. J. Schoelkopf, "Realization of Three-Qubit Quantum Error Correction with Superconducting Circuits," Nature 482, 382-385 (2012), doi:10.1038/nature10786, arXiv:1109.4948
- M. Lassen, M. Sabuncu, A. Huck, J. Niset, G. Leuchs, N. J. Cerf and U. L. Andersen, "Quantum optical coherence can survive photon losses using a continuous-variable quantum erasure-correcting code," Nature Photonics 4, 700 (2010), doi:10.1038/nphoton.2010.168
- Freedman, Michael H.; Meyer, David A.; Luo, Feng: Z2-Systolic freedom and quantum codes. Mathematics of quantum computation, 287–320, Comput. Math. Ser., Chapman & Hall/CRC, Boca Raton, FL, 2002.
- Freedman, Michael H.; Meyer, David A.: Projective plane and planar quantum codes. Found. Comput. Math. 1 (2001), no. 3, 325–332.