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

Conference on Information Sciences and Systems

On Multicast in Quantum Networks

Yaoyun Shi, Emina Soljanin

Published Mar 1, 2006• 36 citations
Publisher

Abstract

We consider quantum multicast networks in which quantum states generated by multiple sources have to be simultaneously delivered to multiple receivers. We demonstrate that in addition to the apparent similarity to the multicommodity flow problems, quantum networks, to a certain extent, behave as classical communication networks. In particular, we show that lossless compression of special multicast quantum states is possible and significantly reduces the edge capacity requirements of the multicast.

DOI
10.1109/ciss.2006.286589

Related papers

Multicast quantum network coding as optimal symmetric universal cloning over a quantum network

Go Kato, Mio Murao, Masaki Owari

We study the problem of perfectly multicasting symmetric universal clones of unknown quantum states over quantum networks with free classical communication. We construct a protocol that multicasts symmetric universal clones of input states from multiple source nodes by extending the quantum network coding protocol proposed by Kobayashi et al. We further establish a sufficient condition for perfect multicast in the single-source setting. Specifically, we show that when a single copy of a $q^r$-dimensional input state is available at the source node, where $q$ is a sufficiently large prime power, perfect multicast of the corresponding symmetric universal clone is achievable using a small amount of entanglement shared among the target nodes. This result holds for quantum networks represented by an undirected graph $G$, where each edge corresponds to a noiseless $q$-dimensional quantum channel, provided that there exists an acyclic directed graph $G'$ obtained by assigning directions to the edges of $G$ such that the minimum cut of $G'$ is at least $r$.

quant-pharXiv:2608.18471•Lecture notes in electrical engineering•Aug 20, 2026•0 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

Quantum network coding with adjustable fidelity

Yuchen Liu, Tao Shang, Jiayu Liu

Multicast of unknown quantum states is an unavoidable issue in the construction of quantum networks. Most existing quantum network coding schemes can only restore an unknown state at one of the target nodes during multicast. In this paper, we propose a quantum network coding scheme to multicast unknown quantum states in networks with linear network coding. Concretely, GHZ states are generated between each sender and all receivers. Unknown states are then sent and stored in the entangled state shared by the receivers. Finally, the receivers use asymmetric optimal universal cloning to obtain the required states. The scheme achieved to multicast within 1 quantum transmission and 2 classical transmissions in networks with constrained classical communication. Compared to other schemes, our scheme allows receivers to autonomously adjust the fidelity without the sender knowing the requirements.

Quantum Review Letters•Jan 1, 2025•2 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

Asymmetric Quantum Multicast Network Coding: Asymmetric Optimal Cloning over Quantum Networks

Yuichi Hirota, Masaki Owari

Multicasting of quantum states is an essential feature of quantum internet. Since the noncloning theorem prohibits perfect cloning of an unknown quantum state, an appropriate protocol may depend on the purpose of the multicast. In this paper, we treat the multicasting of a single copy of an unknown state over a quantum network with free classical communication. We especially focus on protocols exactly multicasting an asymmetric optimal universal clone. Hence, these protocols are optimal and universal in terms of mean fidelity between input and output states, but the fidelities can depend on target nodes. Among these protocols, a protocol spending smaller communication resources is preferable. Here, we construct such a protocol attaining the min-cut of the network described as follows. Two (three) asymmetric optimal clones of an input state are created at a source node. Then, the state is divided into classical information and a compressed quantum state. The state is sent to two (three) target nodes using the quantum network coding. Finally, the asymmetric clones are reconstructed using LOCC with a small amount of entanglement shared among the target nodes and the classical information sent from the source node.

arXiv:1908.00705•Applied Sciences•Jun 17, 2022•7 citations

Efficient Transmission of Information on the Quantum Network(New Trends in Theory of Computation and Algorithm)

Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura +2 more

Since quantum information is continuous, its handling is sometimes surprisingly harder than the classical counterpart.A typical example is cloning; making a copy of digital information is straightforward but it is not possible exactly for quantum information.The question in this paper is whether or not quantum network coding is possible.Its classical counterpart is another good example to show that digital information flow can be done much more efficiently than conventional (say, liquid) flow.Our answer to the question is similar to the case of cloning, namely, it is shown that quantum network coding is possible if approximation is allowed, by using a simple network model called Butterfly.In this network, there are two flow paths, $s_{1}$ to $t_{1}$ and $s_{2}$ to $t_{2}$ , which shares a single bottleneck channel of capacity one.In the classical case, we can send two bits simultaneously, one for each path, in spite of the bottleneck.Our results for quantum network coding include: (i) We can send any quantum state $|\psi_{1}\rangle$ from $s_{1}$ to $t_{1}$ and $|\psi_{2}\rangle$ from s2 to $t_{2}$ simultaneously with a fidelity strictly greater than 1/2.(ii) If one of $|\psi_{\mathrm{k}}\rangle$ and $|\psi_{2}\rangle$ is classical, then the fidelity can be improved to 2/3.(iii) Similar improvement is also possible if $\mathrm{C}\mathrm{b}_{\mathrm{i}}\rangle$ and $1\mathrm{C}\mathrm{b}2\rangle$ are restricted to only a finite number of (previously known) states.This allows us to design an interesting protocol which can send two classical bits from $s_{1}$ to $t_{1}$ (similarly from $s_{2}$ to $t_{2}$ ) but only one of them should be recovered.

•May 1, 2006•0 citations
We consider quantum multicast networks in which quantum states generated by multiple sources have to be simultaneously delivered to multiple receivers. We demonstrate that in addition to the apparent similarity to the multicommodity flow problems, quantum networks, to a certain extent, behave as classical communication networks. In particular, we show that lossless compression of special multicast quantum states is possible and significantly reduces the edge capacity requirements of the multicast.
We study the problem of perfectly multicasting symmetric universal clones of unknown quantum states over quantum networks with free classical communication. We construct a protocol that multicasts symmetric universal clones of input states from multiple source nodes by extending the quantum network coding protocol proposed by Kobayashi et al. We further establish a sufficient condition for perfect multicast in the single-source setting. Specifically, we show that when a single copy of a qrq^rqr-dimensional input state is available at the source node, where qqq is a sufficiently large prime power, perfect multicast of the corresponding symmetric universal clone is achievable using a small amount of entanglement shared among the target nodes. This result holds for quantum networks represented by an undirected graph GGG, where each edge corresponds to a noiseless qqq-dimensional quantum channel, provided that there exists an acyclic directed graph G′G'G′ obtained by assigning directions to the edges of GGG such that the minimum cut of G′G'G′ is at least rrr.
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.
Multicast of unknown quantum states is an unavoidable issue in the construction of quantum networks. Most existing quantum network coding schemes can only restore an unknown state at one of the target nodes during multicast. In this paper, we propose a quantum network coding scheme to multicast unknown quantum states in networks with linear network coding. Concretely, GHZ states are generated between each sender and all receivers. Unknown states are then sent and stored in the entangled state shared by the receivers. Finally, the receivers use asymmetric optimal universal cloning to obtain the required states. The scheme achieved to multicast within 1 quantum transmission and 2 classical transmissions in networks with constrained classical communication. Compared to other schemes, our scheme allows receivers to autonomously adjust the fidelity without the sender knowing the requirements.
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.
Multicasting of quantum states is an essential feature of quantum internet. Since the noncloning theorem prohibits perfect cloning of an unknown quantum state, an appropriate protocol may depend on the purpose of the multicast. In this paper, we treat the multicasting of a single copy of an unknown state over a quantum network with free classical communication. We especially focus on protocols exactly multicasting an asymmetric optimal universal clone. Hence, these protocols are optimal and universal in terms of mean fidelity between input and output states, but the fidelities can depend on target nodes. Among these protocols, a protocol spending smaller communication resources is preferable. Here, we construct such a protocol attaining the min-cut of the network described as follows. Two (three) asymmetric optimal clones of an input state are created at a source node. Then, the state is divided into classical information and a compressed quantum state. The state is sent to two (three) target nodes using the quantum network coding. Finally, the asymmetric clones are reconstructed using LOCC with a small amount of entanglement shared among the target nodes and the classical information sent from the source node.
Since quantum information is continuous, its handling is sometimes surprisingly harder than the classical counterpart.A typical example is cloning; making a copy of digital information is straightforward but it is not possible exactly for quantum information.The question in this paper is whether or not quantum network coding is possible.Its classical counterpart is another good example to show that digital information flow can be done much more efficiently than conventional (say, liquid) flow.Our answer to the question is similar to the case of cloning, namely, it is shown that quantum network coding is possible if approximation is allowed, by using a simple network model called Butterfly.In this network, there are two flow paths, s1s_{1}s1​ to t1t_{1}t1​ and s2s_{2}s2​ to t2t_{2}t2​ , which shares a single bottleneck channel of capacity one.In the classical case, we can send two bits simultaneously, one for each path, in spite of the bottleneck.Our results for quantum network coding include: (i) We can send any quantum state ∣ψ1⟩|\psi_{1}\rangle∣ψ1​⟩ from s1s_{1}s1​ to t1t_{1}t1​ and ∣ψ2⟩|\psi_{2}\rangle∣ψ2​⟩ from s2 to t2t_{2}t2​ simultaneously with a fidelity strictly greater than 1/2.(ii) If one of ∣ψk⟩|\psi_{\mathrm{k}}\rangle∣ψk​⟩ and ∣ψ2⟩|\psi_{2}\rangle∣ψ2​⟩ is classical, then the fidelity can be improved to 2/3.(iii) Similar improvement is also possible if Cbi⟩\mathrm{C}\mathrm{b}_{\mathrm{i}}\rangleCbi​⟩ and 1Cb2⟩1\mathrm{C}\mathrm{b}2\rangle1Cb2⟩ are restricted to only a finite number of (previously known) states.This allows us to design an interesting protocol which can send two classical bits from s1s_{1}s1​ to t1t_{1}t1​ (similarly from s2s_{2}s2​ to t2t_{2}t2​ ) but only one of them should be recovered.