License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.06111.14
URN: urn:nbn:de:0030-drops-6080
Go to the corresponding Portal

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

Quantum Network Coding

06111.IwamaKazuo.Paper.608.pdf (0.4 MB)


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
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

  author =	{Hayashi, Masahito and Iwama, Kazuo and Nishimura, Harumichi and Raymond, Rudy and Yamashita, Shigeru},
  title =	{{Quantum Network Coding}},
  booktitle =	{Complexity of Boolean Functions},
  pages =	{1--17},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6111},
  editor =	{Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-6080},
  doi =		{10.4230/DagSemProc.06111.14},
  annote =	{Keywords: Network coding, quantum computation, quantum information}

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

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI