By Topic

Classic and quantum network coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Iwama, K. ; Sch. of Informatics, Kyoto Univ., Japan

Summary form only given. The notion of network coding is often explained by using the butterfly network. In its quantum version, classical channels are replaced by quantum channels with the same capacity. Any unitary operation is allowed at each node. (But note that fan-out is not free in quantum.) From the analogy of the above classical result, the natural attempt is to try sending two quantum bits on the crossing two paths. Unfortunately this seems difficult and it is unlikely to be able to keep a good quality of the transferred quantum bits. However, it turns out that we can keep a reasonably good quality for one qubit in one path and one classical bit in the other and for two special qubits. In the latter case, we can also think of sending four classical bits on the two paths, two for each.

Published in:

Parallel Architectures,Algorithms and Networks, 2005. ISPAN 2005. Proceedings. 8th International Symposium on

Date of Conference:

7-9 Dec. 2005