We demonstrate an improved concatenated encoded ancilla preparation procedure. Simulations show that this procedure significantly increases the error threshold beneath which arbitrarily long quantum computations are possible.
We investigate the use of concatenated coding to protect against dephasing in the absence of other types of error in order to carry out large quantum computations. This analysis is based on a well-known three-bit quantum code. Fault tolerant methods for carrying out gate operations, ancilla preparation, and syndrome identification are discussed and the maximum (or threshold) error rate which can be tolerated (if quantum coherence is to be maintained for arbitrarily long computations) is estimated. The methods for performing fault tolerant gate operations are compared to the methods appropriate for the seven-bit code and it is concluded that the three-bit code is not likely to be useful for large-scale quantum computation.
It has been known that error-correction via concatenated codes can be done with exponentially small failure rate if the error rate for physical qubits is below a certain accuracy threshold (probably ∼ 10 −3 –10 −6). Other, un-concatenated codes with their own attractive features—e.g., an accuracy threshold ∼ 10 −2 —have also been studied. A method to obtain universal computation is presented here which does not rely on any concatenated structure within the code itself, but instead emulates this structure with logical qubits in order to construct an encoded Toffoli gate. This realizes ∼ 10 −2 as a threshold for fault-tolerant quantum computation. 1 QEC codes and universal computation In the “space ” of all possible quantum error-correcting codes, much recent work has focused on a relatively small class, namely concatenated codes [1]–[7]. The basic idea behind these is to improve the results of a given few-qubit code by
It is known that quantum error correction via concatenated codes can be done with exponentially small failure rate if the error rate for physical qubits is below a certain accuracy threshold. Other, unconcatenated codes with their own attractive features such as improved accuracy threshold, local operations, have also been studied. By iteratively distilling a certain two-qubit entangled state it is shown how to perform an encoded Toffoli gate, important for universal computation, on codes whose C-NOT operation is bitwise. For certain codes, over a very large range of block sizes, this technique requires at most one concatenation.
The discovery of quantum error correction has greatly improved the long-term prospects for quantum computing technology. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the environment, or due to imperfect implementations of quantum logical operations. 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. In principle, an arbitrarily long quantum computation can be performed reliably, provided that the average probability of error per gate is less than a certain critical value, the accuracy threshold. It may be possible to incorporate intrinsic fault tolerance into the design of quantum computing hardware, perhaps by invoking topological Aharonov-Bohm interactions to process quantum information.
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical quantum computation requires overcoming the problems of environmental noise and operational errors, problems which appear to be much more severe than in classical computation due to the inherent fragility of quantum superpositions involving many degrees of freedom. Here we show that arbitrarily accurate quantum computations are possible provided that the error per operation is below a threshold value. The result is obtained by combining quantum error-correction, fault tolerant state recovery, fault tolerant encoding of operations and concatenation. It holds under physically realistic assumptions on the errors.
I describe a procedure for calculating thresholds for quantum computation as a function of error model given the availability of ancillae prepared in logical states with independent, identically distributed errors. The thresholds are determined via a simple counting argument performed on a single qubit of an infinitely large Calderbank-Shor-Steane code. I give concrete examples of thresholds thus achievable for both Steane and Knill style fault-tolerant implementations and investigate their relation to threshold estimates in the literature.