Architecture-dependent execution time of Shor's algorithm

Rodney D Van Meter, Kohei M Itoh, Thaddeus D. Ladd

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

We show how the execution time of algorithms on quantum computers depends on the architecture of the quantum computer, the choice of algorithms (including subroutines such as arithmetic), and the "clock speed" of the quantum computer. The primary architectural features of interest are the ability to execute multiple gates concurrently, the number of application-level qubits available, and the interconnection network of qubits. We analyze Shor's algorithm for factoring large numbers in this context. Our results show that, if arbitrary interconnection of qubits is possible, a machine with an application-level clock speed of as low as one-third of a (possibly encoded) gate per second could factor a 576-bit number in under one month, potentially outperforming a large network of classical computers. For nearest-neighbor-only architectures, a clock speed of around twenty-seven gates per second is required.

Original languageEnglish
Title of host publicationMS+S 2006 - Controllable Quantum States: Mesoscopic Superconductivity and Spintronics, Proceedings of the International Symposium
PublisherWorld Scientific Publishing Co. Pte Ltd
Pages183-188
Number of pages6
ISBN (Print)9812814612, 9789812814616
Publication statusPublished - 2008
Event4th International Symposium on Mesoscopic Superconductivity and Spintronics, MS+S 2006 - Atsugi, Japan
Duration: 2006 Feb 272006 Mar 2

Other

Other4th International Symposium on Mesoscopic Superconductivity and Spintronics, MS+S 2006
CountryJapan
CityAtsugi
Period06/2/2706/3/2

Fingerprint

Quantum computers
Clocks
Subroutines

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Van Meter, R. D., Itoh, K. M., & Ladd, T. D. (2008). Architecture-dependent execution time of Shor's algorithm. In MS+S 2006 - Controllable Quantum States: Mesoscopic Superconductivity and Spintronics, Proceedings of the International Symposium (pp. 183-188). World Scientific Publishing Co. Pte Ltd.

Architecture-dependent execution time of Shor's algorithm. / Van Meter, Rodney D; Itoh, Kohei M; Ladd, Thaddeus D.

MS+S 2006 - Controllable Quantum States: Mesoscopic Superconductivity and Spintronics, Proceedings of the International Symposium. World Scientific Publishing Co. Pte Ltd, 2008. p. 183-188.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Van Meter, RD, Itoh, KM & Ladd, TD 2008, Architecture-dependent execution time of Shor's algorithm. in MS+S 2006 - Controllable Quantum States: Mesoscopic Superconductivity and Spintronics, Proceedings of the International Symposium. World Scientific Publishing Co. Pte Ltd, pp. 183-188, 4th International Symposium on Mesoscopic Superconductivity and Spintronics, MS+S 2006, Atsugi, Japan, 06/2/27.
Van Meter RD, Itoh KM, Ladd TD. Architecture-dependent execution time of Shor's algorithm. In MS+S 2006 - Controllable Quantum States: Mesoscopic Superconductivity and Spintronics, Proceedings of the International Symposium. World Scientific Publishing Co. Pte Ltd. 2008. p. 183-188
Van Meter, Rodney D ; Itoh, Kohei M ; Ladd, Thaddeus D. / Architecture-dependent execution time of Shor's algorithm. MS+S 2006 - Controllable Quantum States: Mesoscopic Superconductivity and Spintronics, Proceedings of the International Symposium. World Scientific Publishing Co. Pte Ltd, 2008. pp. 183-188
@inproceedings{6904df0630ce41f3a7058d974555ef78,
title = "Architecture-dependent execution time of Shor's algorithm",
abstract = "We show how the execution time of algorithms on quantum computers depends on the architecture of the quantum computer, the choice of algorithms (including subroutines such as arithmetic), and the {"}clock speed{"} of the quantum computer. The primary architectural features of interest are the ability to execute multiple gates concurrently, the number of application-level qubits available, and the interconnection network of qubits. We analyze Shor's algorithm for factoring large numbers in this context. Our results show that, if arbitrary interconnection of qubits is possible, a machine with an application-level clock speed of as low as one-third of a (possibly encoded) gate per second could factor a 576-bit number in under one month, potentially outperforming a large network of classical computers. For nearest-neighbor-only architectures, a clock speed of around twenty-seven gates per second is required.",
author = "{Van Meter}, {Rodney D} and Itoh, {Kohei M} and Ladd, {Thaddeus D.}",
year = "2008",
language = "English",
isbn = "9812814612",
pages = "183--188",
booktitle = "MS+S 2006 - Controllable Quantum States: Mesoscopic Superconductivity and Spintronics, Proceedings of the International Symposium",
publisher = "World Scientific Publishing Co. Pte Ltd",

}

TY - GEN

T1 - Architecture-dependent execution time of Shor's algorithm

AU - Van Meter, Rodney D

AU - Itoh, Kohei M

AU - Ladd, Thaddeus D.

PY - 2008

Y1 - 2008

N2 - We show how the execution time of algorithms on quantum computers depends on the architecture of the quantum computer, the choice of algorithms (including subroutines such as arithmetic), and the "clock speed" of the quantum computer. The primary architectural features of interest are the ability to execute multiple gates concurrently, the number of application-level qubits available, and the interconnection network of qubits. We analyze Shor's algorithm for factoring large numbers in this context. Our results show that, if arbitrary interconnection of qubits is possible, a machine with an application-level clock speed of as low as one-third of a (possibly encoded) gate per second could factor a 576-bit number in under one month, potentially outperforming a large network of classical computers. For nearest-neighbor-only architectures, a clock speed of around twenty-seven gates per second is required.

AB - We show how the execution time of algorithms on quantum computers depends on the architecture of the quantum computer, the choice of algorithms (including subroutines such as arithmetic), and the "clock speed" of the quantum computer. The primary architectural features of interest are the ability to execute multiple gates concurrently, the number of application-level qubits available, and the interconnection network of qubits. We analyze Shor's algorithm for factoring large numbers in this context. Our results show that, if arbitrary interconnection of qubits is possible, a machine with an application-level clock speed of as low as one-third of a (possibly encoded) gate per second could factor a 576-bit number in under one month, potentially outperforming a large network of classical computers. For nearest-neighbor-only architectures, a clock speed of around twenty-seven gates per second is required.

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

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

M3 - Conference contribution

SN - 9812814612

SN - 9789812814616

SP - 183

EP - 188

BT - MS+S 2006 - Controllable Quantum States: Mesoscopic Superconductivity and Spintronics, Proceedings of the International Symposium

PB - World Scientific Publishing Co. Pte Ltd

ER -