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

Computers, materials & continua/Computers, materials & continua (Print)

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

Zhenzhen Li, Zichen Li, Xiu‐Bo Chen, Zhiguo Qu, Xiaojun Wang, Haizhu Pan

Published Jan 1, 2021• 6 citations
Publisher

Abstract

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.

DOI
10.32604/cmc.2021.016960

Related papers

General Scheme for Perfect Quantum Network Coding with Free Classical Communication

Hirotada Kobayashi, François Le, Gall Harumichi +1 more

This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general — indeed, it is impossible even for the simple butterfly network. As additional resource we allow free classical communication between any pair of network nodes. It is shown that perfect quantum network coding is achievable in this model whenever classical network coding is possible over the same network when replacing all quantum capacities by classical capacities. More precisely, it is proved that perfect quantum network coding using free classical communication is possible over a network with k source-target pairs if there exists a classical linear (or even vector-linear) coding scheme over a finite ring. Our proof is constructive in that we give explicit quantum coding operations for each network node. This paper also gives an upper bound on the number of classical communication required in terms of k, the maximal fan-in of any network node, and the size of the network. x1 x2 s1 ♠ s2 ♠ ❍❍❍❍ ❥ x1 x2 ✟ n1 x1 x1 ⊕ x2 x2 n2 ♠ x1 ⊕ x2✟ ❍❍❍❍ ❥ x1 ⊕ x2

•Jan 1, 2009•57 citations

Network Coding-Based Communications via the Controlled Quantum Teleportation

Dazu Huang, Shaoping Zhu, Dan Song +1 more

Inspired by the structure of the network coding over the butterfly network, a framework of quantum network coding scheme is investigated, which transmits two unknown quantum states crossly over the butterfly quantum system with the multi-photon non-maximally entangled GHZ states. In this scheme, it contains certain number of entanglement-qubit source nodes that teleport unknown quantum states to other nodes on the small-scale network where each intermediate node can pass on its received quantum states to others via superdense coding. In order to transmit the unknown states in a deterministic way, the controlled quantum teleportation is adopted on the intermediate node. It makes legal nodes more convenient than any other previous teleportation schemes to transmit unknown quantum states to unknown participants in applications. It shows that the intrinsic efficiency of transmissions approaches 100% in principle. This scheme is secure based on the securely-shared quantum channels between all nodes and the quantum mechanical impossibility of local unitary transformations between non-maximally entangled GHZ states. Moreover, the generalized scheme is proposed for transmitting two multipartite entangled states. DOI:  http://dx.doi.org/10.11591/telkomnika.v11i2.2031

TELKOMNIKA Indonesian Journal of Electrical Engineering•Feb 1, 2013•0 citations

Quantum Remote State Preparation Based on Quantum Network Coding

Zhenzhen Li, Zichen Li, Yiru Sun +3 more

As an innovative theory and technology, quantum network coding has become the research hotspot in quantum network communications. In this paper, a quantum remote state preparation scheme based on quantum network coding is proposed. Comparing with the general quantum remote state preparation schemes, our proposed scheme brings an arbitrary unknown quantum state finally prepared remotely through the quantum network, by designing the appropriate encoding and decoding steps for quantum network coding. What is worth mentioning, from the network model, this scheme is built on the quantum k-pair network which is the expansion of the typical bottleneck network—butterfly network. Accordingly, it can be treated as an efficient quantum network preparation scheme due to the characteristics of network coding, and it also makes the proposed scheme more applicable to the large-scale quantum networks. In addition, the fact of an arbitrary unknown quantum state remotely prepared means that the senders do not need to know the desired quantum state. Thus, the security of the proposed scheme is higher. Moreover, this scheme can always achieve the success probability of 1 and 1-max flow of value k. Thus, the communication efficiency of the proposed scheme is higher. Therefore, the proposed scheme turns out to be practicable, secure and efficient, which helps to effectively enrich the theory of quantum remote state preparation.

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2022•2 citations

Quantum network coding based on butterfly network

Ying Guo

Based on the typical example of butterfly network,this paper promoted a quantum network coding scheme including the transmission of classical information and the unknown qubit.It improved effectively the overall performance of the network which could achieve the maximizing information transmission in quantum network.Remarkably,here it did not require classic channel,only had quantum channel.It mad use of qubit as register to transmit classical information.No matter what send was unknown qubit or classical bit,both could be encoded with register and decoded without classical assistant information.It's effective to improve security of this scheme.

Jisuanji yingyong yanjiu•Jan 1, 2011•0 citations

Experimental quantum network coding

He Lu, Zheng-Da Li, Xu-Fei Yin +7 more

Abstract Distributing quantum state and entanglement between distant nodes is a crucial task in distributed quantum information processing on large-scale quantum networks. Quantum network coding provides an alternative solution for quantum-state distribution, especially when the bottleneck problems must be considered and high communication speed is required. Here, we report the first experimental realization of quantum network coding on the butterfly network. With the help of prior entanglements shared between senders, two quantum states can be transmitted perfectly through the butterfly network. We demonstrate this protocol by employing eight photons generated via spontaneous parametric downconversion. We observe cross-transmission of single-photon states with an average fidelity of 0.9685 ± 0.0013, and that of two-photon entanglement with an average fidelity of 0.9611 ± 0.0061, both of which are greater than the theoretical upper bounds without prior entanglement.

arXiv:1910.00866•npj Quantum Information•Oct 23, 2019•45 citations

Perfect Quantum Network Coding Independent of Classical Network Solutions

Jing Li, Xiu‐Bo Chen, Gang Xu +2 more

Quantum network coding with classical assistance can transmit quantum information with fidelity one in error-free quantum channels. However, the dependency on classical network solutions leads to higher communication complexity and transmission congestion over a large-scale network with bottleneck channels. We find that certain types of quantum operation are sufficient to support multiple unicast sessions over the extended butterfly network. Furthermore, this construction decouples classical communication (assisting decoding information) from classical network solution. Based on this design, we propose an optimal protocol for this specific network, which significantly reduces the communication cost.

IEEE Communications Letters•Dec 9, 2014•45 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.
This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general — indeed, it is impossible even for the simple butterfly network. As additional resource we allow free classical communication between any pair of network nodes. It is shown that perfect quantum network coding is achievable in this model whenever classical network coding is possible over the same network when replacing all quantum capacities by classical capacities. More precisely, it is proved that perfect quantum network coding using free classical communication is possible over a network with k source-target pairs if there exists a classical linear (or even vector-linear) coding scheme over a finite ring. Our proof is constructive in that we give explicit quantum coding operations for each network node. This paper also gives an upper bound on the number of classical communication required in terms of k, the maximal fan-in of any network node, and the size of the network. x1 x2 s1 ♠ s2 ♠ ❍❍❍❍ ❥ x1 x2 ✟ n1 x1 x1 ⊕ x2 x2 n2 ♠ x1 ⊕ x2✟ ❍❍❍❍ ❥ x1 ⊕ x2
Inspired by the structure of the network coding over the butterfly network, a framework of quantum network coding scheme is investigated, which transmits two unknown quantum states crossly over the butterfly quantum system with the multi-photon non-maximally entangled GHZ states. In this scheme, it contains certain number of entanglement-qubit source nodes that teleport unknown quantum states to other nodes on the small-scale network where each intermediate node can pass on its received quantum states to others via superdense coding. In order to transmit the unknown states in a deterministic way, the controlled quantum teleportation is adopted on the intermediate node. It makes legal nodes more convenient than any other previous teleportation schemes to transmit unknown quantum states to unknown participants in applications. It shows that the intrinsic efficiency of transmissions approaches 100% in principle. This scheme is secure based on the securely-shared quantum channels between all nodes and the quantum mechanical impossibility of local unitary transformations between non-maximally entangled GHZ states. Moreover, the generalized scheme is proposed for transmitting two multipartite entangled states. DOI:  http://dx.doi.org/10.11591/telkomnika.v11i2.2031
As an innovative theory and technology, quantum network coding has become the research hotspot in quantum network communications. In this paper, a quantum remote state preparation scheme based on quantum network coding is proposed. Comparing with the general quantum remote state preparation schemes, our proposed scheme brings an arbitrary unknown quantum state finally prepared remotely through the quantum network, by designing the appropriate encoding and decoding steps for quantum network coding. What is worth mentioning, from the network model, this scheme is built on the quantum k-pair network which is the expansion of the typical bottleneck network—butterfly network. Accordingly, it can be treated as an efficient quantum network preparation scheme due to the characteristics of network coding, and it also makes the proposed scheme more applicable to the large-scale quantum networks. In addition, the fact of an arbitrary unknown quantum state remotely prepared means that the senders do not need to know the desired quantum state. Thus, the security of the proposed scheme is higher. Moreover, this scheme can always achieve the success probability of 1 and 1-max flow of value k. Thus, the communication efficiency of the proposed scheme is higher. Therefore, the proposed scheme turns out to be practicable, secure and efficient, which helps to effectively enrich the theory of quantum remote state preparation.
Based on the typical example of butterfly network,this paper promoted a quantum network coding scheme including the transmission of classical information and the unknown qubit.It improved effectively the overall performance of the network which could achieve the maximizing information transmission in quantum network.Remarkably,here it did not require classic channel,only had quantum channel.It mad use of qubit as register to transmit classical information.No matter what send was unknown qubit or classical bit,both could be encoded with register and decoded without classical assistant information.It's effective to improve security of this scheme.
Abstract Distributing quantum state and entanglement between distant nodes is a crucial task in distributed quantum information processing on large-scale quantum networks. Quantum network coding provides an alternative solution for quantum-state distribution, especially when the bottleneck problems must be considered and high communication speed is required. Here, we report the first experimental realization of quantum network coding on the butterfly network. With the help of prior entanglements shared between senders, two quantum states can be transmitted perfectly through the butterfly network. We demonstrate this protocol by employing eight photons generated via spontaneous parametric downconversion. We observe cross-transmission of single-photon states with an average fidelity of 0.9685 ± 0.0013, and that of two-photon entanglement with an average fidelity of 0.9611 ± 0.0061, both of which are greater than the theoretical upper bounds without prior entanglement.
Quantum network coding with classical assistance can transmit quantum information with fidelity one in error-free quantum channels. However, the dependency on classical network solutions leads to higher communication complexity and transmission congestion over a large-scale network with bottleneck channels. We find that certain types of quantum operation are sufficient to support multiple unicast sessions over the extended butterfly network. Furthermore, this construction decouples classical communication (assisting decoding information) from classical network solution. Based on this design, we propose an optimal protocol for this specific network, which significantly reduces the communication cost.