Arithmetic on a distributed-memory quantum multicomputer

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

Research output: Contribution to journalArticle

26 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
Article number2
JournalACM Journal on Emerging Technologies in Computing Systems
Volume3
Issue number4
DOIs
Publication statusPublished - 2008 Jan 1

Fingerprint

Data storage equipment
Topology
Linear networks
Quantum computers
Adders
Transceivers
Bandwidth

Keywords

  • Quantum computer architecture
  • Quantum computing

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software
  • Electrical and Electronic Engineering

Cite this

Arithmetic on a distributed-memory quantum multicomputer. / Van Meter, Rodney D; Munro, W. J.; Nemoto, Kae; Itoh, Kohei M.

In: ACM Journal on Emerging Technologies in Computing Systems, Vol. 3, No. 4, 2, 01.01.2008.

Research output: Contribution to journalArticle

@article{301db4c80cf54b18a4c03181ec57567f,
title = "Arithmetic on a distributed-memory 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.",
keywords = "Quantum computer architecture, Quantum computing",
author = "{Van Meter}, {Rodney D} and Munro, {W. J.} and Kae Nemoto and Itoh, {Kohei M}",
year = "2008",
month = "1",
day = "1",
doi = "10.1145/1324177.1324179",
language = "English",
volume = "3",
journal = "ACM Journal on Emerging Technologies in Computing Systems",
issn = "1550-4832",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - Arithmetic on a distributed-memory quantum multicomputer

AU - Van Meter, Rodney D

AU - Munro, W. J.

AU - Nemoto, Kae

AU - Itoh, Kohei M

PY - 2008/1/1

Y1 - 2008/1/1

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.

KW - Quantum computer architecture

KW - Quantum computing

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

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

U2 - 10.1145/1324177.1324179

DO - 10.1145/1324177.1324179

M3 - Article

VL - 3

JO - ACM Journal on Emerging Technologies in Computing Systems

JF - ACM Journal on Emerging Technologies in Computing Systems

SN - 1550-4832

IS - 4

M1 - 2

ER -