Efficient Quantum Computation with Probabilistic Quantum Gates
Efficient Quantum Computation with Probabilistic Quantum Gates
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 …