• Corpus ID: 199405535

Asymmetric quantum multicast network coding: asymmetric optimal cloning over quantum networks

@article{Hirota2019AsymmetricQM,
  title={Asymmetric quantum multicast network coding: asymmetric optimal cloning over quantum networks},
  author={Yuichi Hirota and Masaki Owari},
  journal={arXiv: Quantum Physics},
  year={2019}
}
In this study, we consider a quantum version of multicast network coding as a multicast protocol for sending universal quantum clones (UQCs) from a source node to the target nodes on a quantum network. By extending Owari et al.'s previous results for symmetric UQCs, we derive a protocol for multicasting $1\rightarrow 2$ ($1\rightarrow 3$) {\it asymmetric} UQCs of a $q^r$-dimensional state to two (three) target nodes.Our protocol works under the condition that each edge on a quantum network… 
1 Citations

Figures from this paper

Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network With Free One-Way Public Communication
TLDR
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.

References

SHOWING 1-10 OF 29 REFERENCES
Quantum Router with Network Coding
TLDR
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.
Robust entanglement distribution via quantum network coding
TLDR
This work describes how a scheme to distribute general two-colourable 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.
Constructing quantum network coding schemes from classical nonlinear protocols
TLDR
This paper overcome the limitation to linear protocols and describes a new communication protocol for perfect quantum network coding that improves over the previous one as follows: (i) the new protocol does not put any condition on the underlying classical coding scheme, that is, it can simulate nonlinear communication protocols as well, and (ii) the amount of classical communication sent in the protocol is significantly reduced.
General Scheme for Perfect Quantum Network Coding with Free Classical Communication
TLDR
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 Code for Multiple-Unicast Network with Quantum Invertible Linear Operations
TLDR
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.
Analysis of measurement-based quantum network coding over repeater networks under noisy conditions
Quantum network coding is an effective solution for alleviating bottlenecks in quantum networks. We introduce a measurement-based quantum network coding scheme for quantum repeater networks (MQNC),
Secure Quantum Network Code without Classical Communication
TLDR
The secure quantum communication over a network with the presence of the malicious adversary who can eavesdrop and contaminate the states is considered, which can be thought of as a generalization of honest- dealer verifiable quantum secret sharing.
Perfect quantum network communication protocol based on classical network coding
TLDR
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.
Quantum Network Communication—The Butterfly and Beyond
TLDR
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.
Analysis of quantum network coding for realistic repeater networks
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
...
1
2
3
...