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

Lecture notes in computer science

Quantum Network Coding Based on Entanglement Distribution

Tao Shang, Ran Liu, Chengran Fang, Jianwei Liu

Published Jan 1, 2019• 3 citations
Publisher
DOI
10.1007/978-3-030-24268-8_2

Related papers

Quantum network coding without loss of information

Xing-Bo Pan, Gang Xu, Zongpeng Li +2 more

Quantum Information Processing•Feb 1, 2021•21 citations

Continuous-Variable Quantum Network Coding Based on Quantum Discord

Tao Shang, Ran Liu, Jianwei Liu +1 more

Establishing entanglement is an essential task of quantum communication technology. Beyond entanglement, quantum discord, as a measure of quantum correlation, is a necessary prerequisite to the success of entanglement distribution. To realize efficient quantum communication based on quantum discord, in this paper, we consider the practical advantages of continuous variables and propose a feasible continuous-variable quantum network coding scheme based on quantum discord. By means of entanglement distribution by separable states, it can achieve quantum entanglement distribution from sources to targets in a butterfly network. Compared with the representative discrete-variable quantum network coding schemes, the proposed continuous-variable quantum network coding scheme has a higher probability of entanglement distribution and defends against eavesdropping and forgery attacks. Particularly, the deduced relationship indicates that the increase in entanglement is less than or equal to quantum discord.

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2020•4 citations

Spooky RLNC at a Distance: Exploiting Quantum Entanglement to Convey Coding Coefficients

Marius Paul, Juan Alberto Cabrera, Riccardo Bassoli +2 more

In future 6G networks, quantum technologies are expected to be used mainly for security, e.g. quantum key distribution. However, additional advantages can also result from the realization of quantum-assisted classical communication. In this work, we show that for point-to-point transmission, quantum entanglement distribution can be used to improve the latency of a communication channel when Random Linear Network Coding (RLNC) is applied, a coding scheme to increase the performance of unreliable communication networks. To do this, we compare the overhead of the traditional RLNC scheme, where all coding coefficients are transmitted in the coding overhead, with the overhead required for the case where the coefficients a re pre-distributed to the nodes by entangled EPR-pairs. Hereby, we assume a quantum network capable of distributing entanglement while idle and storing qubits, which is already targeted for other applications like superdense-coding. In addition, we verify the quality of quantum randomness for RLNC codes.

IEEE Globecom Workshops (GC Wkshps)•Dec 4, 2022•0 citations

Typical Quantum Network Coding Schemes

Tao Shang, Jianwei Liu

Springer eBooks•Jan 1, 2020•0 citations

The quantum internet: an efficient stabilizer states distribution scheme

Seid Koudia

Abstract Quantum networks are a fundamental component of quantum technologies, playing a pivotal role in advancing distributed quantum computing and laying the groundwork for the future quantum internet. They offer a scalable modular architecture for quantum chips and support infrastructure for measurement-based quantum computing. Furthermore, quantum networks serve as the backbone of the quantum internet, ensuring high levels of security. Notably, the advantages of quantum networks in communication are contingent upon entanglement distribution, which faces challenges such as high latency in protocols relying on Bell pair distribution and bipartite entanglement swapping. Additionally, algorithms designed for multipartite entanglement routing encounter intractability issues, rendering them unsolvable within polynomial time. In this paper, we explore a novel approach to distribute graph states in quantum networks, leveraging local quantum coding (LQC) isometries and multipartite states transfer. We also present single-use bounds for stabilizer states distribution. Analogous to network coding, these bounds are attainable when appropriate isometries and stabilizer codes are selected for relay nodes, resulting in reduced latency in entanglement distribution. We further demonstrate the protocol’s advantages across various network performance metrics.

arXiv:2305.02656•Physica Scripta•Dec 13, 2023•5 citations

Opportunistic Quantum Network Coding

Tao Shang, Jianwei Liu

Springer eBooks•Jan 1, 2020•0 citations
Establishing entanglement is an essential task of quantum communication technology. Beyond entanglement, quantum discord, as a measure of quantum correlation, is a necessary prerequisite to the success of entanglement distribution. To realize efficient quantum communication based on quantum discord, in this paper, we consider the practical advantages of continuous variables and propose a feasible continuous-variable quantum network coding scheme based on quantum discord. By means of entanglement distribution by separable states, it can achieve quantum entanglement distribution from sources to targets in a butterfly network. Compared with the representative discrete-variable quantum network coding schemes, the proposed continuous-variable quantum network coding scheme has a higher probability of entanglement distribution and defends against eavesdropping and forgery attacks. Particularly, the deduced relationship indicates that the increase in entanglement is less than or equal to quantum discord.
In future 6G networks, quantum technologies are expected to be used mainly for security, e.g. quantum key distribution. However, additional advantages can also result from the realization of quantum-assisted classical communication. In this work, we show that for point-to-point transmission, quantum entanglement distribution can be used to improve the latency of a communication channel when Random Linear Network Coding (RLNC) is applied, a coding scheme to increase the performance of unreliable communication networks. To do this, we compare the overhead of the traditional RLNC scheme, where all coding coefficients are transmitted in the coding overhead, with the overhead required for the case where the coefficients a re pre-distributed to the nodes by entangled EPR-pairs. Hereby, we assume a quantum network capable of distributing entanglement while idle and storing qubits, which is already targeted for other applications like superdense-coding. In addition, we verify the quality of quantum randomness for RLNC codes.
Abstract Quantum networks are a fundamental component of quantum technologies, playing a pivotal role in advancing distributed quantum computing and laying the groundwork for the future quantum internet. They offer a scalable modular architecture for quantum chips and support infrastructure for measurement-based quantum computing. Furthermore, quantum networks serve as the backbone of the quantum internet, ensuring high levels of security. Notably, the advantages of quantum networks in communication are contingent upon entanglement distribution, which faces challenges such as high latency in protocols relying on Bell pair distribution and bipartite entanglement swapping. Additionally, algorithms designed for multipartite entanglement routing encounter intractability issues, rendering them unsolvable within polynomial time. In this paper, we explore a novel approach to distribute graph states in quantum networks, leveraging local quantum coding (LQC) isometries and multipartite states transfer. We also present single-use bounds for stabilizer states distribution. Analogous to network coding, these bounds are attainable when appropriate isometries and stabilizer codes are selected for relay nodes, resulting in reduced latency in entanglement distribution. We further demonstrate the protocol’s advantages across various network performance metrics.