Distributed quantum computing: a distributed Shor algorithm

Anocha Yimsiriwattana; Samuel J. Lomonaco Jr.

doi:10.1117/12.546504

24 August 2004 Distributed quantum computing: a distributed Shor algorithm

Anocha Yimsiriwattana, Samuel J. Lomonaco Jr.

Proceedings Volume 5436, Quantum Information and Computation II; (2004) https://doi.org/10.1117/12.546504
Event: Defense and Security, 2004, Orlando, Florida, United States

Abstract

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.

Citation Download Citation

Anocha Yimsiriwattana and Samuel J. Lomonaco Jr. "Distributed quantum computing: a distributed Shor algorithm", Proc. SPIE 5436, Quantum Information and Computation II, (24 August 2004); https://doi.org/10.1117/12.546504

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available