Communication Links for Distributed Quantum Computation
Open accessThe DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Abstract
Distributed quantum computation requires quantum operations that act over a distance on error correction-encoded states of logical qubits, such as the transfer of qubits via teleportation. We evaluate the performance of several quantum error correction (QEC) codes and find that teleportation failure rates of one percent or more are tolerable when two levels of the [[23, 1, 7]] code are used. We present an analysis of performing QEC on QEC-encoded states that span two quantum computers, including the creation of distributed logical zeros. The transfer of the individual qubits of a logical state may be multiplexed in time or space, moving serially across a single link or in parallel across multiple links. We show that the performance and reliability penalty for using serial links is small for a broad range of physical parameters, making serial links preferable for a large, distributed quantum multicomputer when engineering difficulties are considered. Such a multicomputer will be able to factor a 1,024-bit number using Shor's algorithm with a high probability of success.
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 · cited 2×
“Table I shows the number of logical qubit teleportations necessary to execute the modular exponentiation portion of Shor’s algorithm for 16, 128, and 1,024 bits.”
BackgroundMethodQuantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
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
Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication
Briegel, H.-J., Dür, W., Cirac, J. I., & Zoller, P. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.5932 · Cited by 3,481 · cited 2×
“The connections could also be made using single photons instead of the qubus [5], [41], [42], [43], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], though the basic architecture and our results presented here are independent of this choice.”
BackgroundUnconditional 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
Quantum State Transfer and Entanglement Distribution among Distant Nodes in a Quantum Network
Cirac, J. I., Zoller, P., Kimble, H. J., & Mabuchi, H. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3221 · Cited by 2,215
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
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 · cited 2×
“The basic threshold arguments that dictate the necessary error rates for two-qubit gates then apply directly to our remote interaction [72], [73].”
BackgroundOn the role of entanglement in quantum-computational speed-up
Jozsa, R., & Linden, N. (2003) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2002.1097 · Cited by 839 · cited 1×
“It has been shown that entanglement between the separate quantum computers, or nodes, of a distributed quantum system is necessary if the system is to have the potential for expone ntial speedup over a classical computer (or cluster of classi cal computers) [ 21 ]‐[23].”
BackgroundExperimental Implementation of Fast Quantum Searching
Chuang, I. L., Gershenfeld, N., & Kubinec, M. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.3408 · Cited by 707
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
Experimental realization of a quantum algorithm
Chuang, I. L., Vandersypen, L. M. K., Zhou, X., Leung, D. W., & Lloyd, S. (1998) · Nature · doi:10.1038/30181 · Cited by 604
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513 · cited 1×
“The argument here falls much along the lines of the threshold argument for quantum computation in general [63], [64].”
BackgroundOperator quantum error-correcting subsystems for self-correcting quantum memories
Bacon, D. (2006) · Physical Review A · doi:10.1103/physreva.73.012340 · Cited by 486 · cited 1×
“Section V shows that serial links perform nearly as well as parallel links, before we conclude in Section VI.”
BackgroundOverhead 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
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
Theory of Control of the Spin-Photon Interface for Quantum Networks
Yao, W., Liu, R.-B., & Sham, L. J. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.030504 · Cited by 208
Fast quantum modular exponentiation
Van Meter, R., & Itoh, K. M. (2005) · Physical Review A · doi:10.1103/physreva.71.052320 · Cited by 181
Fast and robust approach to long-distance quantum communication with atomic ensembles
Jiang, L., Taylor, J. M., & Lukin, M. D. (2007) · Physical Review A · doi:10.1103/physreva.76.012301 · Cited by 132
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
Scalable error correction in distributed ion trap computers
Oi, D. K. L., Devitt, S. J., & Hollenberg, L. C. L. (2006) · Physical Review A · doi:10.1103/physreva.74.052313 · Cited by 40
Cited by
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Distributed quantum computation based on small quantum registers
Jiang, L., Taylor, J. M., Sørensen, A. S., & Lukin, M. D. (2007) · Physical Review A · doi:10.1103/physreva.76.062323 · Cited by 337
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
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
Self-citationArithmetic on a distributed-memory quantum multicomputer
Meter, R. V., Munro, W. J., Nemoto, K., & Itoh, K. M. (2008) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1324177.1324179 · Cited by 65
Self-citation
Metadata
- Authors
- Van Meter, R., Nemoto, K., & Munro, W.
- Venue
- IEEE Transactions on Computers
- Published
- 2007-12
- Volume
- 56
- Issue
- 12
- Pages
- 1643-1653
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2142652242
- Cited by
- 53
- References
- 27
- FWCI
- 6.30
- 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.