The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
The Path to Scalable Distributed Quantum Computing
Open accessAbstract
Researchers are fabricating quantum processors powerful enough to execute small instances of quantum algorithms. Scalability concerns are motivating distributed-memory multicomputer architectures, and experimental efforts have demonstrated some of the building blocks for such a design. Numberous systems are emerging with the goal of enabling local and distributed quantum computing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
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
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840
A 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
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Signatures of Majorana Fermions in Hybrid Superconductor-Semiconductor Nanowire Devices
Mourik, V., Zuo, K., Frolov, S. M., Plissard, S. R., Bakkers, E. P. A. M., & Kouwenhoven, L. P. (2012) · Science · doi:10.1126/science.1222360 · Cited by 4,163 · cited 1×
“The second reason for casting anyonic computing as a 4th generation system is that we need to reliably demonstrate the existence of anyonic particles within engineered systems [104, 105].”
BackgroundA 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
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 4×
“Several detailed reviews of the topological coding model cover the functioning of both the error correction and logical computation [13, 32, 33, 34].”
BackgroundInfluentialLoophole-free Bell inequality violation using electron spins separated by 1.3 kilometres
Hensen, B., Bernien, H., Dréau, A. E., Reiserer, A., Kalb, N., Blok, M. S., Ruitenberg, J., Vermeulen, R. F. L., Schouten, R. N., Abellán, C., et al. (2015) · Nature · doi:10.1038/nature15759 · Cited by 2,852
Quantum dynamics of single trapped ions
Leibfried, D., Blatt, R., Monroe, C., & Wineland, D. (2003) · Reviews of Modern Physics · doi:10.1103/revmodphys.75.281 · Cited by 2,739
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
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
Demonstration of a Fundamental Quantum Logic Gate
Monroe, C., Meekhof, D. M., King, B. E., Itano, W. M., & Wineland, D. J. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4714 · Cited by 1,586
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
Cleve, R., Gottesman, D., & Lo, H.-K. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.648 · Cited by 1,373
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
O'Brien, J. L. (2007) · Science · doi:10.1126/science.1142892 · Cited by 1,221 · cited 1×
“Early efforts were extremely successful, with high fidelity circuits performing small quantum programs [57, 58].”
BackgroundHeralded entanglement between solid-state qubits separated by three metres
Bernien, H., Hensen, B., Pfaff, W., Koolstra, G., Blok, M. S., Robledo, L., Taminiau, T. H., Markham, M., Twitchen, D. J., Childress, L., et al. (2013) · Nature · doi:10.1038/nature12016 · Cited by 1,187
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071 · cited 1×
“The algorithms are of increasing breadth, ranging from quantum chemistry to astrophysics to machine learning-relevant matrix operations [7, 8, 9].”
BackgroundDemonstration 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
Reference frames, superselection rules, and quantum information
Bartlett, S. D., Rudolph, T., & Spekkens, R. W. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.555 · Cited by 827
Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects
Monroe, C., Raussendorf, R., Ruthven, A., Brown, K. R., Maunz, P., Duan, L.-M., & Kim, J. (2014) · Physical Review A · doi:10.1103/physreva.89.022317 · Cited by 700
Colloquium: Quantum networks with trapped ions
Duan, L.-M., & Monroe, C. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.1209 · Cited by 530
Modular entanglement of atomic qubits using photons and phonons
Hucul, D., Inlek, I. V., Vittorini, G., Crocker, C., Debnath, S., Clark, S. M., & Monroe, C. (2015) · Nature Physics · doi:10.1038/nphys3150 · Cited by 311
Gate-count estimates for performing quantum chemistry on small quantum computers
Wecker, D., Bauer, B., Clark, B. K., Hastings, M. B., & Troyer, M. (2014) · Physical Review A · doi:10.1103/physreva.90.022305 · Cited by 296
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
Repeat-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
Fault-tolerant thresholds for quantum error correction with the surface code
Stephens, A. M. (2014) · Physical Review A · doi:10.1103/physreva.89.022321 · Cited by 133 · cited 1×
“Memory lifetimes and gate error rates remain a challenge for experimentalists, and the surface codes have high thresholds, approaching 1% depending on the physical model [25].”
BackgroundTime-optimal quantum computation
Fowler, A. G. (2012) · arXiv · doi:10.48550/arxiv.1210.4626 · Cited by 45
Cited by
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
Quantum computing: A taxonomy, systematic review and future directions
Gill, S. S., Kumar, A., Singh, H., Singh, M., Kaur, K., Usman, M., & Buyya, R. (2022) · Software: Practice and Experience · doi:10.1002/spe.3039 · Cited by 476
Towards a distributed quantum computing ecosystem
Cuomo, D., Caleffi, M., & Cacciapuoti, A. S. (2020) · IET Quantum Communication · doi:10.1049/iet-qtc.2020.0002 · Cited by 265
NetSquid, a NETwork Simulator for QUantum Information using Discrete events
Coopmans, T., Knegjens, R., Dahlberg, A., Maier, D., Nijsten, L., de Oliveira Filho, J., Papendrecht, M., Rabbie, J., Rozpędek, F., Skrzypczyk, M., et al. (2021) · Communications Physics · doi:10.1038/s42005-021-00647-8 · Cited by 264
Distributed quantum computing: A survey
Caleffi, M., Amoretti, M., Ferrari, D., Illiano, J., Manzalini, A., & Cacciapuoti, A. S. (2024) · Computer Networks · doi:10.1016/j.comnet.2024.110672 · Cited by 256
Metadata
- Authors
- Van Meter, R., & Devitt, S. J.
- Venue
- Computer
- Published
- 2016-09
- Volume
- 49
- Issue
- 9
- Pages
- 31-42
- ISSN
- 0018-9162 (ISSN-L)
- OpenAlex
- W2407258465
- Cited by
- 199
- References
- 33
- FWCI
- 8.02
- Type
- journal article
- Language
- en
- Open access
- green
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.