Physics – Quantum Physics
Scientific paper
2006-07-24
ACM J. Emerging Technologies in Computing Systems, 3(4), Jan. 2008
Physics
Quantum Physics
24 pages, 10 figures, ACM transactions format. Extended version of Int. Symp. on Comp. Architecture (ISCA) paper; v2, correct
Scientific paper
10.1145/1324177.1324179
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.
Itoh Kohei M.
Meter Rodney Van
Munro William J.
Nemoto Kae
No associations
LandOfFree
Arithmetic on a Distributed-Memory Quantum Multicomputer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Arithmetic on a Distributed-Memory Quantum Multicomputer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Arithmetic on a Distributed-Memory Quantum Multicomputer will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-585197