Architectural implications of quantum computing technologies
The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Abstract
In this article we present a classification scheme for quantum computing technologies that is based on the characteristics most relevant to computer systems architecture. The engineering trade-offs of execution speed, decoherence of the quantum states, and size of systems are described. Concurrency, storage capacity, and interconnection network topology influence algorithmic efficiency, while quantum error correction and necessary quantum state measurement are the ultimate drivers of logical clock speed. We discuss several proposed technologies. Finally, we use our taxonomy to explore architectural implications for common arithmetic circuits, examine the implementation of quantum error correction, and discuss cluster-state quantum computation.
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
A 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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840 · cited 3×
“[2000] proposed that the only operation needed is an exchange between two neighboring qubits, accomplished by lowering the electrical potential and allowing the electrons to tunnel [DiVincenzo et al. 2000; Loss and DiVincenzo 1998; Myrgren and Whaley 2003].”
BackgroundA scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
Validity of the single processor approach to achieving large scale computing capabilities
Amdahl, G. M. (1967) · Proceedings of the April 18-20, 1967, spring joint computer conference on - AFIPS '67 (Spring) · doi:10.1145/1465482.1465560 · Cited by 4,339
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Cited by
Layered architecture for quantum computing
Jones, N. C., Van Meter, R., Fowler, A. G., McMahon, P. L., Kim, J., Ladd, T. D., & Yamamoto, Y. (2012) · Physical Review X · doi:10.1103/physrevx.2.031007 · Cited by 332
“…quantum computing technology [3] and Steane emphasized the difficulty of designing systems capable of running quantum error correction (QEC) adequately [4, 5], several groups of researchers have outlined various additional taxonomies addressing the architectural needs of large-scale systems [6, 7].”
BackgroundSynthesis and optimization of reversible circuits—a survey
Saeedi, M., & Markov, I. L. (2013) · ACM Computing Surveys · doi:10.1145/2431211.2431220 · Cited by 298
Co-designing a scalable quantum computer with trapped atomic ions
Brown, K. R., Kim, J., & Monroe, C. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.34 · Cited by 250
“Even in the face of Moore’s Law, or the doubling in conventional computer power every year or two, the complexity of massively entangled quantum states of just a few hundred qubits can easily eclipse the capacity of classical information processing.(4) There are but a few known applications that exploit this quantum a…”
BackgroundQuantum computing for healthcare: a review
Ur Rasool, R., Ahmad, H. F., Rafique, W., Qayyum, A., Qadir, J., & Anwar, Z. (2023) · Future Internet · doi:10.3390/fi15030094 · Cited by 242
DISTRIBUTED QUANTUM COMPUTATION ARCHITECTURE USING SEMICONDUCTOR NANOPHOTONICS
VAN METER, R., LADD, T. D., FOWLER, A. G., & YAMAMOTO, Y. (2010) · International Journal of Quantum Information · doi:10.1142/s0219749910006435 · Cited by 109
Metadata
- Authors
- Meter, R. V., & Oskin, M.
- Venue
- ACM Journal on Emerging Technologies in Computing Systems
- Published
- 2006-01
- Volume
- 2
- Issue
- 1
- Pages
- 31-63
- ISSN
- 1550-4832 (ISSN-L)
- 1550-4840
- OpenAlex
- W2136744126
- Cited by
- 96
- References
- 46
- FWCI
- 8.80
- Type
- journal article
- Language
- en
- Open access
- closed
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: Architectural implications of quantum computing technologies. https://app.cochat.ai/papers/10.1145/1126257.1126259
- The paper
- Meter, R. V., & Oskin, M. (2006). Architectural implications of quantum computing technologies. ACM Journal on Emerging Technologies in Computing Systems. https://doi.org/10.1145/1126257.1126259
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.