Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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 access
Meter, Rodney Van, Munro, W. J., Nemoto, Kae, Itoh, Kohei M. · 2008 · ACM Journal on Emerging Technologies in Computing Systems

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.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1324177.1324179

Cites

58 of 58 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 57 references

Research works printed but not linked: 14

  1. ACM., 2006, Proceedings of the 33rd Annual International Symposium on Computer Architecture.
  2. 10.5555/795666.796591 · doi:10.5555/795666.796591
  3. 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.
  4. 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.
  5. Grover L. K. 1997. Quantum telecomputation. http://arXiv.org/quant-ph/9704012. Grover L. K. 1997. Quantum telecomputation. http://arXiv.org/quant-ph/9704012.
  6. 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.
  7. 10.5555/2011656.2011657 · doi:10.5555/2011656.2011657
  8. 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.
  9. 10.5555/874062.875509 · doi:10.5555/874062.875509
  10. 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
  11. Szymanski T., Proceedings of the 2nd Workshop on Massively Parallel Processing Using Optical Interconnections. IEEE.
  12. Thaker D. D., Proceedings of the 33rd Annual International Symposium on Computer Architecture.
  13. 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.
  14. 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

  • Inside Quantum Repeaters

    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-citation
  • Efficient 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]).”
    MethodInfluential
  • Quantum 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].”
    Background
  • System 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

See all 65

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
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.