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

Secure quantum network coding for controlled repeater networks

Tao Shang, Jiao Li, Jianwei Liu

Published Apr 26, 2016• 8 citations
Publisher
DOI
10.1007/s11128-016-1323-y

Related papers

Quantum network coding for general repeater networks

Tao Shang, Jiao Li, Zhuang Pei +1 more

Quantum Information Processing•Jul 13, 2015•22 citations

Quantum Network Coding Based on Repeater

Tao Shang, Jianwei Liu

Springer eBooks•Jan 1, 2020•0 citations

Security of partially corrupted quantum repeater networks

Adrian Harkness, Walter O. Krawec, Bing Wang

Abstract Quantum Key Distribution allows two parties to establish a secret key that is secure against computationally unbounded adversaries. To extend the distance between parties, quantum networks are vital. Typically, security in such scenarios assumes the absolute worst case: namely, an adversary has complete control over all repeaters and fiber links in a network and is able to replace them with perfect devices, thus allowing her to hide her attack within the expected natural noise. In a large-scale network, however, such a powerful attack may be infeasible. In this paper, we analyze the case where the adversary can only corrupt a subset of the repeater network connecting Alice and Bob, while some portion of the network near Alice and Bob may be considered safe from attack (though still noisy). We derive a rigorous finite key proof of security assuming this attack model, and show that improved performance and noise tolerances are possible. Our proof methods may be useful to other researchers investigating partially corrupted quantum networks, and our main result may be beneficial to future network operators.

arXiv:2406.16651•Quantum Science and Technology•Sep 9, 2024•6 citations

Quantum Network Coding Based on Controlled Teleportation

Tao Shang, Xiaojie Zhao, Jianwei Liu

This letter proposes new quantum network coding schemes based on controlled teleportation to control the decoding process of receivers in a butterfly network. Firstly, a quantum network coding scheme with two controllers is proposed based on the paradigm XQQ (crossing two qubits) protocol. Then the other scheme based on the perfect quantum network coding protocol with prior entanglement is designed for high fidelity. By introducing the controller, our schemes realize that the decoding process of unicast stream can be controlled, which is helpful to extend these schemes to a general network with unicast or multicast. Our schemes also provide a convenient model to combine authentication into quantum network and would be significant to enhance the security of quantum communication.

IEEE Communications Letters•Apr 8, 2014•27 citations

Secure Quantum Network Coding Theory

Tao Shang, Jianwei Liu

Springer eBooks•Jan 1, 2020•8 citations

Analysis of quantum network coding for realistic repeater networks

Takahiko Satoh, Kaori Ishizaki, Shota Nagayama +1 more

Quantum repeater networks have attracted attention for the implementation of long-distance and large-scale sharing of quantum states. Recently, researchers extended classical network coding, which is a technique for throughput enhancement, into quantum information. The utility of quantum network coding (QNC) has been shown under ideal conditions, but it has not been studied previously under conditions of noise and shortage of quantum resources. We analyzed QNC on a butterfly network, which can create end-to-end Bell pairs at twice the rate of the standard quantum network repeater approach. The joint fidelity of creating two Bell pairs has a small penalty for QNC relative to entanglement swapping. It will thus be useful when we care more about throughput than fidelity. We found that the output fidelity drops below 0.5 when the initial Bell pairs have fidelity $F<0.90$, even with perfect local gates. Local gate errors have a larger impact on quantum network coding than on entanglement swapping.

arXiv:1508.02141•Physical Review A•Mar 1, 2016•46 citations
Abstract Quantum Key Distribution allows two parties to establish a secret key that is secure against computationally unbounded adversaries. To extend the distance between parties, quantum networks are vital. Typically, security in such scenarios assumes the absolute worst case: namely, an adversary has complete control over all repeaters and fiber links in a network and is able to replace them with perfect devices, thus allowing her to hide her attack within the expected natural noise. In a large-scale network, however, such a powerful attack may be infeasible. In this paper, we analyze the case where the adversary can only corrupt a subset of the repeater network connecting Alice and Bob, while some portion of the network near Alice and Bob may be considered safe from attack (though still noisy). We derive a rigorous finite key proof of security assuming this attack model, and show that improved performance and noise tolerances are possible. Our proof methods may be useful to other researchers investigating partially corrupted quantum networks, and our main result may be beneficial to future network operators.
This letter proposes new quantum network coding schemes based on controlled teleportation to control the decoding process of receivers in a butterfly network. Firstly, a quantum network coding scheme with two controllers is proposed based on the paradigm XQQ (crossing two qubits) protocol. Then the other scheme based on the perfect quantum network coding protocol with prior entanglement is designed for high fidelity. By introducing the controller, our schemes realize that the decoding process of unicast stream can be controlled, which is helpful to extend these schemes to a general network with unicast or multicast. Our schemes also provide a convenient model to combine authentication into quantum network and would be significant to enhance the security of quantum communication.
Quantum repeater networks have attracted attention for the implementation of long-distance and large-scale sharing of quantum states. Recently, researchers extended classical network coding, which is a technique for throughput enhancement, into quantum information. The utility of quantum network coding (QNC) has been shown under ideal conditions, but it has not been studied previously under conditions of noise and shortage of quantum resources. We analyzed QNC on a butterfly network, which can create end-to-end Bell pairs at twice the rate of the standard quantum network repeater approach. The joint fidelity of creating two Bell pairs has a small penalty for QNC relative to entanglement swapping. It will thus be useful when we care more about throughput than fidelity. We found that the output fidelity drops below 0.5 when the initial Bell pairs have fidelity F<0.90F<0.90F<0.90, even with perfect local gates. Local gate errors have a larger impact on quantum network coding than on entanglement swapping.