TY - GEN

T1 - Architecture of a quantum multicomputer implementing Shor's algorithm

AU - Van Meter, Rodney

AU - Munro, W. J.

AU - Nemoto, Kae

PY - 2008

Y1 - 2008

N2 - We have created the architecture of a quantum multicomputer and analyzed its performance for running Shor's algorithm for factoring large numbers. In this paper, we combine fault tolerance techniques with performance goals for our architecture, which uses a linear interconnect and six logical qubits per node. Our performance target of factoring a 1,024-bit number in one month requires teleporting 6.2 logical qubits per second on each link in the system, which translates to 3,300 physical teleportations per second on each link. Starting from a Bell state with fidelity F∈=∈0.638, as a qubus-based cavity QED interconnect might generate with a qubit-to-qubit loss of 3.4dB, about 1.5 million physical entanglement attempts per second are enough to reach this level of performance. Our analysis suggests that systems capable of solving classically intractable problems are well within reach; once basic technological hurdles are overcome, the multicomputer architecture supports rapid scaling to very large systems.

AB - We have created the architecture of a quantum multicomputer and analyzed its performance for running Shor's algorithm for factoring large numbers. In this paper, we combine fault tolerance techniques with performance goals for our architecture, which uses a linear interconnect and six logical qubits per node. Our performance target of factoring a 1,024-bit number in one month requires teleporting 6.2 logical qubits per second on each link in the system, which translates to 3,300 physical teleportations per second on each link. Starting from a Bell state with fidelity F∈=∈0.638, as a qubus-based cavity QED interconnect might generate with a qubit-to-qubit loss of 3.4dB, about 1.5 million physical entanglement attempts per second are enough to reach this level of performance. Our analysis suggests that systems capable of solving classically intractable problems are well within reach; once basic technological hurdles are overcome, the multicomputer architecture supports rapid scaling to very large systems.

UR - http://www.scopus.com/inward/record.url?scp=58049091813&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58049091813&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-89304-2_10

DO - 10.1007/978-3-540-89304-2_10

M3 - Conference contribution

AN - SCOPUS:58049091813

SN - 3540893032

SN - 9783540893035

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 105

EP - 114

BT - Theory of Quantum Computation, Communication, and Cryptography - Third Workshop, TQC 2008, Revised Selected Papers

PB - Springer Verlag

T2 - 3rd Workshop on Theory of Quantum Computation, Communication, and Cryptography, TQC 2008

Y2 - 30 January 2008 through 1 February 2008

ER -