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

  title={Asymmetric Quantum Multicast Network Coding: Asymmetric Optimal Cloning over Quantum Networks},
  author={Yuichi Hirota and Masaki Owari},
  journal={Applied Sciences},
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… 
1 Citations

Figures from this paper

Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network With Free One-Way Public Communication
A canonical method to derive a secure quantum network code over a multiple unicast quantum network from a secure classical network code that correctly transmits quantum states when there is no attack and guarantees the secrecy of the transmitted quantum state even with the existence of an attack.


Network coding for quantum cooperative multicast
This paper investigates network coding for quantum cooperative multicast (QCM) over the classic butterfly network and designs QCM protocol for two-level systems and generalizes the protocol into d-dimensional Hilbert space, finding significant advantages in terms of resource cost and compatibility with classical multicast.
Quantum Router with Network Coding
This work describes how a scheme to distribute general two-colorable graph states via quantum routers with network coding can be constructed from classical linear network codes and shows that for any stabilizer error correction code there exists a corresponding quantum network code with similar error correcting capabilities.
Quantum Network Code for Multiple-Unicast Network with Quantum Invertible Linear Operations
This paper concretely construct a quantum network code for the quantum multiple-unicast network as a generalization of the code [Song and Hayashi, arxiv:1801.03306, 2018], and transmits a quantum state for each sender-receiver pair by n-use of the network asymptotically, which guarantees no information leakage to the other users.
Experimental quantum network coding
The first experimental realization of quantum network coding on the butterfly network is reported, with the help of prior entanglements shared between senders, so that two quantum states can be transmitted perfectly through the Butterfly network.
Quantum Network Coding
It is shown that quantum network coding is possible if approximation is allowed, by using a simple network model called Butterfly, and several impossibility results including the general upper bound of the fidelity are given.
Perfect quantum network communication protocol based on classical network coding
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.
General Scheme for Perfect Quantum Network Coding with Free Classical Communication
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.
Quantum network coding for multi-unicast problem based on 2D and 3D cluster states
A new approach based on stabilizer formalism to analyze the solvability of several underlying quantum multi-unicast networks is presented and it is found that thesolvability closely depends on the choice of stabilizer generators for a given cluster state.
Perfect quantum multiple-unicast network coding protocol
This paper applies quantum repeaters to multiple-unicast communication problem, and gives encoding–decoding schemes for source nodes, internal ones and target ones, respectively that can reduce resource consumption and realize long-distance transmission of quantum information.
End-to-end capacities of a quantum communication network
This work derives single-letter upper bounds for the end-to-end capacities achievable by the most general (adaptive) protocols of quantum and private communication, from a single repeater chain to an arbitrarily complex quantum network, where systems may be routed through single or multiple paths.