Arithmetic on a Distributed-Memory Quantum Multicomputer
arXiv:quant-ph/0607160 · doi:10.1145/1324177.1324179
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.
24 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
References in corpus (30)
- Experimental quantum teleportation
- Circuit Quantum Electrodynamics: Coherent Coupling of a Single Photon to a Cooper Pair Box
- Good Quantum Error-Correcting Codes Exist
- Coherent control of macroscopic quantum states in a single-Cooper-pair box
- Quantum Teleportation is a Universal Computational Primitive
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- Quantum Networks for Elementary Arithmetic Operations
- Observation of coherent oscillation of a single nuclear spin and realization of a two-qubit conditional quantum gate
- On the role of entanglement in quantum computational speed-up
- Distributed Quantum Computation over Noisy Channels
- A near deterministic linear optical CNOT gate
- Spontaneous Emission Spectrum in Double Quantum Dot Devices
- Overhead and noise threshold of fault-tolerant quantum error correction
- Quantum State Transfer Between Matter and Light
- Adaptive homodyne measurement of optical phase
- Weak nonlinearities: A new route to optical quantum computation
- Hybrid quantum repeater using bright coherent light
- Fault-tolerant quantum repeaters with minimal physical resources, and implementations based on single photon emitters
- Efficient Networks for Quantum Factoring
- Quantum Computation by Communication
- Fast Quantum Modular Exponentiation
- Repeat-Until-Success quantum computing using stationary and flying qubits
- Quantum Gates and Circuits
- Entanglement between an electron and a nuclear spin 1/2
- Distributed quantum computing: A distributed Shor algorithm
- Factoring in a Dissipative Quantum Computer
- Communication Links for Distributed Quantum Computation
- Scalable Error Correction in Distributed Ion Trap Computers
- Programmable Logic Devices in Experimental Quantum Optics
- Type-II Quantum Algorithms
Cited by in corpus (26)
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Efficient Distributed Quantum Computing
- Quantum arithmetic with the Quantum Fourier Transform
- System Design for a Long-Line Quantum Repeater
- Compiler Design for Distributed Quantum Computing
- Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
- A high bandwidth quantum repeater
- A Modular Quantum Compilation Framework for Distributed Quantum Computing
- Design of Efficient Reversible Logic Based Binary and BCD Adder Circuits
- Distributed Quantum Computing and Network Control for Accelerated VQE
- Long-range big quantum-data transmission
- Recursive quantum repeater networks
- Designing a Million-Qubit Quantum Computer Using Resource Performance Simulator
- Entanglement-efficient bipartite-distributed quantum computing
- Toward Automatic Verification of Quantum Programs
- Networked Quantum Services
- Mixed-state quantum transport in correlated spin networks
- Unitary Entanglement Construction in Hierarchical Networks
- Distributed Quantum Computing with QMPI
- Absorption-based Quantum Communication with NV centres
- Resource-aware System Architecture Model for Implementation of Quantum aided Byzantine Agreement on Quantum Repeater Networks
- Modeling Short-Range Microwave Networks to Scale Superconducting Quantum Computation
- The Complexity of Being Entangled
- Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access Memory for Parallel Queries
- Online Job Scheduler for Fault-tolerant Quantum Multiprogramming
- Exploration of Design Alternatives for Reducing Idle Time in Shor's Algorithm: A Study on Monolithic and Distributed Quantum Systems