Architecture-dependent execution time of Shor's algorithm

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

研究成果: Conference contribution

8 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルMS+S 2006 - Controllable Quantum States
ホスト出版物のサブタイトルMesoscopic Superconductivity and Spintronics, Proceedings of the International Symposium
出版社World Scientific Publishing Co. Pte Ltd
ページ183-188
ページ数6
ISBN(印刷版)9812814612, 9789812814616
出版ステータスPublished - 2008
イベント4th International Symposium on Mesoscopic Superconductivity and Spintronics, MS+S 2006 - Atsugi, Japan
継続期間: 2006 2 272006 3 2

出版物シリーズ

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

Other

Other4th International Symposium on Mesoscopic Superconductivity and Spintronics, MS+S 2006
国/地域Japan
CityAtsugi
Period06/2/2706/3/2

ASJC Scopus subject areas

  • 電子工学および電気工学

フィンガープリント

「Architecture-dependent execution time of Shor's algorithm」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル