Distributed quantum computing: a distributed Shor algorithm

We present a distributed implementation of Shor's quantum factoring algorithm on a distributed quantum network model. This model provides a means for small capacity quantum computers to work together in such a way as to simulate a large capacity quantum computer. In this paper, entanglement is used as a resource for implementing non-local operations between two or more quantum computers. These non-local operations are used to implement a distributed factoring circuit with polynomially many gates. This distributed version of Shor's algorithm requires an additional overhead of O((log N)^2) communication complexity, where N denotes the integer to be factored.

[1]  R. Cleve,et al.  Quantum algorithms revisited , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[2]  Samuel J. Lomonaco,et al.  Generalized GHZ States and Distributed Quantum Computing , 2004 .

[3]  Noah Linden,et al.  Nonlocal content of quantum operations , 2001 .

[4]  Preskill,et al.  Efficient networks for quantum factoring. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[5]  J. Eisert,et al.  Optimal local implementation of nonlocal quantum gates , 2000 .

[6]  Jr.,et al.  Shor's Quantum Factoring Algorithm , 2000, quant-ph/0010034.

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