Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2212.01226 · Science China Information Sciences

Quantum NETwork: from theory to practice

Kun Fang, Jingtian Zhao, Xiufan Li, Yifei Li, Runyao Duan

Published Jul 5, 2023• 48 citations
arXivHTMLPDF
DOI
10.1007/s11432-023-3773-4

Related papers

Developing quantum networks: some key innovations

Nilesh Sharma, Saravana Vilashini M, Gopala Krishnan +6 more

Quantum Information Processing•Jan 12, 2026•0 citations

A Practical Quantum Network Coding Protocol Based on Non-Maximally Entangled State

Zhenzhen Li, Zichen Li, Xiu‐Bo Chen +3 more

In many earlier works, perfect quantum state transmission over the butterfly network can be achieved via quantum network coding protocols with the assist of maximally entangled states. However, in actual quantum networks, a maximally entangled state as auxiliary resource is hard to be obtained or easily turned into a non-maximally entangled state subject to all kinds of environmental noises. Therefore, we propose a more practical quantum network coding scheme with the assist of non-maximally entangled states. In this paper, a practical quantum network coding protocol over grail network is proposed, in which the non-maximally entangled resource is assisted and even the desired quantum state can be perfectly transmitted. The achievable rate region, security and practicability of the proposed protocol are discussed and analyzed. This practical quantum network coding protocol proposed over the grail network can be regarded as a useful attempt to help move the theory of quantum network coding towards practicability.

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2021•6 citations

Quantum Networks

Günter Mahler A, Volker A. Weberruß

Springer eBooks•Jan 1, 1995•64 citations

Practical Limitations on the Quantum Internet

The realization of a global-scale quantum internet is hindered by practical challenges such as high photon loss, decoherence, susceptibility to node failure, and others. We analyze [1] the implications of these practical constraints on the scalability and robustness of the quantum Internet. Considering repeater-based quantum networks, we present bottlenecks for distributing resources among multiple end nodes. We use graph theory to assess network robustness and identify its critical nodes and critical length scales. In particular, we consider repeater-based quantum networks and present practical limitations on distilling secret keys via device-independent quantum key distribution (DI-QKD) protocols and other information processing tasks such as sharing of entanglement between the end nodes, performing Bell-CHSH violation experiments, and implementing quantum teleportation protocols. By considering instances of a hybrid satellite-fiber network for distributing entangled states between far-off cities and considering currently available quantum processor architectures as networks, we analyze the practical limitations and robustness of real-world quantum networks. For such real-world networks, we present algorithms for different network tasks. Overall, the assessment presented in this work can be used to benchmark the critical parameters in the practical realization of a global-scale quantum internet.

International Conference on Communication Systems & Networks (COMSNETS)•Jan 3, 2024•0 citations

Practical limitations on robustness and scalability of quantum Internet

Abhishek Sadhu, Meghana Ayyala Somayajula, Karol Horodecki +1 more

Abstract The realization of a desirably functional quantum Internet is hindered by fundamental and practical challenges such as high loss during transmission of quantum systems, decoherence due to interaction with the environment, and fragility of quantum states under measurement. We study the implications of these constraints by analyzing the limitations on the scaling and robustness of the quantum Internet. Considering quantum networks, we present practical bottlenecks for secure communication, delegated computing, and resource distribution among end nodes. In particular, we show that the device-independent quantum key distribution (DI-QKD) network of isotropic states with parameter p has a finite diameter depending on p . Motivated by the power of abstraction in graph theory (in association with quantum information theory), that allows us to consider the topology of a network of users spatially separated over long distances around the globe or separated as nodes within the small space over a processor or circuit within a same framework, we consider graph-theoretic quantifiers to assess network robustness and provide critical values of communication lines for viable communication over quantum Internet. We consider some quantum networks of practical interest, ranging from satellite-based networks connecting far-off spatial locations to currently available quantum processor architectures within computers, and analyze their robustness to perform quantum information processing tasks. Some of these tasks form primitives for delegated quantum computing, e.g., entanglement distribution and quantum teleportation, that are desirable for all scale of quantum networks, be it quantum processors or quantum Internet.

arXiv:2308.12739•Quantum Information Processing•Oct 28, 2026•5 citations

Quantum Networks

Günter Mahler A, Volker A. Weberruß

Springer eBooks•Jan 1, 1998•79 citations
In many earlier works, perfect quantum state transmission over the butterfly network can be achieved via quantum network coding protocols with the assist of maximally entangled states. However, in actual quantum networks, a maximally entangled state as auxiliary resource is hard to be obtained or easily turned into a non-maximally entangled state subject to all kinds of environmental noises. Therefore, we propose a more practical quantum network coding scheme with the assist of non-maximally entangled states. In this paper, a practical quantum network coding protocol over grail network is proposed, in which the non-maximally entangled resource is assisted and even the desired quantum state can be perfectly transmitted. The achievable rate region, security and practicability of the proposed protocol are discussed and analyzed. This practical quantum network coding protocol proposed over the grail network can be regarded as a useful attempt to help move the theory of quantum network coding towards practicability.
The realization of a global-scale quantum internet is hindered by practical challenges such as high photon loss, decoherence, susceptibility to node failure, and others. We analyze [1] the implications of these practical constraints on the scalability and robustness of the quantum Internet. Considering repeater-based quantum networks, we present bottlenecks for distributing resources among multiple end nodes. We use graph theory to assess network robustness and identify its critical nodes and critical length scales. In particular, we consider repeater-based quantum networks and present practical limitations on distilling secret keys via device-independent quantum key distribution (DI-QKD) protocols and other information processing tasks such as sharing of entanglement between the end nodes, performing Bell-CHSH violation experiments, and implementing quantum teleportation protocols. By considering instances of a hybrid satellite-fiber network for distributing entangled states between far-off cities and considering currently available quantum processor architectures as networks, we analyze the practical limitations and robustness of real-world quantum networks. For such real-world networks, we present algorithms for different network tasks. Overall, the assessment presented in this work can be used to benchmark the critical parameters in the practical realization of a global-scale quantum internet.
Abstract The realization of a desirably functional quantum Internet is hindered by fundamental and practical challenges such as high loss during transmission of quantum systems, decoherence due to interaction with the environment, and fragility of quantum states under measurement. We study the implications of these constraints by analyzing the limitations on the scaling and robustness of the quantum Internet. Considering quantum networks, we present practical bottlenecks for secure communication, delegated computing, and resource distribution among end nodes. In particular, we show that the device-independent quantum key distribution (DI-QKD) network of isotropic states with parameter p has a finite diameter depending on p . Motivated by the power of abstraction in graph theory (in association with quantum information theory), that allows us to consider the topology of a network of users spatially separated over long distances around the globe or separated as nodes within the small space over a processor or circuit within a same framework, we consider graph-theoretic quantifiers to assess network robustness and provide critical values of communication lines for viable communication over quantum Internet. We consider some quantum networks of practical interest, ranging from satellite-based networks connecting far-off spatial locations to currently available quantum processor architectures within computers, and analyze their robustness to perform quantum information processing tasks. Some of these tasks form primitives for delegated quantum computing, e.g., entanglement distribution and quantum teleportation, that are desirable for all scale of quantum networks, be it quantum processors or quantum Internet.