A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Optically augmented 3-D computer: system technology and architecture
Journal of Parallel and Distributed Computing - Special issue on parallel computing with optical interconnects
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Quantum computation and quantum information
Quantum computation and quantum information
The effect of communication costs in solid-state quantum computing architectures
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Design of a terabit free-space photonic backplane for parallel computing
MPPOI '95 Proceedings of the Second Workshop on Massively Parallel Processing Using Optical Interconnections
Building quantum wires: the long and the short of it
Proceedings of the 30th annual international symposium on Computer architecture
Fault-tolerant quantum computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Proceedings of the 32nd annual international symposium on Computer Architecture
Architectural implications of quantum computing technologies
ACM Journal on Emerging Technologies in Computing Systems (JETC)
System design for large-scale ion trap quantum information processor
Quantum Information & Computation
A logarithmic-depth quantum carry-lookahead adder
Quantum Information & Computation
Communication Links for Distributed Quantum Computation
IEEE Transactions on Computers
Arithmetic on a distributed-memory quantum multicomputer
ACM Journal on Emerging Technologies in Computing Systems (JETC)
High-level interconnect model for the quantum logic array architecture
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Integrated optical approach to trapped ion quantum computation
Quantum Information & Computation
Quantum rotations: a case study in static and dynamic machine-code generation for quantum computers
Proceedings of the 40th Annual International Symposium on Computer Architecture
| Hi-index | 0.00 |
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.