dorsal/arxiv
View SchemaArithmetic on a Distributed-Memory Quantum Multicomputer
| Authors | Rodney Van Meter, W. J. Munro, Kae Nemoto, Kohei M. Itoh |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0607160 |
| URL | https://arxiv.org/abs/quant-ph/0607160 |
| DOI | 10.1145/1324177.1324179 |
| Journal | ACM J. Emerging Technologies in Computing Systems, 3(4), Jan. 2008 |
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.
{
"annotation_id": "fb0a5985-9e9e-4b00-864a-3c8538db6a8c",
"date_created": "2026-03-02T18:02:27.558000Z",
"date_modified": "2026-03-02T18:02:27.558000Z",
"file_hash": "b53a90c6a1669127e6fca066bc3946f476caf05ca4c926502f59bc4eab636481",
"private": false,
"record": {
"abstract": "We evaluate the performance of quantum arithmetic algorithms run on a\ndistributed quantum computer (a quantum multicomputer). We vary the node\ncapacity and I/O capabilities, and the network topology. The tradeoff of\nchoosing between gates executed remotely, through ``teleported gates\u0027\u0027 on\nentangled pairs of qubits (telegate), versus exchanging the relevant qubits via\nquantum teleportation, then executing the algorithm using local gates\n(teledata), is examined. We show that the teledata approach performs better,\nand that carry-ripple adders perform well when the teleportation block is\ndecomposed so that the key quantum operations can be parallelized. A node size\nof only a few logical qubits performs adequately provided that the nodes have\ntwo transceiver qubits. A linear network topology performs acceptably for a\nbroad range of system sizes and performance parameters. We therefore recommend\npursuing small, high-I/O bandwidth nodes and a simple network. Such a machine\nwill run Shor\u0027s algorithm for factoring large numbers efficiently.",
"arxiv_id": "quant-ph/0607160",
"authors": [
"Rodney Van Meter",
"W. J. Munro",
"Kae Nemoto",
"Kohei M. Itoh"
],
"categories": [
"quant-ph"
],
"doi": "10.1145/1324177.1324179",
"journal_ref": "ACM J. Emerging Technologies in Computing Systems, 3(4), Jan. 2008",
"title": "Arithmetic on a Distributed-Memory Quantum Multicomputer",
"url": "https://arxiv.org/abs/quant-ph/0607160"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "6bcce8c6-71a5-4557-8d33-c73bbbf9675e",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}