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

Chinese Physics B

Quantum multicast communication over the butterfly network

Xing-Bo Pan, Xiu‐Bo Chen, Gang Xu, Zhao Dou, Zongpeng Li, Yixian Yang

Published Aug 25, 2021• 12 citations
Publisher

Abstract

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.

DOI
10.1088/1674-1056/ac20c6

Related papers

Quantum Network Coding For Remote State Preparation of Multi-qudit States

Xu Wang, Chen Chen, Min Jiang +1 more

the purpose of this paper is to promote a butterfly quantum network coding scheme for remote state preparation of multi-qudit states. Firstly, we perform channel preparation and amplitude modulation; secondly, each sender simultaneously performs projection measurement; thirdly, both senders send measurement results as precoding information and auxiliary information to the intermediate node and the neighboring receivers respectively; fourthly, the first intermediate node performs encoding operation and sends the encoded information to both receivers via next intermediate node. Finally, by decoding the coded information with auxiliary information, two receivers perform corresponding unitary operations to recover the target multi-qudit quantum states. Compared with other schemes, our scheme can enhance the throughput and transmission efficiency of communication network for remote state preparation of multi-qudit states.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Oct 1, 2019•5 citations

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•141 citations

General Scheme for Perfect Quantum Network Coding with Free Classical Communication

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

This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general — indeed, it is impossible even for the simple butterfly network. As additional resource we allow free classical communication between any pair of network nodes. It is shown that perfect quantum network coding is achievable in this model whenever classical network coding is possible over the same network when replacing all quantum capacities by classical capacities. More precisely, it is proved that perfect quantum network coding using free classical communication is possible over a network with k source-target pairs if there exists a classical linear (or even vector-linear) coding scheme over a finite ring. Our proof is constructive in that we give explicit quantum coding operations for each network node. This paper also gives an upper bound on the number of classical communication required in terms of k, the maximal fan-in of any network node, and the size of the network. x1 x2 s1 ♠ s2 ♠ ❍❍❍❍ ❥ x1 x2 ✟ n1 x1 x1 ⊕ x2 x2 n2 ♠ x1 ⊕ x2✟ ❍❍❍❍ ❥ x1 ⊕ x2

•Jan 1, 2009•57 citations

High dimensional quantum network coding based on prediction mechanism over the butterfly network

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

Abstract The high-dimensional quantum system greatly improve the quantum channel capacity and information storage space, and achieve high-dimensional quantum information transmission, which enhance the speed of quantum computing and quantum information processing. In this paper, a high-dimensional quantum teleportation protocol without information loss is proposed. We consider pre-sharing a high-dimensional non-maximum entangled state as a quantum channel between sender and receiver. By adding auxiliary particle and performing high-dimensional local operations, it is possible to achieve high-dimensional quantum teleportation without information loss. Simultaneously, we apply the protocol to butterfly network, and propose a novel high-dimensional quantum network coding based on prediction mechanism. In our scheme, we use Z -{|0⟩, |1⟩} basis to predict the transmission of high dimensional states over the butterfly network. When the prediction is successful, the deterministic transmission of high-dimensional quantum states can be realized over the butterfly network. Our scheme greatly saves the usage of quantum and classical channels, which improves the utilization efficiency of both channels.

Quantum Science and Technology•Oct 26, 2021•9 citations

Effect of Quantum correlation on Perfect K pair Quantum Network Coding

M. Mahdian, Roghayeh Bayramzadeh

We find a protocol transmitting K quantum states crossly in the quantum networks with K pair sender-receiver and one bottleneck channels only with sharing quantum correlations between senders. In these networks senders want to multi cast perfect quantum states to receivers. Perfect send on the quantum networks is impossible just using some additional resources like quantum correlation. This protocol has been used maximum entangled states and Quantum Discord which is best indicator of the quantum nature of the correlation to sharing between senders. At first, to send perfect K states in quantum network applied some maximum entanglement states to teleport quantum states, Enistein - Podolsky - Rosen (EPR) states as simple and two qubit states and Grrenberger- Horne - Zeilinger (GHZ) states and W states as kinds of three qubit states. Then reached that there is no difference between sharing these maximum entanglement states and must send same amount of classical bits in bottleneck channel. In the second part of this paper of sharing Quantum Correlation (quantum discord) perfect send of two quantum states is possible in the Butterfly network with fidelity equal one.

arXiv:1307.1948•Jul 8, 2013•0 citations

Quantum Network Coding for General Graphs

Kazuo Iwama, Harumichi Nishimura, Rudy Raymond +1 more

Network coding is often explained by using a small network model called Butterfly. In this network, there are two flow paths, s_1 to t_1 and s_2 to t_2, which share a single bottleneck channel of capacity one. So, if we consider conventional flow (of liquid, for instance), then the total amount of flow must be at most one in total, say 1/2 for each path. However, if we consider information flow, then we can send two bits (one for each path) at the same time by exploiting two side links, which are of no use for the liquid-type flow, and encoding/decoding operations at each node. This is known as network coding and has been quite popular since its introduction by Ahlswede, Cai, Li and Yeung in 2000. In QIP 2006, Hayashi et al showed that quantum network coding is possible for Butterfly, namely we can send two qubits simultaneously with keeping their fidelity strictly greater than 1/2. In this paper, we show that the result can be extended to a large class of general graphs by using a completely different approach. The underlying technique is a new cloning method called entanglement-free cloning which does not produce any entanglement at all. This seems interesting on its own and to show its possibility is an even more important purpose of this paper. Combining this new cloning with approximation of general quantum states by a small number of fixed ones, we can design a quantum network coding protocol which ``simulates'' its classical counterpart for the same graph.

arXiv:quant-ph/0611039•Nov 3, 2006•17 citations
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.
the purpose of this paper is to promote a butterfly quantum network coding scheme for remote state preparation of multi-qudit states. Firstly, we perform channel preparation and amplitude modulation; secondly, each sender simultaneously performs projection measurement; thirdly, both senders send measurement results as precoding information and auxiliary information to the intermediate node and the neighboring receivers respectively; fourthly, the first intermediate node performs encoding operation and sends the encoded information to both receivers via next intermediate node. Finally, by decoding the coded information with auxiliary information, two receivers perform corresponding unitary operations to recover the target multi-qudit quantum states. Compared with other schemes, our scheme can enhance the throughput and transmission efficiency of communication network for remote state preparation of multi-qudit states.
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.
This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general — indeed, it is impossible even for the simple butterfly network. As additional resource we allow free classical communication between any pair of network nodes. It is shown that perfect quantum network coding is achievable in this model whenever classical network coding is possible over the same network when replacing all quantum capacities by classical capacities. More precisely, it is proved that perfect quantum network coding using free classical communication is possible over a network with k source-target pairs if there exists a classical linear (or even vector-linear) coding scheme over a finite ring. Our proof is constructive in that we give explicit quantum coding operations for each network node. This paper also gives an upper bound on the number of classical communication required in terms of k, the maximal fan-in of any network node, and the size of the network. x1 x2 s1 ♠ s2 ♠ ❍❍❍❍ ❥ x1 x2 ✟ n1 x1 x1 ⊕ x2 x2 n2 ♠ x1 ⊕ x2✟ ❍❍❍❍ ❥ x1 ⊕ x2
Abstract The high-dimensional quantum system greatly improve the quantum channel capacity and information storage space, and achieve high-dimensional quantum information transmission, which enhance the speed of quantum computing and quantum information processing. In this paper, a high-dimensional quantum teleportation protocol without information loss is proposed. We consider pre-sharing a high-dimensional non-maximum entangled state as a quantum channel between sender and receiver. By adding auxiliary particle and performing high-dimensional local operations, it is possible to achieve high-dimensional quantum teleportation without information loss. Simultaneously, we apply the protocol to butterfly network, and propose a novel high-dimensional quantum network coding based on prediction mechanism. In our scheme, we use Z -{|0⟩, |1⟩} basis to predict the transmission of high dimensional states over the butterfly network. When the prediction is successful, the deterministic transmission of high-dimensional quantum states can be realized over the butterfly network. Our scheme greatly saves the usage of quantum and classical channels, which improves the utilization efficiency of both channels.
We find a protocol transmitting K quantum states crossly in the quantum networks with K pair sender-receiver and one bottleneck channels only with sharing quantum correlations between senders. In these networks senders want to multi cast perfect quantum states to receivers. Perfect send on the quantum networks is impossible just using some additional resources like quantum correlation. This protocol has been used maximum entangled states and Quantum Discord which is best indicator of the quantum nature of the correlation to sharing between senders. At first, to send perfect K states in quantum network applied some maximum entanglement states to teleport quantum states, Enistein - Podolsky - Rosen (EPR) states as simple and two qubit states and Grrenberger- Horne - Zeilinger (GHZ) states and W states as kinds of three qubit states. Then reached that there is no difference between sharing these maximum entanglement states and must send same amount of classical bits in bottleneck channel. In the second part of this paper of sharing Quantum Correlation (quantum discord) perfect send of two quantum states is possible in the Butterfly network with fidelity equal one.
Network coding is often explained by using a small network model called Butterfly. In this network, there are two flow paths, s_1 to t_1 and s_2 to t_2, which share a single bottleneck channel of capacity one. So, if we consider conventional flow (of liquid, for instance), then the total amount of flow must be at most one in total, say 1/2 for each path. However, if we consider information flow, then we can send two bits (one for each path) at the same time by exploiting two side links, which are of no use for the liquid-type flow, and encoding/decoding operations at each node. This is known as network coding and has been quite popular since its introduction by Ahlswede, Cai, Li and Yeung in 2000. In QIP 2006, Hayashi et al showed that quantum network coding is possible for Butterfly, namely we can send two qubits simultaneously with keeping their fidelity strictly greater than 1/2. In this paper, we show that the result can be extended to a large class of general graphs by using a completely different approach. The underlying technique is a new cloning method called entanglement-free cloning which does not produce any entanglement at all. This seems interesting on its own and to show its possibility is an even more important purpose of this paper. Combining this new cloning with approximation of general quantum states by a small number of fixed ones, we can design a quantum network coding protocol which ``simulates'' its classical counterpart for the same graph.