报告题目：Some Recent Progress on Quantum Information Complexity
主讲：姚鹏晖，副教授，南京大学
日期：2019年 4月 29 日（星期一）
时间：10：30—11：30
地点：大学城jbo竞博电竞官方网站数据科学与jbo竞博电竞官方网站 A201
主持：李绿周 教授
摘要:
In the past two decades, information complexity received great attention due to its series of successful applications in theoretical computer science, which as well has vastly enriched traditional information theory. A notable example is communication complexity, a core model in theoretical computer science, where a series of successful applications have been discovered thanks to information complexity. In this model, quantum mechanics has presented unconditionally quantitative or even exponential advantages. In this talk, I will survey some of recent results on classical and quantum information complexity and their applications in communication complexity. I will also present some of the major challenges in this field. If time permitted, I will also talk some results about efficient codes for noisy interactive communication.
报告人简介:
姚鹏晖，南京大学计算机科学与技术系副教授；本科毕业于华东师范大学数学系，博士毕业于新加坡国立大学量子技术中心（CQT），之后先后在荷兰国家数学与计算机中心（CWI）、加拿大滑铁卢大学量子计算研究所（IQC）、美国马里兰大学量子信息与计算机科学联合中心（QuICS）从事博士后研究工作。
主要研究方向是计算复杂性、量子算法与量子信息论。目前，在算法和通信复杂性上做出一系列重要成果。在理论计算机科学顶级会议STOC、FOCS和信息论顶级期刊IEEE Transaction on Information Theory上发表多篇论文。