Chapter 10 - Fault-Tolerant Quantum Computing

Fault-Tolerant Quantum Computing

As the name implies, fault-tolerant quantum computing means that quantum computations can be performed in spite of errors in the computation. To ensure that a computation is reliable, one must be able to prevent errors from accumulating. This could happen, for example, if a small error occurs on one qubit and propagates to many others before it is fixed. What are all the ways in which a error can occur and how can they be prevented from accumulating to produce erroneous results?

As Preskill puts it in Lo, Popescu, and Spiller, one needs to "...sniff out all the ways in which a recovery failure could result from a single error, ..." Then, in a Proc. Roy. Soc. London article, he gives five laws for reliable quantum computing, as he reviews the results obtained for avoiding failure.

1. Don't re-use qubits,
2. Copy errors not data,
3. Verify when you encode a known quantum state,
4. Repeat operations,
5. Use the right code.

All of these require some explanation. Let us take them in order.

Number 1 says that qubits should not be re-used. This really means that one should be careful when qubits are reused, or when they interact, because error correction procedures can actually propagate errors. Consider the syndrome measurement in Figure 7.2. In that circuit, one of the ancillary qubits is used twice to check the parity of a pair of qubits in the bit-flip code. This, however, can propagate a single error.

Figure 7.3

Figure 7.3: Two different syndrome extraction circuits for the three-qubit quantum error correcting code. The figure on the left is not fault-tolerant. It is the same as Figure 7.2. The figure on the right is fault-tolerant. However, as explained in the text, it cannot be used.

	${\begin{aligned}&=\\&=\end{aligned}}\,\!$	(7.?)

Fault-Tolerant Quantum Computing for the Steane Code

$\,\!$