Duan, L.-M. and Kimble, H. J. (2005) Efficient Quantum Computation with Probabilistic Quantum Gates. Physical Review Letters, 95 (8). Art. No. 080503. ISSN 0031-9007. http://resolver.caltech.edu/CaltechAUTHORS:DUAprl05
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:DUAprl05
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.
|Additional Information:||©2005 The American Physical Society (Received 28 February 2005; published 17 August 2005) L. M. D. thanks Chris Monroe for helpful discussions. This work was supported by NSF grants (0431476 and EIA-0086038), the ARDA under ARO contracts, the A. P. Sloan Foundation, and the visitor program of MCTP. Note added.—Recently, we became aware that in the latest version of Ref.  the authors have also made some interesting improvement of their construction efficiency of the 1D cluster state to overcome the inefficient scaling.|
|Subject Keywords:||quantum computing; quantum entanglement; quantum gates|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||13 Mar 2006|
|Last Modified:||18 Sep 2014 18:11|
Repository Staff Only: item control page