2004/03/23 by Anocha Yimsiriwattana, Samuel J. Lomonaco Jr, Samuel J. Lomonaco Jr. · 1 citation
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1117/12.546504
13 pages, 12 figures, extra figures are removed
arxiv created 2004/03/23 · openalex publication_date 2004/08/24 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/30
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.