Investigating the practical implementation of Shor's algorithm

The publication in 1994 of Shor's algorithm, which allows factorization of composite number N in a time polynomial in its binary length L has been the primary catalyst for the race to construct a functional quantum computer. However, it seems clear that any practical system that may be developed will not be able to perform completely error free quantum gate operations or shield even idle qubits from inevitable error effects. Hence, the practicality of quantum algorithms needs to be investigated to estimate what demands must be made of quantum error correction (QEC). Several different quantum circuits implementing the quantum period finding (QPF) subroutine, which lies at the heart of Shor's algorithm have been designed, but each tacitly assumes that arbitrary pairs of qubits can be interacted. While some architectures posses this property, many promising proposals are best suited to realizing a single line of qubits with nearest neighbor interactions only. This paper will present a circuit suitable for implementing the QPF subroutine for such linear nearest neighbor (LNN) designs. We will then present direct simulation results showing for both the LNN circuit and for a circuit utilizing arbitrary interactions, that the QPF subroutine is very sensitive to a small number of errors in the entire circuit. These results can then be used to briefly examine some of the practical issues to implementing such large scale quantum algorithms.

[1]  Simon J. Devitt,et al.  Simulations of Shor's algorithm with implications to scaling and quantum error correction , 2004 .

[2]  K. B. Whaley,et al.  Geometric theory of nonlocal two-qubit operations , 2002, quant-ph/0209120.

[3]  Yuriy Makhlin Nonlocal Properties of Two-Qubit Gates and Mixed States, and the Optimization of Quantum Computations , 2002, Quantum Inf. Process..

[4]  Simon J. Devitt,et al.  Implementation of Shor's algorithm on a linear nearest neighbour qubit array , 2004, Quantum Inf. Comput..

[5]  Barenco,et al.  Quantum networks for elementary arithmetic operations. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[6]  Xiao Li,et al.  Phase-matching approach to eliminate the dynamical phase error in Shor's factoring algorithm , 2003 .

[7]  Christof Zalka Fast versions of Shor's quantum factoring algorithm , 1998 .

[8]  A. Fowler,et al.  Quantum-error correction on linear-nearest-neighbor qubit arrays , 2003, quant-ph/0311116.

[9]  Igor L. Markov,et al.  Arbitrary two-qubit computation in 23 elementary gates , 2003, DAC 2003.

[10]  Austin G. Fowler,et al.  Practicality of Fault-Tolerant Quantum Computation , 2005 .

[11]  Phil Gossett Quantum Carry-Save Arithmetic , 1998, quant-ph/9808061.

[12]  B. M. Fulk MATH , 1992 .

[13]  A. Fowler,et al.  Scalability of Shor’s algorithm with a limited set of rotation gates , 2003, quant-ph/0306018.

[14]  C. Lavor,et al.  Shor's Algorithm for Factoring Large Integers , 2003, quant-ph/0303175.

[15]  Daniel Braun Quantum chaos and quantum algorithms , 2002 .

[16]  M B Plenio,et al.  Efficient factorization with a single pure qubit and logN mixed qubits. , 2000, Physical review letters.

[17]  J. Cirac,et al.  Optimal creation of entanglement using a two-qubit gate , 2000, quant-ph/0011050.

[18]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[19]  Stéphane Beauregard Circuit for Shor's algorithm using 2n+3 qubits , 2003, Quantum Inf. Comput..

[20]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .

[21]  Colin P. Williams,et al.  Optimal quantum circuits for general two-qubit gates (5 pages) , 2003, quant-ph/0308006.