The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Towards a distributed quantum computing ecosystem
Open accessAbstract
The Quantum Internet, by enabling quantum communications among remote quantum nodes, is a network capable of supporting functionalities with no direct counterpart in the classical world. Indeed, with the network and communications functionalities provided by the Quantum Internet, remote quantum devices can communicate and cooperate for solving challenging computational tasks by adopting a distributed computing approach. The aim of this study is to provide the reader with an overview about the main challenges and open problems arising in the design of a distributed quantum computing ecosystem. For this, the authors provide a survey, following a bottom‐up approach, from a communications engineering perspective. They start by introducing the Quantum Internet as the fundamental underlying infrastructure of the distributed quantum computing ecosystem. Then they go further, by elaborating on a high‐level system abstraction of the distributed quantum computing ecosystem. They describe such an abstraction through a set of logical layers. Thereby, they clarify dependencies among the aforementioned layers and, at the same time, a road‐map emerges.
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
Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
Einstein, A., Podolsky, B., & Rosen, N. (1935) · Physical Review · doi:10.1103/physrev.47.777 · Cited by 16,654
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
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Kimble, H. J. (2008) · Nature · doi:10.1038/nature07127 · Cited by 6,023
Quantum internet: a vision for the road ahead
Wehner, S., Elkouss, D., & Hanson, R. (2018) · Science · doi:10.1126/science.aam9288 · Cited by 2,467
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
An introduction to quantum machine learning
Schuld, M., Sinayskiy, I., & Petruccione, F. (2015) · Contemporary Physics · doi:10.1080/00107514.2014.964942 · Cited by 1,381
Ground-to-satellite quantum teleportation
Ren, J.-G., Xu, P., Yong, H.-L., Zhang, L., Liao, S.-K., Yin, J., Liu, W.-Y., Cai, W.-Q., Yang, M., Li, L., et al. (2017) · Nature · doi:10.1038/nature23675 · Cited by 848
Building logical qubits in a superconducting quantum computing system
Gambetta, J. M., Chow, J. M., & Steffen, M. (2017) · npj Quantum Information · doi:10.1038/s41534-016-0004-0 · Cited by 622
Universal Blind Quantum Computation
Broadbent, A., Fitzsimons, J., & Kashefi, E. (2009) · 2009 50th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.36 · Cited by 521
Quantum Internet: Networking Challenges in Distributed Quantum Computing
Cacciapuoti, A. S., Caleffi, M., Tafuri, F., Cataliotti, F. S., Gherardini, S., & Bianchi, G. (2020) · IEEE Network · doi:10.1109/mnet.001.1900092 · Cited by 514
Self-citationExperimental comparison of two quantum computing architectures
Linke, N. M., Maslov, D., Roetteler, M., Debnath, S., Figgatt, C., Landsman, K. A., Wright, K., & Monroe, C. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1618020114 · Cited by 508
Development of quantum interconnects (QuICs) for next-generation information technologies
Awschalom, D., Berggren, K. K., Bernien, H., Bhave, S., Carr, L. D., Davids, P., Economou, S. E., Englund, D., Faraon, A., Fejer, M., et al. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.017002 · Cited by 392
An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures
Zulehner, A., Paler, A., & Wille, R. (2019) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2018.2846658 · Cited by 372
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
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
Farhi, E., & Harrow, A. W. (2016) · arXiv · doi:10.48550/arxiv.1602.07674 · Cited by 331
Quantum computing and the entanglement frontier
Preskill, J. (2012) · arXiv · doi:10.48550/arxiv.1203.5813 · Cited by 308
Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore CircuitsPreprint
Pednault, E., Gunnels, J. A., Nannicini, G., Horesh, L., & Wisnieff, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.09534 · Cited by 298
When Entanglement Meets Classical Communications: Quantum Teleportation for the Quantum Internet
Cacciapuoti, A. S., Caleffi, M., Van Meter, R., & Hanzo, L. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2020.2978071 · Cited by 292
Self-citationDeterministic teleportation of a quantum gate between two logical qubits
Chou, K. S., Blumoff, J. Z., Wang, C. S., Reinhold, P. C., Axline, C. J., Gao, Y. Y., Frunzio, L., Devoret, M. H., Jiang, L., & Schoelkopf, R. J. (2018) · Nature · doi:10.1038/s41586-018-0470-y · Cited by 272
An artificial neuron implemented on an actual quantum processor
Tacchino, F., Macchiavello, C., Gerace, D., & Bajoni, D. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0140-4 · Cited by 270
Security of quantum key distribution with imperfect devices
Gottesman, D., Lo, H.-K., Lutkenhaus, N., & Preskill, J. (2004) · International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. · doi:10.1109/isit.2004.1365172 · Cited by 251
Physics: Unite to build a quantum Internet
Pirandola, S., & Braunstein, S. L. (2016) · Nature · doi:10.1038/532169a · Cited by 249
Optimal Routing for Quantum Networks
Caleffi, M. (2017) · IEEE Access · doi:10.1109/access.2017.2763325 · Cited by 241
Self-citationA quantum network stack and protocols for reliable entanglement-based networks
Pirker, A., & Dür, W. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab05f7 · Cited by 226
Distributed Routing in a Quantum InternetPreprint
Chakraborty, K., Rozpędek, F., Dahlberg, A., & Wehner, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.11630 · Cited by 203
Caleffi, M., Cacciapuoti, A. S., & Bianchi, G. (2018) · ACM International Conference on Nanoscale Computing and Communication (NANOCOM) · doi:10.1145/3233188.3233224 · Cited by 202
Self-citationThe Path to Scalable Distributed Quantum Computing
Van Meter, R., & Devitt, S. J. (2016) · Computer · doi:10.1109/mc.2016.291 · Cited by 199
Quantum Switch for the Quantum Internet: Noiseless Communications Through Noisy Channels
Caleffi, M., & Cacciapuoti, A. S. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.2969035 · Cited by 144
Self-citationQuantum gold rush: the private funding pouring into quantum start-ups
Gibney, E. (2019) · Nature · doi:10.1038/d41586-019-02935-4 · Cited by 121
Fast quantum byzantine agreement
Ben-Or, M., & Hassidim, A. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060662 · Cited by 120
Architectural Principles for a Quantum Internet
Kozlowski, W., Wehner, S., Meter, R. V., Rijsman, B., Cacciapuoti, A. S., Caleffi, M., & Nagayama, S. (2023) · doi:10.17487/rfc9340 · Cited by 106
Self-citationDistributed quantum computing: a distributed Shor algorithm
Yimsiriwattana, A., & Lomonaco, S. J., Jr. (2004) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.546504 · Cited by 105
Experimental Blind Quantum Computing for a Classical Client
Huang, H.-L., Zhao, Q., Ma, X., Liu, C., Su, Z.-E., Wang, X., Li, L., Liu, N.-L., Sanders, B. C., Lu, C., et al. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.050503 · Cited by 103
A Quantum Approximate Optimization Algorithm for continuous problemsPreprint
Verdon, G., Arrazola, J. M., Brádler, K., & Killoran, N. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.00409 · Cited by 70
Efficient quantum secret sharing without a trusted player
Sutradhar, K., & Om, H. (2020) · Quantum Information Processing · doi:10.1007/s11128-019-2571-4 · Cited by 67
The Rise of the Quantum Internet
Caleffi, M., Chandra, D., Cuomo, D., Hassanpour, S., & Cacciapuoti, A. S. (2020) · Computer · doi:10.1109/mc.2020.2984871 · Cited by 60
Self-citationQuantum networking and internetworking
Meter, R. V. (2012) · IEEE Network · doi:10.1109/mnet.2012.6246754 · Cited by 56
The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
Babar, Z., Botsinis, P., Alanis, D., Ng, S. X., & Hanzo, L. (2015) · IEEE Access · doi:10.1109/access.2015.2405533 · Cited by 44
Xu, G., Xiao, K., Li, Z., & Ryan, X.-X. N. A. M. (2019) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2019.04400 · Cited by 40
Multilayer Optimization for the Quantum Internet
Gyöngyösi, L., & Imre, S. (2018) · Scientific Reports · doi:10.1038/s41598-018-30957-x · Cited by 39
Quantum Network Communication With a Novel Discrete-Time Quantum Walk
Chen, X., Wang, Y., Xu, G., & Yang, Y. (2019) · IEEE Access · doi:10.1109/access.2018.2890719 · Cited by 39
Distributed Arithmetic on a Quantum Multicomputer
Meter, R. V., Nemoto, K., Munro, W. J., & Itoh, K. M. (2006) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca.2006.19 · Cited by 31
Topology adaption for the quantum Internet
Gyöngyösi, L., & Imre, S. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2064-x · Cited by 30
Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices
Ferrari, D., & Amoretti, M. (2018) · International Journal of Quantum Information · doi:10.1142/s0219749918400063 · Cited by 25
Universal blind quantum computation for hybrid system
Huang, H.-L., Bao, W., Li, T., Li, F., Fu, X.-Q., Zhang, S., Zhang, H., & Wang, X. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1652-5 · Cited by 17
Toward the Quantum Internet: A Directional-dependent Noise Model for Quantum Signal Processing
Cacciapuoti, A. S., & Caleffi, M. (2019) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2019.8683195 · Cited by 17
Self-citationModeling and Designing Routing Protocols in Quantum NetworksPreprint
Shi, S., & Qian, C. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.09329 · Cited by 16
Capacity Bounds for Quantum Communications through Quantum TrajectoriesPreprint
Cacciapuoti, A. S., & Caleffi, M. (2019) · arXiv (Cornell University) · Cited by 8
Self-citationEurope's €1 billion quantum flagship announces grants
Cartlidge, E. (2018) · Science · doi:10.1126/science.362.6414.512 · Cited by 3
Cited by
Quantum networks based on color centers in diamond
Ruf, M., Wan, N. H., Choi, H., Englund, D., & Hanson, R. (2021) · Journal of Applied Physics · doi:10.1063/5.0056534 · Cited by 297
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
Self-citationQuantum 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
Entangling single atoms over 33 km telecom fibre
(2022) · doi:10.1038/s41586-022-04764-4 · Cited by 238
Duong, T. Q., Ansere, J. A., Narottama, B., Sharma, V., Dobre, O. A., & Shin, H. (2022) · IEEE Open Journal of Vehicular Technology · doi:10.1109/ojvt.2022.3202876 · Cited by 106
Metadata
- Authors
- Cuomo, D., Caleffi, M., & Cacciapuoti, A. S.
- Venue
- IET Quantum Communication
- Published
- 2020-07
- Volume
- 1
- Issue
- 1
- Pages
- 3-8
- ISSN
- 2632-8925 (ISSN-L)
- OpenAlex
- W3007533588
- Cited by
- 265
- References
- 51
- FWCI
- 10.32
- Type
- journal article
- Language
- en
- Open access
- gold
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.