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

Quantum Information Processing

Counterfactual quantum network coding without prior shared entanglement

Bing‐Xin Liu, Yu‐Guang Yang, Guang‐Bao Xu, Dong‐Huan Jiang, Tao Shang, Yi‐Hua Zhou, Wei-Min Shi

Published Apr 16, 2025• 4 citations
Publisher
DOI
10.1007/s11128-025-04724-7

Related papers

Counterfactual quantum networks based on multipartite GHZ entangled communication

Hao Jia, Yu‐Guang Yang, Yuechao Wang +4 more

Quantum Information Processing•Nov 13, 2025•1 citation

Quantum Network Coding Based on Entanglement Distribution

Tao Shang, Ran Liu, Chengran Fang +1 more

Lecture notes in computer science•Jan 1, 2019•3 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•48 citations

Quantum network coding without loss of information

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

Quantum Information Processing•Feb 1, 2021•22 citations

Counterfactual quantum-information transfer without transmitting any physical particles

Qi Guo, Liu‐Yong Cheng, Li Chen +2 more

We demonstrate quantum information can be transferred between two distant participants without any physical particles traveling between them. The key procedure of the counterfactual scheme is to entangle two nonlocal qubits with each other without interaction, so the scheme can also be used to generate nonlocal entanglement counterfactually. We here illustrate the scheme by using flying photon qubits and Rydberg atom qubits assisted by a mesoscopic atomic ensemble. Unlike the typical teleportation, the present scheme can transport an unknown qubit in a nondeterministic manner without prior entanglement sharing or classical communication between the two distant participants.

arXiv:1404.6401•Scientific Reports•Feb 12, 2015•49 citations

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
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.
We demonstrate quantum information can be transferred between two distant participants without any physical particles traveling between them. The key procedure of the counterfactual scheme is to entangle two nonlocal qubits with each other without interaction, so the scheme can also be used to generate nonlocal entanglement counterfactually. We here illustrate the scheme by using flying photon qubits and Rydberg atom qubits assisted by a mesoscopic atomic ensemble. Unlike the typical teleportation, the present scheme can transport an unknown qubit in a nondeterministic manner without prior entanglement sharing or classical communication between the two distant participants.
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.