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

IEEE Globecom Workshops (GC Wkshps)

Nonlinear Quantum Network Coding with Classical Communication Resource

Tao Shang, Chunlei Zhang, Ke Li, Jianwei Liu

Published Dec 1, 2015• 1 citation
Publisher

Abstract

Considering the problem of how to efficiently transmit unknown quantum states in multi-unicast networks, we propose a nonlinear quantum network coding scheme with classical communication resource. On the conditions of free classical communication between adjacent nodes in a network, as well as unlimited capacities of classical channels, perfect quantum network coding is available. By means of local phase deviation correction, we design the encoding procedure of nonlinear coding scheme. Moreover, we provide the upper bound on the total number of classical communication which is required to achieve quantum communication, as well as the analysis of scheme property.

DOI
10.1109/glocomw.2015.7414042

Related papers

Perfect quantum network communication protocol based on classical network coding

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

This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that classical communication is free. The task is to perfectly transfer an unknown quantum state from a source subsystem to a target subsystem, where both source and target are formed by ordered sets of some of the nodes. It is proved that a lower bound of the rate at which this quantum communication task is possible is given by the classical min-cut max-flow theorem of network coding, where the capacities in question are the quantum capacities of the edges of the network.

arXiv:0902.1299•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•79 citations

Constructing quantum network coding schemes from classical nonlinear protocols

Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura +1 more

The k-pair problem in network coding theory asks to send k messages simultaneously between k source-target pairs over a directed acyclic graph. In a previous paper [ICALP 2009, Part I, pages 622-633] the present authors showed that if a classical k-pair problem is solvable by means of a linear coding scheme, then the quantum k-pair problem over the same graph is also solvable, provided that classical communication can be sent for free between any pair of nodes of the graph. Here we address the main case that remained open in our previous work, namely whether nonlinear classical network coding schemes can also give rise to quantum network coding schemes. This question is motivated by the fact that there are networks for which no linear solutions exist to the k-pair problem, whereas nonlinear solutions exist. In the present paper we overcome the limitation to linear protocols and describe a new communication protocol for perfect quantum network coding that improves over the previous one as follows: (i) the new protocol does not put any condition on the underlying classical coding scheme, that is, it can simulate nonlinear communication protocols as well, and (ii) the amount of classical communication sent in the protocol is significantly reduced.

arXiv:1012.4583•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2011•48 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•46 citations

Quantum network coding — How can network coding be applied to quantum information?

Harumichi Nishimura

Nowadays, network coding has been a very successful topic in information theory including many applications such as wireless networks while one of the simplest benefits is the efficient transmission in networks by allowing us to encode the transmitted information at every intermediate node. Since quantum information is much more expensive for communication than classical information, it was natural that this benefit made quantum researchers motivate the study of “quantum network coding.” This paper reports the current status of quantum network coding. At present, quantum network coding mostly means sending quantum information (rather than classical information) in a quantum network. Since quantum information cannot be cloned (the quantum no-cloning theorem), multiple unicast networks have been well-studied (in several settings). We present some of the known possibilities and limitations, and future works of quantum network coding, focusing on multiple unicast networks.

International Symposium on Network Coding (NetCod)•Jun 1, 2013•17 citations

Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network With Free One-Way Public Communication

Go Kato, Masaki Owari, Masahito Hayashi

It is natural in a quantum network system that multiple users intend to send their quantum message to their respective receivers, which is called a multiple unicast quantum network. We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network from a secure classical network code. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack when the attack satisfies a certain natural condition. In our security proof, the eavesdropper is allowed to modify wiretapped information dependently on the previously wiretapped messages. Our protocol guarantees the secrecy by utilizing one-way classical information transmission (public communication) in the same direction as the quantum network although the verification of quantum information transmission requires two-way classical communication. In the protocol, some nodes may share secret randomness as resources in advance. Our secure network code can be applied to several networks including the butterfly network.

arXiv:2003.13293•IEEE Transactions on Information Theory•May 10, 2021•15 citations

Quantum multicast communication over the butterfly network

Xing-Bo Pan, Xiu‐Bo Chen, Gang Xu +3 more

Abstract We propose a scheme where one can exploit auxiliary resources to achieve quantum multicast communication with network coding over the butterfly network. In this paper, we propose the quantum 2-pair multicast communication scheme, and extend it to k-pair multicast communication over the extended butterfly network. Firstly, an EPR pair is shared between each adjacent node on the butterfly network, and make use of local operation and classical communication to generate entangled relationship between non-adjacent nodes. Secondly, each sender adds auxiliary particles according to the multicast number k, in which the CNOT operations are applied to form the multi-particle entangled state. Finally, combined with network coding and free classical communication, quantum multicast communication based on quantum measurements is completed over the extended butterfly network. Not only the bottleneck problem is solved, but also quantum multicast communication can be completed in our scheme. At the same time, regardless of multicast number k, the maximum capacity of classical channel is 2 bits, and quantum channel is used only once.

Chinese Physics B•Aug 25, 2021•13 citations
Considering the problem of how to efficiently transmit unknown quantum states in multi-unicast networks, we propose a nonlinear quantum network coding scheme with classical communication resource. On the conditions of free classical communication between adjacent nodes in a network, as well as unlimited capacities of classical channels, perfect quantum network coding is available. By means of local phase deviation correction, we design the encoding procedure of nonlinear coding scheme. Moreover, we provide the upper bound on the total number of classical communication which is required to achieve quantum communication, as well as the analysis of scheme property.
This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that classical communication is free. The task is to perfectly transfer an unknown quantum state from a source subsystem to a target subsystem, where both source and target are formed by ordered sets of some of the nodes. It is proved that a lower bound of the rate at which this quantum communication task is possible is given by the classical min-cut max-flow theorem of network coding, where the capacities in question are the quantum capacities of the edges of the network.
The k-pair problem in network coding theory asks to send k messages simultaneously between k source-target pairs over a directed acyclic graph. In a previous paper [ICALP 2009, Part I, pages 622-633] the present authors showed that if a classical k-pair problem is solvable by means of a linear coding scheme, then the quantum k-pair problem over the same graph is also solvable, provided that classical communication can be sent for free between any pair of nodes of the graph. Here we address the main case that remained open in our previous work, namely whether nonlinear classical network coding schemes can also give rise to quantum network coding schemes. This question is motivated by the fact that there are networks for which no linear solutions exist to the k-pair problem, whereas nonlinear solutions exist. In the present paper we overcome the limitation to linear protocols and describe a new communication protocol for perfect quantum network coding that improves over the previous one as follows: (i) the new protocol does not put any condition on the underlying classical coding scheme, that is, it can simulate nonlinear communication protocols as well, and (ii) the amount of classical communication sent in the protocol is significantly reduced.
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.
Nowadays, network coding has been a very successful topic in information theory including many applications such as wireless networks while one of the simplest benefits is the efficient transmission in networks by allowing us to encode the transmitted information at every intermediate node. Since quantum information is much more expensive for communication than classical information, it was natural that this benefit made quantum researchers motivate the study of “quantum network coding.” This paper reports the current status of quantum network coding. At present, quantum network coding mostly means sending quantum information (rather than classical information) in a quantum network. Since quantum information cannot be cloned (the quantum no-cloning theorem), multiple unicast networks have been well-studied (in several settings). We present some of the known possibilities and limitations, and future works of quantum network coding, focusing on multiple unicast networks.
It is natural in a quantum network system that multiple users intend to send their quantum message to their respective receivers, which is called a multiple unicast quantum network. We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network from a secure classical network code. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack when the attack satisfies a certain natural condition. In our security proof, the eavesdropper is allowed to modify wiretapped information dependently on the previously wiretapped messages. Our protocol guarantees the secrecy by utilizing one-way classical information transmission (public communication) in the same direction as the quantum network although the verification of quantum information transmission requires two-way classical communication. In the protocol, some nodes may share secret randomness as resources in advance. Our secure network code can be applied to several networks including the butterfly network.
Abstract We propose a scheme where one can exploit auxiliary resources to achieve quantum multicast communication with network coding over the butterfly network. In this paper, we propose the quantum 2-pair multicast communication scheme, and extend it to k-pair multicast communication over the extended butterfly network. Firstly, an EPR pair is shared between each adjacent node on the butterfly network, and make use of local operation and classical communication to generate entangled relationship between non-adjacent nodes. Secondly, each sender adds auxiliary particles according to the multicast number k, in which the CNOT operations are applied to form the multi-particle entangled state. Finally, combined with network coding and free classical communication, quantum multicast communication based on quantum measurements is completed over the extended butterfly network. Not only the bottleneck problem is solved, but also quantum multicast communication can be completed in our scheme. At the same time, regardless of multicast number k, the maximum capacity of classical channel is 2 bits, and quantum channel is used only once.