Bounding Fault-Tolerant Thresholds for Purification and Quantum Computation

Abstract

In this paper, we place bounds on when it is impossible to purify a noisy two-qubit state if all the gates used in the purification protocol are subject to adversarial local, independent, noise. It is found that the gate operations must be subject to less than 5.3% error. An existing proof that purification is equivalent to error correction is used to show that this bound can also be applied to concatenated error correcting codes in the presence of noisy gates, and hence gives a limit to the tolerable error rate for a fault-tolerant quantum computer formed by concatenation. This is shown to apply also to the case where error detection and post-selection, as proposed by Knill, is used to enhance the threshold. We demonstrate the trade-off between gate/environmentally induced faulty rotations and qubit loss errors.

8 pages, 6 figures. published version

References in corpus (19)

• Entanglement of Formation of an Arbitrary State of Two Qubits
• Mixed State Entanglement and Quantum Error Correction
• Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
• Good Quantum Error-Correcting Codes Exist
• Quantum privacy amplification and the security of quantum cryptography over noisy channels
• Quantum Computing with Very Noisy Devices
• A Theory of Fault-Tolerant Quantum Computation
• Simple Quantum Error Correcting Codes
• Entanglement purification and quantum error correction
• Fault-tolerant quantum computation with long-range correlated noise
• Loss tolerance in one-way quantum computation via counterfactual error correction
• Efficient fault-tolerant quantum computing
• How robust is a quantum gate in the presence of noise?
• Interpolation of recurrence and hashing entanglement distillation protocols
• Classical simulatability, entanglement breaking, and quantum computation thresholds
• Asymptotic adaptive bipartite entanglement distillation protocol
• Optimal purification of thermal graph states
• Multipartite purification protocols: upper and optimal bounds
• Correlated entanglement distillation and the structure of the set of undistillable states

Cited by in corpus (5)

• Fault-tolerant quantum computation versus Gaussian noise
• Entanglement Purification with Double Selection
• Generalised state spaces and non-locality in fault tolerant quantum computing schemes
• Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers
• An upper bound on quantum fault tolerant thresholds