Classical simulatability, entanglement breaking, and quantum computation thresholds

Details Classical simulatability, entanglement breaking, and quantum computation thresholds Classical simulatability, entanglement breaking, and quantum computation thresholds

2004-08-11

arxiv.org/abs/quant-ph/0408076v2

Phys. Rev. A. 71, 042328 (2005)

Physics

Quantum Physics

12 pages, 3 figures. v2: small typos changed, no change to results

Scientific paper

10.1103/PhysRevA.71.042328

We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper bounds on fault tolerant thresholds, and for understanding the nature of the quantum/classical computational transition. We refine some previously known upper bounds using two different strategies. The first one involves the introduction of bi-entangling operations, a class of classically simulatable machines that can generate at most bipartite entanglement. Using this class we show that it is possible to sharpen previously obtained upper bounds in certain cases. As an example, we show that under depolarizing noise on the controlled-not gate, the previously known upper bound of 74% can be sharpened to around 67%. Another interesting consequence is that measurement based schemes cannot work using only 2-qubit non-degenerate projections. In the second strand of the work we utilize the Gottesman-Knill theorem on the classically efficient simulation of Clifford group operations. The bounds attained for the pi/8 gate using this approach can be as low as 15% for general single gate noise, and 30% for dephasing noise.

Affiliated with

Also associated with

No associations

Rating

Classical simulatability, entanglement breaking, and quantum computation thresholds 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 Classical simulatability, entanglement breaking, and quantum computation thresholds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classical simulatability, entanglement breaking, and quantum computation thresholds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-208556