The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
Arithmetic on a distributed-memory quantum multicomputer
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703 · cited 2×
“Teleportation of quantum states (qubits, or quantum data) has been known for more than a decade [Bennett et al. 1993].”
BackgroundMethodA fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Experimental quantum teleportation
Bouwmeester, D., Pan, J.-W., Mattle, K., Eibl, M., Weinfurter, H., & Zeilinger, A. (1997) · Nature · doi:10.1038/37539 · Cited by 5,545
Strong coupling of a single photon to a superconducting qubit using circuit quantum electrodynamics
Wallraff, A., Schuster, D. I., Blais, A., Frunzio, L., Huang, R. S., Majer, J., Kumar, S., Girvin, S. M., & Schoelkopf, R. J. (2004) · Nature · doi:10.1038/nature02851 · Cited by 3,796 · cited 1×
“Readers interested in more depth are referred to popular [Williams and Clearwater 1999] and technical [Nielsen and Chuang 2000] texts on the subject.”
BackgroundPrinciples and Practices of Interconnection Networks
Dally, W. J., & Towles, B. (2004) · CERN Document Server (European Organization for Nuclear Research) · Cited by 3,735
Unconditional Quantum Teleportation
Furusawa, A., Sørensen, J. L., Braunstein, S. L., Fuchs, C. A., Kimble, H. J., & Polzik, E. S. (1998) · Science · doi:10.1126/science.282.5389.706 · Cited by 3,005 · cited 2×
“It has been demonstrated experimentally [Furusawa et al. 1998; Bouwmeester et al. 1997], and has been suggested as being necessary for moving data long distances within a single quantum computer [Oskin et al. 2003].”
BackgroundRapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700 · cited 2×
“FOUNDATIONS A quantum computer is a machine that uses quantum mechanical effects to achieve potentially large reductions in the computational complexity of certain tasks [Nielsen and Chuang 2000; Shor 1994; Grover 1996; Deutsch and Jozsa 1992].”
BackgroundMethodGood quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 2×
“Quantum error correction (QEC) naturally reduces the number of available logical (application-level) qubits by a large factor [Shor 1996; Calderbank and Shor 1996; Steane 2003].”
BackgroundCoherent control of macroscopic quantum states in a single-Cooper-pair box
Nakamura, Y., Pashkin, Y. A., & Tsai, J. S. (1999) · Nature · doi:10.1038/19718 · Cited by 2,380
Research works printed but not linked: 14
- ACM., 2006, Proceedings of the 33rd Annual International Symposium on Computer Architecture.
- 10.5555/795666.796591 · doi:10.5555/795666.796591
- Draper T. G. 2000. Addition on a quantum computer. http://arXiv.org/quant-ph/0008033. Draper T. G. 2000. Addition on a quantum computer. http://arXiv.org/quant-ph/0008033.
- Gossett P. 1998. Quantum carry-save arithmetic. http://arXiv.org/quant-ph/9808061. Gossett P. 1998. Quantum carry-save arithmetic. http://arXiv.org/quant-ph/9808061.
- Grover L. K. 1997. Quantum telecomputation. http://arXiv.org/quant-ph/9704012. Grover L. K. 1997. Quantum telecomputation. http://arXiv.org/quant-ph/9704012.
- Johansson J. et al. 2005. Vacuum Rabi oscillations in a macroscopic superconducting qubit LC oscillator system. http://arXiv.org/cond-mat/0510457. Johansson J. et al. 2005. Vacuum Rabi oscillations in a macroscopic superconducting qubit LC oscillator system. http://arXiv.org/cond-mat/0510457.
- 10.5555/2011656.2011657 · doi:10.5555/2011656.2011657
- Knuth D. E. 1998. The Art of Computer Programming Seminumerical Algorithms vol 2 3rd Ed. Addison-Wesley Reading MA. Knuth D. E. 1998. The Art of Computer Programming Seminumerical Algorithms vol 2 3rd Ed. Addison-Wesley Reading MA.
- 10.5555/874062.875509 · doi:10.5555/874062.875509
- Steane A. M. 2004. How to build a 300 bit 1 Gop quantum computer. http://arxiv.org/abs/quant-ph/0412165. Steane A. M. 2004. How to build a 300 bit 1 Gop quantum computer. http://arxiv.org/abs/quant-ph/0412165. · arXiv
- Szymanski T., Proceedings of the 2nd Workshop on Massively Parallel Processing Using Optical Interconnections. IEEE.
- Thaker D. D., Proceedings of the 33rd Annual International Symposium on Computer Architecture.
- Van Meter III R. D. 2006. Architecture of a quantum multicomputer optimized for Shor's factoring algorithm. Ph.D. thesis Keio University. Van Meter III R. D. 2006. Architecture of a quantum multicomputer optimized for Shor's factoring algorithm. Ph.D. thesis Keio University.
- Zalka C. 1998. Fast versions of Shor's quantum factoring algorithm. http://arXiv.org/quant-ph/9806084. http://arXiv.org/quant-ph/9806084. Zalka C. 1998. Fast versions of Shor's quantum factoring algorithm. http://arXiv.org/quant-ph/9806084. http://arXiv.org/quant-ph/9806084.
Cited by
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
Munro, W. J., Azuma, K., Tamaki, K., & Nemoto, K. (2015) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2015.2392076 · Cited by 365
“Such signals could be used for tasks ranging from cryptography to large-scale distributed quantum computation [17]–[19].”
BackgroundSelf-citationEfficient distributed quantum computing
Beals, R., Brierley, S., Gray, O., Harrow, A. W., Kutin, S., Linden, N., Shepherd, D., & Stather, M. (2013) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2012.0686 · Cited by 208
“…summarized as relating the following three models of quantum computation presented in Table 1: the well-known circuit model (Q circuit), quantum parallel RAM (Q PRAM), and a more realistic distributed quantum computing model (DQC) (also called a quantum multi-computer by van Meter et al. [35, 36]).”
MethodInfluentialQuantum arithmetic with the quantum Fourier transform
Ruiz-Perez, L., & Garcia-Escartin, J. C. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1603-1 · Cited by 174
“There are also solutions with more of a “quantum flavour” such as teleportationbased operations [16], measurement-based schemes on cluster states [17], repeat-untilsuccess circuits [18] or implementations that restrict to experimentally achievable quantum operations like the nearest-neighbour interaction [19].”
BackgroundSystem Design for a Long-Line Quantum Repeater
Van Meter, R., Ladd, T. D., Munro, W. J., & Nemoto, K. (2009) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.927260 · Cited by 167
“In SANs for quantum multicomputers [13], [51], fiber losses will be low, but losses elsewhere in the system (e.”
BackgroundSelf-citation
Metadata
- Authors
- Meter, R. V., Munro, W. J., Nemoto, K., & Itoh, K. M.
- Affiliations
- Keio University (JP)
- Hewlett-Packard (United Kingdom) (GB)
- National Institute of Informatics (JP)
- Venue
- ACM Journal on Emerging Technologies in Computing Systems
- Published
- 2008-01
- Volume
- 3
- Issue
- 4
- Pages
- 1-23
- ISSN
- 1550-4832 (ISSN-L)
- 1550-4840
- OpenAlex
- W2019843282
- Cited by
- 65
- References
- 57
- Citations by year
- 2026: 1 · 2025: 10 · 2024: 5 · 2023: 10 · 2022: 2 · 2021: 9 · 2020: 2 · 2019: 2 · 2018: 4 · 2017: 3 · 2016: 2 · 2015: 3 · 2014: 1 · 2013: 2 · 2012: 1
- FWCI
- 4.23
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- ACM Journal on Emerging Technologies in Computing Systems (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Keywords
- quantum arithmetic, distributed quantum computing, quantum teleportation, parallelization, network topology, node capacity, I/O bandwidth, Shor's algorithm, quantum factoring
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Arithmetic on a distributed-memory quantum multicomputer. https://app.cochat.ai/papers/10.1145/1324177.1324179
- The paper
- Meter, R. V., Munro, W. J., Nemoto, K., & Itoh, K. M. (2008). Arithmetic on a distributed-memory quantum multicomputer. ACM Journal on Emerging Technologies in Computing Systems. https://doi.org/10.1145/1324177.1324179
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.