Arithmetic on a distributed-memory quantum multicomputer

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

Research output: Contribution to journalArticle

28 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

Keywords

  • Quantum computer architecture
  • Quantum computing

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Arithmetic on a distributed-memory quantum multicomputer'. Together they form a unique fingerprint.

  • Cite this