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

Science China Information Sciences

Quantum network coding for multi-unicast problem based on 2D and 3D cluster states

Jing Li, Xiu‐Bo Chen, Xingming Sun, Zongpeng Li, Yixian Yang

Published Feb 19, 2016• 33 citations
Publisher
DOI
10.1007/s11432-016-5539-3

Related papers

Robust Quantum Network Coding on 2D Cluster States via Entanglement Purification in Noisy Environments

佳明 李

Computer Science and Application•Jan 1, 2026•0 citations

Perfect quantum multiple-unicast network coding protocol

Dandan Li, Fei Gao, Su‐Juan Qin +1 more

Quantum Information Processing•Dec 8, 2017•31 citations

Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free Public Communication

Go Kato, Masaki Owari, Masahito Hayashi

Lecture notes in computer science•Jan 1, 2017•11 citations

On quantum network coding

Avinash Jain, Massimo Franceschetti, David Meyer

We study the problem of error-free multiple unicast over directed acyclic networks in a quantum setting. We provide a new information-theoretic proof of the known result that network coding does not achieve a larger quantum information flow than what can be achieved by routing for two-pair communication on the butterfly network. We then consider a k-pair multiple unicast problem and for all k ⩾ 2 we show that there exists a family of networks where quantum network coding achieves k-times larger quantum information flow than what can be achieved by routing. Finally, we specify a graph-theoretic sufficient condition for the quantum information flow of any multiple unicast problem to be bounded by the capacity of any sparsest multicut of the network.

Journal of Mathematical Physics•Mar 1, 2011•24 citations

Quantum Network Coding

Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura +2 more

arXiv:quant-ph/0601088•Springer eBooks•May 23, 2007•148 citations

Quantum Network Coding

Ri‐Gui Zhou, Xiaoxue Zhang, Lin-Tao Du

Springer eBooks•Jan 1, 2024•1 citation
We study the problem of error-free multiple unicast over directed acyclic networks in a quantum setting. We provide a new information-theoretic proof of the known result that network coding does not achieve a larger quantum information flow than what can be achieved by routing for two-pair communication on the butterfly network. We then consider a k-pair multiple unicast problem and for all k ⩾ 2 we show that there exists a family of networks where quantum network coding achieves k-times larger quantum information flow than what can be achieved by routing. Finally, we specify a graph-theoretic sufficient condition for the quantum information flow of any multiple unicast problem to be bounded by the capacity of any sparsest multicut of the network.