Arithmetic on a Distributed-Memory Quantum Multicomputer

Simple item page
dc.creatorVan Meter, Rodney
dc.creatorMunro, W. J.
dc.creatorNemoto, Kae
dc.creatorItoh, Kohei M.
dc.date2006-07-24
dc.date2007-03-06
dc.date.accessioned2026-07-07T09:20:01Z
dc.date.available2026-07-07T09:20:01Z
dc.descriptionWe 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.
dc.description24 pages, 10 figures, ACM transactions format. Extended version of Int. Symp. on Comp. Architecture (ISCA) paper; v2, correct one circuit error, numerous small changes for clarity, add references
dc.identifierhttps://arxiv.org/abs/quant-ph/0607160
dc.identifierhttp://arxiv.org/abs/quant-ph/0607160
dc.identifierACM J. Emerging Technologies in Computing Systems, 3(4), Jan. 2008
dc.identifierdoi:10.1145/1324177.1324179
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/154603
dc.subjectQuantum Physics
dc.titleArithmetic on a Distributed-Memory Quantum Multicomputer
dc.typetext

Files

Collections

arXiv