| Presentation | 2011-05-11 Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols Hirotada KOBAYASHI, GALL Francois LE, Harumichi NISHIMURA, Martin ROTTELER, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The k-pair problem in network coding theory asks to send k messages simultaneously between k source-target pairs over a directed acyclic graph. In a previous paper [ICALP 2009, Part I, pages 622-633] the present authors showed that if a classical k-pair problem is solvable by means of a linear coding scheme, then the quantum k-pair problem over the same graph is also solvable, provided that classical communication can be sent for free between any pair of nodes of the graph. Here we address the main case that remained open in our previous work, namely whether nonlinear classical network coding schemes can also give rise to quantum network coding schemes. This question is motivated by the fact that there are networks for which there are no linear solutions to the k-pair problem, whereas nonlinear solutions exist. In the present paper we overcome the limitation to linear protocols and describe 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. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Network coding / Quantum computing |
| Paper # | COMP2011-15 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2011/5/4(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols |
| Sub Title (in English) | |
| Keyword(1) | Network coding |
| Keyword(2) | Quantum computing |
| 1st Author's Name | Hirotada KOBAYASHI |
| 1st Author's Affiliation | Principles of Informatics Research Division, National Institute of Informatics() |
| 2nd Author's Name | GALL Francois LE |
| 2nd Author's Affiliation | Graduate School of Information Science and Technology, The University of Tokyo |
| 3rd Author's Name | Harumichi NISHIMURA |
| 3rd Author's Affiliation | Graduate School of Science, Osaka Prefecture University |
| 4th Author's Name | Martin ROTTELER |
| 4th Author's Affiliation | NEC Laboratories America |
| Date | 2011-05-11 |
| Paper # | COMP2011-15 |
| Volume (vol) | vol.111 |
| Number (no) | 25 |
| Page | pp.pp.- |
| #Pages | 7 |
| Date of Issue | |