Distributed arithmetic on a quantum multicomputer

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

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

18 Citations (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.

Original languageEnglish
Title of host publicationProceedings - 33rd International Symposium on Computer Architecture,ISCA 2006
Number of pages12
Publication statusPublished - 2006
Event33rd International Symposium on Computer Architecture, ISCA 2006 - Boston, MA, United States
Duration: 2006 Jun 172006 Jun 21

Publication series

NameProceedings - International Symposium on Computer Architecture
ISSN (Print)1063-6897


Other33rd International Symposium on Computer Architecture, ISCA 2006
Country/TerritoryUnited States
CityBoston, MA

ASJC Scopus subject areas

  • Engineering(all)


Dive into the research topics of 'Distributed arithmetic on a quantum multicomputer'. Together they form a unique fingerprint.

Cite this