首页   系科介绍   师资队伍   科研团队   本科生教学   研究生培养   招聘信息   联系我们

Previous Next
 
首页 >> 学术报告

Some Recent Progress on Quantum Information Complexity

Dr Penghui Yao
2016年12月22日(周四)下午1:00-2:00  闵行校区数学楼129报告厅
 
摘要: 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.


   
 
 
快捷链接 >>
 
系内资源 >>
 
教学园地 >>
 
  校外链接 >>    华师大-纽约大学联合数学研究中心    上海市数学会    中国数学会    美国数学会    欧洲数学会  
         
       Copyright 2012 All rights reserved    Department of Mathematics, East China Normal University    Tel: 86-21-54342609