摘要： Quantum information complexity (QIC) is one of the most powerful methods to study the lower bound on quantum communication complexity (QCC). Compressing a protocol with low QIC is a central task in communication complexity.

In this talk, I will survey three recent results towards this direction: (1). There is no quantum analog of Huffman coding. (2). A quantum analog of Braverman-Rao protocol, which meanwhile gives an operational interpretation of quantum relative entropy. (3). There exists a boolean function whose QCC is exponentially larger than QIC.

报告人简介： Penghui Yao is a Postdoctoral Fellow in joint center for quantum information and computer science of university of Maryland. His research is in quantum communication complexity and information complexity. In his research, he investigates quantum communication complexity using tools such as linear and semidefinite programs, matrix analysis and information theory.