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
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
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733
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
Rapid 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
Good 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
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
Vandersypen, L. M. K., Steffen, M., Breyta, G., Yannoni, C. S., Sherwood, M. H., & Chuang, I. L. (2001) · Nature · doi:10.1038/414883a · Cited by 1,738
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655
DiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651
Architecture for a large-scale ion-trap quantum computer
Kielpinski, D., Monroe, C., & Wineland, D. J. (2002) · Nature · doi:10.1038/nature00784 · Cited by 1,589
Indistinguishable photons from a single-photon device
Santori, C., Fattal, D., Vučković, J., Solomon, G. S., & Yamamoto, Y. (2002) · Nature · doi:10.1038/nature01086 · Cited by 1,559
Experimental one-way quantum computing
Walther, P., Resch, K. J., Rudolph, T., Schenck, E., Weinfurter, H., Vedral, V., Aspelmeyer, M., & Zeilinger, A. (2005) · Nature · doi:10.1038/nature03347 · Cited by 1,273
NMR techniques for quantum control and computation
Vandersypen, L. M. K., & Chuang, I. L. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.76.1037 · Cited by 1,217
Two-bit gates are universal for quantum computation
DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069
Preskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994
Demonstration of an all-optical quantum controlled-NOT gate
O'Brien, J. L., Pryde, G. J., White, A. G., Ralph, T. C., & Branning, D. (2003) · Nature · doi:10.1038/nature02054 · Cited by 992
Universal quantum computation with the exchange interaction
DiVincenzo, D. P., Bacon, D., Kempe, J., Burkard, G., & Whaley, K. B. (2000) · Nature · doi:10.1038/35042541 · Cited by 924
Realization of the Cirac–Zoller controlled-NOT quantum gate
Schmidt-Kaler, F., Häffner, H., Riebe, M., Gulde, S., Lancaster, G. P. T., Deuschle, T., Becher, C., Roos, C. F., Eschner, J., & Blatt, R. (2003) · Nature · doi:10.1038/nature01494 · Cited by 875 · cited 1×
“Initially designed and built at NIST, this is a proposal to scale up an ion trap quantum computer [Cirac and Zoller 1995; Steane 1997; Sørensen and Mølmer 2000; Schmidt-Kaler et al. 2003].”
MethodResource-Efficient Linear Optical Quantum Computation
Browne, D. E., & Rudolph, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.010501 · Cited by 790 · cited 1×
“…timing precision [Santori et al. 2002], gates based on measurement [Knill et al. 2001; • R. Van Meter and M. Oskin Scheel et al. 2003; Knill 2003; Browne and Rudolph 2005; Yoran and Reznik 2003], and high-quality single-photon detectors [Miller et al. 2003; Waks et al. 2003; James and Kwiat…”
BackgroundA Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
Fault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631
Optical Quantum Computation Using Cluster States
Nielsen, M. A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040503 · Cited by 614 · cited 1×
“This meshes well with the capabilities of linear optics quantum computation (LOQC), so, although cluster-state computation is an abstraction, much current research excitement exists over the possibility of realizable quantum computation based on these technologies [Knill et al. 2001; Nielsen 2004].”
Realization of quantum error correction
Chiaverini, J., Leibfried, D., Schaetz, T., Barrett, M. D., Blakestad, R. B., Britton, J., Itano, W. M., Jost, J. D., Knill, E., Langer, C., et al. (2004) · Nature · doi:10.1038/nature03074 · Cited by 517
Overhead and noise threshold of fault-tolerant quantum error correction
Steane, A. M. (2003) · Physical Review A · doi:10.1103/physreva.68.042322 · Cited by 372
A new quantum ripple-carry addition circuit
Cuccaro, S. A., Draper, T. G., Kutin, S. A., & Moulton, D. P. (2004) · arXiv · doi:10.48550/arxiv.quant-ph/0410184 · Cited by 344
Experimental controlled-NOT logic gate for single photons in the coincidence basis
Pittman, T. B., Fitch, M. J., Jacobs, B. C., & Franson, J. D. (2003) · Physical Review A · doi:10.1103/physreva.68.032316 · Cited by 328
Realization of a Photonic Controlled-NOT Gate Sufficient for Quantum Computation
Gasparoni, S., Pan, J.-W., Walther, P., Rudolph, T., & Zeilinger, A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.020504 · Cited by 315
Demonstration of a low-noise near-infrared photon counter with multiphoton discrimination
Miller, A. J., Nam, S. W., Martinis, J. M., & Sergienko, A. V. (2003) · Applied Physics Letters · doi:10.1063/1.1596723 · Cited by 285
Efficient networks for quantum factoring
Beckman, D., Chari, A. N., Devabhaktuni, S., & Preskill, J. (1996) · Physical Review A · doi:10.1103/physreva.54.1034 · Cited by 268 · cited 5×
“Researchers have worked on the overall exponentiation algorithm [Vedral et al. 1996; Beckman et al. 1996; Zalka 1998], and on arithmetic building blocks [Gossett 1998; Draper 2000; Cuccaro et al.”
MethodInfluentialFast quantum modular exponentiation
Van Meter, R., & Itoh, K. M. (2005) · Physical Review A · doi:10.1103/physreva.71.052320 · Cited by 181
Ralph, T. C., Hayes, A. J. F., & Gilchrist, A. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.100501 · Cited by 172
Fault-tolerant quantum computation with cluster states
Nielsen, M. A., & Dawson, C. M. (2005) · Physical Review A · doi:10.1103/physreva.71.042323 · Cited by 161 · cited 1×
“Recent research has proposed using the cluster state as the “bottom” architectural layer, with fault tolerance as a middle layer and the application algorithm on top [Nielsen and Dawson 2004; Dawson et al. 2005; Varnava et al. 2005].”
MethodRepeat-until-success quantum computing using stationary and flying qubits
Lim, Y. L., Barrett, S. D., Beige, A., Kok, P., & Kwek, L. C. (2006) · Physical Review A · doi:10.1103/physreva.73.012304 · Cited by 138
A logarithmic-depth quantum carry-lookahead adder
Draper, T. G., Kutin, S. A., Rains, E. M., & Svore, K. M. (2006) · Quantum Information and Computation · doi:10.26421/qic6.4-5-4 · Cited by 101
Fast versions of Shor's quantum factoring algorithm
Zalka, C. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9806084 · Cited by 73
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
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.