On Multicast in Quantum Networks

We consider quantum multicast networks in which quantum states generated by multiple sources have to be simultaneously delivered to multiple receivers. We demonstrate that in addition to the apparent similarity to the multicommodity flow problems, quantum networks, to a certain extent, behave as classical communication networks. In particular, we show that lossless compression of special multicast quantum states is possible and significantly reduces the edge capacity requirements of the multicast.

[1]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[2]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[3]  W. Wootters,et al.  A single quantum cannot be cloned , 1982, Nature.

[4]  M. Horodecki,et al.  Universal Quantum Information Compression , 1998, quant-ph/9805017.

[5]  Schumacher,et al.  Noncommuting mixed states cannot be broadcast. , 1995, Physical review letters.

[6]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[7]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[8]  Jozef Gruska,et al.  Quantum Computing , 2008, Wiley Encyclopedia of Computer Science and Engineering.

[9]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[10]  Buzek,et al.  Quantum copying: Beyond the no-cloning theorem. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[11]  David Deutsch,et al.  Stabilization of Quantum Computations by Symmetrization , 1997, SIAM J. Comput..