Bounding Fault-Tolerant Thresholds for Purification and Quantum Computation

Details Bounding Fault-Tolerant Thresholds for Purification and Quantum Computation Bounding Fault-Tolerant Thresholds for Purification and Quantum Computation

2007-05-30

arxiv.org/abs/0705.4360v4

Phys. Rev. A 77, 052319 (2008)

Physics

Quantum Physics

8 pages, 6 figures. published version

Scientific paper

10.1103/PhysRevA.77.052319

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.

Affiliated with

Also associated with

No associations

Rating

Bounding Fault-Tolerant Thresholds for Purification and Quantum Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounding Fault-Tolerant Thresholds for Purification and Quantum Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounding Fault-Tolerant Thresholds for Purification and Quantum Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-357199