License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-6080
URL: http://drops.dagstuhl.de/opus/volltexte/2006/608/

Hayashi, Masahito ; Iwama, Kazuo ; Nishimura, Harumichi ; Raymond, Rudy ; Yamashita, Shigeru

Quantum Network Coding

pdf-format:
Dokument 1.pdf (388 KB)


Abstract

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 {em 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 angle$ from $s_1$ to $t_1$ and $|psi_2 angle$ from $s_2$ to $t_2$ simultaneously with a fidelity strictly greater than $1/2$. (ii) If one of $|psi_1 angle$ and $|psi_2 angle$ is classical, then the fidelity can be improved to $2/3$. (iii) Similar improvement is also possible if $|psi_1 angle$ and $|psi_2 angle$ are restricted to only a finite number of (previously known) states. (iv) Several impossibility results including the general upper bound of the fidelity are also given.

BibTeX - Entry

@InProceedings{hayashi_et_al:DSP:2006:608,
  author =	{Masahito Hayashi and Kazuo Iwama and Harumichi Nishimura and Rudy Raymond and Shigeru Yamashita},
  title =	{Quantum Network Coding},
  booktitle =	{Complexity of Boolean Functions},
  year =	{2006},
  editor =	{Matthias Krause and Pavel Pudl{\'a}k and R{\"u}diger Reischuk and Dieter van Melkebeek},
  number =	{06111},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/608},
  annote =	{Keywords: Network coding, quantum computation, quantum information}
}

Keywords: Network coding, quantum computation, quantum information
Seminar: 06111 - Complexity of Boolean Functions
Issue date: 2006
Date of publication: 09.10.2006


DROPS-Home | Fulltext Search | Imprint Published by LZI