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

arXiv:1909.02342 · Advanced Quantum Technologies

Exploring the Limitations of Quantum Networking through Butterfly‐Based Networks

Kieran N. Wilkinson, Thomas P. W. Cope, Stefano Pirandola

Published Dec 9, 2019• 2 citations
arXivHTMLPDF

Abstract

Abstract The classical and quantum networking regimes of the butterfly network and a group of larger networks constructed with butterfly network blocks are investigated. By considering simultaneous multicasts from a set of senders to a set of receivers, the corresponding rates for transmitting classical and quantum information through the networks are analyzed. More precisely, achievable rates (i.e., lower bounds) for classical communication are compared with upper bounds for quantum communication, quantifying the performance gap between the rates for networks connected by identity, depolarizing, and erasure channels. For each network considered, a range is observed over which the classical rate non‐trivially exceeds the quantum capacity. It is found that, by adding butterfly blocks in parallel, the difference between transmitted bits and qubits can be increased up to one extra bit per receiver in the case of perfect transmission (identity channels). The aim is to provide a quantitative analysis of those network configurations which are particularly disadvantageous for quantum networking, when compared to classical communication. By clarifying the performance of these “negative cases,” some guidance on how quantum networks should be built is also provided.

DOI
10.1002/qute.201900103

Related papers

Quantum Network Communication—The Butterfly and Beyond

Debbie Leung, Jonathan Oppenheim, Andreas Winter

We study the problem ofk-pair communication (or multiple unicast problem) of quantum information in networks of quantum channels. We consider the asymptotic rates of high fidelity quantum communication between specific sender-receiver pairs. Four scenarios of classical communication assistance (none, forward, backward, and two-way) are considered. (I) We obtain outer and inner bounds of the achievable rate regions in the most general directed networks. (II) For two particular networks (including the butterfly network), routing is proved optimal, and the free assisting classical communication can at best be used to modify the directions of quantum channels in the network. Consequently, the achievable rate regions are given by counting edge avoiding paths, and precise achievable rate regions in all four assisting scenarios can be obtained. (III) Optimality of routing can also be proved in classes of networks. The first class consists of directed unassisted networks in which (1) the receivers are information sinks, (2) the maximum distance from senders to receivers is small, and (3) a certain type of 4-cycles are absent, but without further constraints (such as on the number of communicating and intermediate parties). The second class consists of arbitrary backward-assisted networks with two sender-receiver pairs. (IV) Beyond thek-pair communication problem, observations are made on quantum multicasting and a static version of network communication related to the entanglement of assistance.

arXiv:quant-ph/0608223•IEEE Transactions on Information Theory•Jun 23, 2010•144 citations

Bounds for multi-end communication over quantum networks

Stefano Pirandola

Abstract Quantum and private communications are affected by a fundamental limitation which severely restricts the optimal rates that are achievable by two distant parties. To overcome this problem, one needs to introduce quantum repeaters and, more generally, quantum communication networks. Within a quantum network, other problems and features may appear when we move from the basic unicast setting of single-sender/single-receiver to more complex multiend scenarios, where multiple senders and multiple receivers simultaneously use the network to communicate. Assuming various configurations, including multiple-unicast, multicast, and multiple-multicast communication, we bound the optimal rates for transmitting quantum information, distributing entanglement, or generating secret keys in quantum networks connected by arbitrary quantum channels. These bounds cannot be surpassed by the most general adaptive protocols of quantum network communication.

arXiv:1905.12677•Quantum Science and Technology•Sep 24, 2019•53 citations

Prior entanglement between senders enables perfect quantum network coding with modification

Masahito Hayashi

We find a protocol transmitting two quantum states crossly in the butterfly network only with prior entanglement between two senders. This protocol requires only one qubit transmission or two classical bits (cbits) transmission in each channel in the butterfly network. It is also proved that it is impossible without prior entanglement. More precisely, an upper bound of average fidelity is given in the butterfly network when prior entanglement is not allowed. The presented result concerns only the butterfly network, but our techniques can be applied to a more general graph.

arXiv:0706.0197•Physical Review A•Oct 10, 2007•139 citations

Analysing and reducing the limitations of continuous-variable quantum cryptography and quantum networks

Kieran N. Wilkinson

Due to a recent influx of attention, the field of quantum information is rapidly progressing towards the point at which quantum technologies move from the laboratory to widespread community use. However, several difficulties must be overcome before this milestone can be achieved. Two such difficulties are addressed in this thesis. The first is the ever-growing security threat posed by quantum computers to existing cryptographic protocols and the second is the missing knowledge regarding the performance differences between quantum and classical communications over various existing network topologies. Continuous-variable (CV) quantum key distribution (QKD) poses a practical solution to the security risks implied by the advancement of quantum information theory, with the promise of provably secure communications. Unfortunately, the maximum range of many CV-QKD protocols is limited. Here, this limitation is addressed by the application of post-selection, firstly, to a scenario in which two parties communicate using terahertz frequency radiation in the atmosphere, and secondly, to measurement-device-independent QKD, in which two parties communicate through the medium of an untrusted relay. In both cases, the introduction of post-selection enables security over distances substantially exceeding those of equivalent existing protocols. The second difficulty is addressed by a comparison of the quantum and classical networking regimes of the butterfly network and a group of networks constructed with butterfly blocks. By computing the achievable classical rates and upper bounds for quantum communication, the performance difference between the two regimes is quantified, and a range of conditions is established under which classical networking outperforms its quantum counterpart. This allows for guidance to be provided on which network structures should be avoided when constructing a quantum internet.

•Jan 1, 2020•0 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

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
Abstract The classical and quantum networking regimes of the butterfly network and a group of larger networks constructed with butterfly network blocks are investigated. By considering simultaneous multicasts from a set of senders to a set of receivers, the corresponding rates for transmitting classical and quantum information through the networks are analyzed. More precisely, achievable rates (i.e., lower bounds) for classical communication are compared with upper bounds for quantum communication, quantifying the performance gap between the rates for networks connected by identity, depolarizing, and erasure channels. For each network considered, a range is observed over which the classical rate non‐trivially exceeds the quantum capacity. It is found that, by adding butterfly blocks in parallel, the difference between transmitted bits and qubits can be increased up to one extra bit per receiver in the case of perfect transmission (identity channels). The aim is to provide a quantitative analysis of those network configurations which are particularly disadvantageous for quantum networking, when compared to classical communication. By clarifying the performance of these “negative cases,” some guidance on how quantum networks should be built is also provided.
We study the problem ofk-pair communication (or multiple unicast problem) of quantum information in networks of quantum channels. We consider the asymptotic rates of high fidelity quantum communication between specific sender-receiver pairs. Four scenarios of classical communication assistance (none, forward, backward, and two-way) are considered. (I) We obtain outer and inner bounds of the achievable rate regions in the most general directed networks. (II) For two particular networks (including the butterfly network), routing is proved optimal, and the free assisting classical communication can at best be used to modify the directions of quantum channels in the network. Consequently, the achievable rate regions are given by counting edge avoiding paths, and precise achievable rate regions in all four assisting scenarios can be obtained. (III) Optimality of routing can also be proved in classes of networks. The first class consists of directed unassisted networks in which (1) the receivers are information sinks, (2) the maximum distance from senders to receivers is small, and (3) a certain type of 4-cycles are absent, but without further constraints (such as on the number of communicating and intermediate parties). The second class consists of arbitrary backward-assisted networks with two sender-receiver pairs. (IV) Beyond thek-pair communication problem, observations are made on quantum multicasting and a static version of network communication related to the entanglement of assistance.
Abstract Quantum and private communications are affected by a fundamental limitation which severely restricts the optimal rates that are achievable by two distant parties. To overcome this problem, one needs to introduce quantum repeaters and, more generally, quantum communication networks. Within a quantum network, other problems and features may appear when we move from the basic unicast setting of single-sender/single-receiver to more complex multiend scenarios, where multiple senders and multiple receivers simultaneously use the network to communicate. Assuming various configurations, including multiple-unicast, multicast, and multiple-multicast communication, we bound the optimal rates for transmitting quantum information, distributing entanglement, or generating secret keys in quantum networks connected by arbitrary quantum channels. These bounds cannot be surpassed by the most general adaptive protocols of quantum network communication.
We find a protocol transmitting two quantum states crossly in the butterfly network only with prior entanglement between two senders. This protocol requires only one qubit transmission or two classical bits (cbits) transmission in each channel in the butterfly network. It is also proved that it is impossible without prior entanglement. More precisely, an upper bound of average fidelity is given in the butterfly network when prior entanglement is not allowed. The presented result concerns only the butterfly network, but our techniques can be applied to a more general graph.
Due to a recent influx of attention, the field of quantum information is rapidly progressing towards the point at which quantum technologies move from the laboratory to widespread community use. However, several difficulties must be overcome before this milestone can be achieved. Two such difficulties are addressed in this thesis. The first is the ever-growing security threat posed by quantum computers to existing cryptographic protocols and the second is the missing knowledge regarding the performance differences between quantum and classical communications over various existing network topologies. Continuous-variable (CV) quantum key distribution (QKD) poses a practical solution to the security risks implied by the advancement of quantum information theory, with the promise of provably secure communications. Unfortunately, the maximum range of many CV-QKD protocols is limited. Here, this limitation is addressed by the application of post-selection, firstly, to a scenario in which two parties communicate using terahertz frequency radiation in the atmosphere, and secondly, to measurement-device-independent QKD, in which two parties communicate through the medium of an untrusted relay. In both cases, the introduction of post-selection enables security over distances substantially exceeding those of equivalent existing protocols. The second difficulty is addressed by a comparison of the quantum and classical networking regimes of the butterfly network and a group of networks constructed with butterfly blocks. By computing the achievable classical rates and upper bounds for quantum communication, the performance difference between the two regimes is quantified, and a range of conditions is established under which classical networking outperforms its quantum counterpart. This allows for guidance to be provided on which network structures should be avoided when constructing a quantum internet.
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.
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.