Distributed arithmetic on a quantum multicomputer

Rodney Van Meter, W. J. Munro, Kae Nemoto, Kohei M. Itoh

研究成果: Conference contribution

15 被引用数 (Scopus)

抄録

We evaluate the performance of quantum arithmetic algorithms run on a distributed quantum computer (a quantum multicomputer). We vary the node capacity and I/O capabilities, and the network topology. The tradeoff of choosing between gates executed remotely, through "teleported gates" on entangled pairs of qubits (telegate), versus exchanging the relevant qubits via quantum teleportation, then executing the algorithm using local gates (teledata), is examined. We show that the teledata approach performs better, and that carry-ripple adders perform well when the teleportation block is decomposed so that the key quantum operations can be parallelized. A node size of only a few logical qubits performs adequately provided that the nodes have two transceiver qubits. A linear network topology performs acceptably for a broad range of system sizes and performance parameters. We therefore recommend pursuing small, high-I/O bandwidth nodes and a simple network. Such a machine will run Shor's algorithm for factoring large numbers efficiently.

本文言語English
ホスト出版物のタイトルProceedings - 33rd International Symposium on Computer Architecture,ISCA 2006
ページ354-365
ページ数12
DOI
出版ステータスPublished - 2006
イベント33rd International Symposium on Computer Architecture, ISCA 2006 - Boston, MA, United States
継続期間: 2006 6 172006 6 21

出版物シリーズ

名前Proceedings - International Symposium on Computer Architecture
2006
ISSN(印刷版)1063-6897

Other

Other33rd International Symposium on Computer Architecture, ISCA 2006
CountryUnited States
CityBoston, MA
Period06/6/1706/6/21

ASJC Scopus subject areas

  • Engineering(all)

フィンガープリント 「Distributed arithmetic on a quantum multicomputer」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル