Bounding fault-tolerant thresholds for purification and quantum computation

  title={Bounding fault-tolerant thresholds for purification and quantum computation},
  author={Alastair Kay},
  journal={Physical Review A},
  • A. Kay
  • Published 30 May 2007
  • Physics
  • Physical Review A
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… 

Figures from this paper

Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers
This work considers the possibility of adding noise to a quantum circuit to make it efficiently simulatable classically and finds that easy instances can be identified in popular fault tolerance proposals, thereby enabling sharper upper bounds to be derived in these cases.
An upper bound on quantum fault tolerant thresholds
In this paper we calculate upper bounds on fault tolerance, without restrictions on the overhead involved. Optimally adaptive recovery operators are used, and the Shannon entropy is used to estimate
Generalized state spaces and nonlocality in fault-tolerant quantum-computing schemes
We develop connections between generalized notions of entanglement and quantum computational devices where the measurements available are restricted, either because they are noisy and/or because by