Network coding for quantum cooperative multicast

Cooperative communication is starting to attract substantial research attention in quantum information theory. However, given a specific network, it is still unknown whether quantum cooperative communication can be successfully performed. In this paper, we investigate network coding for quantum cooperative multicast (QCM) over the classic butterfly network. A very reasonable definition of QCM is first introduced. It not only perfectly focuses on the basic idea of quantum cooperative communication, but also wonderfully reflects the characteristic of classical multicast over a specific network structure. Next, we design QCM protocol for two-level systems and generalize the protocol into d-dimensional Hilbert space. It is shown that our protocols have significant advantages in terms of resource cost and compatibility with classical multicast. Besides, the success probability, which only depends on the coefficients of the initial quantum states, is carefully analyzed. In particular if the source nodes choose the quantum equatorial states, success probability can reach 1.

[1]  M. Murao,et al.  Remote information concentration using a bound entangled state. , 2000, Physical review letters.

[2]  He-Shan Song,et al.  Remote preparation of a qudit using maximally entangled states of qubits , 2006, quant-ph/0603036.

[3]  J. Cirac,et al.  Entanglement percolation in quantum networks , 2006, quant-ph/0612167.

[4]  E. Soljanin,et al.  On Multicast in Quantum Networks , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[5]  Martin Rötteler,et al.  Constructing quantum network coding schemes from classical nonlinear protocols , 2010, 2011 IEEE International Symposium on Information Theory Proceedings.

[6]  Masahito Hayashi,et al.  Quantum Network Coding , 2006, STACS.

[7]  Miguel Castro,et al.  SplitStream: high-bandwidth multicast in cooperative environments , 2003, SOSP '03.

[8]  Christos Gkantsidis,et al.  Network coding for large scale content distribution , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

[10]  Michael A. Nielsen,et al.  Quantum Computation and Quantum Information Theory , 2000 .

[11]  Kazuo Iwama,et al.  Quantum Network Coding for General Graphs , 2006 .

[12]  N. An.  Joint remote state preparation via W and W-type states , 2010 .

[13]  小林 弘忠,et al.  General scheme for perfect quantum network coding with free classical communication (コンピュテーション) , 2009 .

[14]  Chien-Yuan Chen,et al.  Two-to-one quantum teleportation protocol and its application , 2008 .

[15]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[16]  Martin Rötteler,et al.  Perfect quantum network communication protocol based on classical network coding , 2009, 2010 IEEE International Symposium on Information Theory.

[17]  Qiaoyan Wen,et al.  Quantum circuits for controlled teleportation of two-particle entanglement via a W state , 2008 .

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

[19]  Shyamkishor Kumar.  NETWORK CODING THE CASE OF MULTIPLE UNICAST SESSIONS , 2015 .

[20]  Masahito Hayashi,et al.  Prior entanglement between senders enables perfect quantum network coding with modification , 2007, 0706.0197.

[21]  Debbie W. Leung,et al.  Quantum Network Communication—The Butterfly and Beyond , 2010, IEEE Transactions on Information Theory.

[22]  Jin Wang,et al.  A Variable Threshold-Value Authentication Architecture for Wireless Mesh Networks , 2014 .

[23]  Mikio Nakahara,et al.  Economical (k,m) -threshold controlled quantum teleportation , 2009, 0901.2674.

[24]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

[25]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[26]  Yan Xia,et al.  Joint remote preparation of an arbitrary three-qubit state via EPR-type pairs , 2011 .

[27]  Yixian Yang,et al.  Joint Remote Preparation of an Arbitrary Three-Qubit State with Mixed Resources , 2010, International Journal of Theoretical Physics.

[28]  N. An.  Joint remote preparation of a general two-qubit state , 2009 .

[29]  V. Karimipour,et al.  Entanglement swapping of generalized cat states and secret sharing , 2001, quant-ph/0112050.

[30]  Randall Dougherty,et al.  Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks , 2006, IEEE Transactions on Information Theory.

[31]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .

[32]  Xinxin Niu,et al.  Probabilistic quantum network coding of M-qudit states over the butterfly network , 2010 .

[33]  Yuxiang Wang,et al.  Construction of Tree Network with Limited Delivery Latency in Homogeneous Wireless Sensor Networks , 2014, Wirel. Pers. Commun..