Distributed arithmetic on a quantum multicomputer

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

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

14 Citations (Scopus)

Abstract

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 - International Symposium on Computer Architecture
Pages354-365
Number of pages12
Volume2006
DOIs
Publication statusPublished - 2006
Event33rd International Symposium on Computer Architecture, ISCA 2006 - Boston, MA, United States
Duration: 2006 Jun 172006 Jun 21

Other

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

Fingerprint

Topology
Linear networks
Quantum computers
Adders
Transceivers
Bandwidth

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Van Meter, R. D., Munro, W. J., Nemoto, K., & Itoh, K. M. (2006). Distributed arithmetic on a quantum multicomputer. In Proceedings - International Symposium on Computer Architecture (Vol. 2006, pp. 354-365). [1635966] https://doi.org/10.1109/ISCA.2006.19

Distributed arithmetic on a quantum multicomputer. / Van Meter, Rodney D; Munro, W. J.; Nemoto, Kae; Itoh, Kohei M.

Proceedings - International Symposium on Computer Architecture. Vol. 2006 2006. p. 354-365 1635966.

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

Van Meter, RD, Munro, WJ, Nemoto, K & Itoh, KM 2006, Distributed arithmetic on a quantum multicomputer. in Proceedings - International Symposium on Computer Architecture. vol. 2006, 1635966, pp. 354-365, 33rd International Symposium on Computer Architecture, ISCA 2006, Boston, MA, United States, 06/6/17. https://doi.org/10.1109/ISCA.2006.19
Van Meter RD, Munro WJ, Nemoto K, Itoh KM. Distributed arithmetic on a quantum multicomputer. In Proceedings - International Symposium on Computer Architecture. Vol. 2006. 2006. p. 354-365. 1635966 https://doi.org/10.1109/ISCA.2006.19
Van Meter, Rodney D ; Munro, W. J. ; Nemoto, Kae ; Itoh, Kohei M. / Distributed arithmetic on a quantum multicomputer. Proceedings - International Symposium on Computer Architecture. Vol. 2006 2006. pp. 354-365
@inproceedings{de566f955dae4008bb30f0241c58dac0,
title = "Distributed arithmetic on a quantum multicomputer",
abstract = "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.",
author = "{Van Meter}, {Rodney D} and Munro, {W. J.} and Kae Nemoto and Itoh, {Kohei M}",
year = "2006",
doi = "10.1109/ISCA.2006.19",
language = "English",
isbn = "076952608X",
volume = "2006",
pages = "354--365",
booktitle = "Proceedings - International Symposium on Computer Architecture",

}

TY - GEN

T1 - Distributed arithmetic on a quantum multicomputer

AU - Van Meter, Rodney D

AU - Munro, W. J.

AU - Nemoto, Kae

AU - Itoh, Kohei M

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/ISCA.2006.19

DO - 10.1109/ISCA.2006.19

M3 - Conference contribution

SN - 076952608X

SN - 9780769526089

VL - 2006

SP - 354

EP - 365

BT - Proceedings - International Symposium on Computer Architecture

ER -