Efficient quantum computation with probabilistic quantum gates

Details Efficient quantum computation with probabilistic quantum gates Efficient quantum computation with probabilistic quantum gates

2005-02-18

arxiv.org/abs/quant-ph/0502120v1

Phys. Rev. Lett. 95, 080503 (2005).

Physics

Quantum Physics

4 pages, 2 figures

Scientific paper

10.1103/PhysRevLett.95.080503

With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The required computational overhead scales efficiently both with $1/p$ and $n$, where $n$ is the number of qubits in the computation. This approach provides an efficient way to combat noise in a class of quantum computation implementation schemes, where the dominant noise leads to probabilistic signaled errors with an error probability $1-p$ far beyond any threshold requirement.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-174162