Quantum Information Complexity and Amortized Communication

We define a new notion of information cost for quantum protocols, and a corresponding notion of quantum information complexity for bipartite quantum channels, and then investigate the properties of such quantities. These are the fully quantum generalizations of the analogous quantities for bipartite classical functions that have found many applications recently, in particular for proving communication complexity lower bounds. Our definition is strongly tied to the quantum state redistribution task. Previous attempts have been made to define such a quantity for quantum protocols, with particular applications in mind; our notion differs from these in many respects. First, it directly provides a lower bound on the quantum communication cost, independent of the number of rounds of the underlying protocol. Secondly, we provide an operational interpretation for quantum information complexity: we show that it is exactly equal to the amortized quantum communication complexity of a bipartite channel on a given state. This generalizes a result of Braverman and Rao to quantum protocols, and even strengthens the classical result in a bounded round scenario. Also, this provides an analogue of the Schumacher source compression theorem for interactive quantum protocols, and answers a question raised by Braverman. We also discuss some potential applications to quantum communication complexity lower bounds by specializing our definition for classical functions and inputs. Building on work of Jain, Radhakrishnan and Sen, we provide new evidence suggesting that the bounded round quantum communication complexity of the disjointness function is \Omega (n/M + M), for M-message protocols. This would match the best known upper bound.

[1]  Jaikumar Radhakrishnan,et al.  A lower bound for the bounded round quantum communication complexity of set disjointness , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[2]  Mark Braverman,et al.  From information to exact communication , 2013, STOC '13.

[3]  A. Winter,et al.  The mother of all protocols: restructuring quantum information’s family tree , 2006, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[4]  Mark M. Wilde,et al.  Quantum Information Theory , 2013 .

[5]  I. Devetak,et al.  Exact cost of redistributing multipartite quantum states. , 2006, Physical review letters.

[6]  Rahul Jain,et al.  A new operational interpretation of relative entropy and trace distance between quantum states , 2014, ArXiv.

[7]  Andris Ambainis,et al.  Quantum Search of Spatial Regions , 2005, Theory Comput..

[8]  F. Brandão,et al.  Faithful Squashed Entanglement , 2010, 1010.1750.

[9]  Iordanis Kerenidis,et al.  Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications , 2012, SIAM J. Comput..

[10]  Andrew Chi-Chih Yao,et al.  Informational complexity and the direct sum problem for simultaneous message complexity , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[11]  Igor Devetak,et al.  Channel Simulation With Quantum Side Information , 2009, IEEE Transactions on Information Theory.

[12]  R. Renner,et al.  The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory , 2009, 0912.3805.

[13]  Mario Berta,et al.  Renyi generalizations of the conditional quantum mutual information , 2014, ArXiv.

[14]  Igor Devetak,et al.  Optimal Quantum Source Coding With Quantum Side Information at the Encoder and Decoder , 2007, IEEE Transactions on Information Theory.

[15]  Rahul Jain,et al.  The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited , 2010, IEEE Transactions on Information Theory.

[16]  Andreas J. Winter,et al.  The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels , 2009, IEEE Transactions on Information Theory.

[17]  Mark Braverman.  Coding for interactive computation: Progress and challenges , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[18]  Mark Braverman,et al.  Tight Bounds for Set Disjointness in the Message Passing Model , 2013, ArXiv.

[19]  Ziv Bar-Yossef,et al.  An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[20]  P. Hayden,et al.  Universal entanglement transformations without communication , 2003 .

[21]  Hartmut Klauck,et al.  Interaction in quantum communication and the complexity of set disjointness , 2001, STOC '01.

[22]  Charles H. Bennett,et al.  Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. , 1992, Physical review letters.

[23]  Andrew Chi-Chih Yao,et al.  Quantum Circuit Complexity , 1993, FOCS.

[24]  Mark Braverman,et al.  An information complexity approach to extended formulations , 2013, STOC '13.

[25]  Andreas J. Winter,et al.  Quantum Reverse Shannon Theorem , 2009, ArXiv.

[26]  Peter W. Shor,et al.  Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem , 2001, IEEE Trans. Inf. Theory.

[27]  Mark Braverman,et al.  Information Equals Amortized Communication , 2011, IEEE Transactions on Information Theory.

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

[29]  Thomas Vidick,et al.  Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability , 2014, ICALP.

[30]  Mark Braverman.  Interactive information complexity , 2012, STOC '12.

[31]  R. Cleve,et al.  SUBSTITUTING QUANTUM ENTANGLEMENT FOR COMMUNICATION , 1997, quant-ph/9704026.

[32]  E. Lieb,et al.  Proof of the strong subadditivity of quantum‐mechanical entropy , 1973 .

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

[34]  André Chailloux,et al.  Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost , 2014, ICALP.

[35]  D. Dieks.  Communication by EPR devices , 1982 .

[36]  Adam D. Smith,et al.  Authentication of quantum messages , 2001, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[37]  Xi Chen,et al.  How to Compress Interactive Communication , 2013, SIAM J. Comput..