量子信道的Chernoff | |||||

Chernoff Bound for Quantum Operations is Faithful | |||||

俞能昆 Nengkun Yu | |||||

Nengkun Yu is currently a senior lecturer of University of Technology Sydney. He received the B.S. and Ph.D. degrees in Computer Science from the Department of Computer Science and Technology, Tsinghua University, Beijing, China, in July of 2008 and 2013, respectively. His research interests include quantum computation, quantum communication, and quantum programming language. | |||||

We consider the problem of testing two quantum hypotheses of quantum operations in the setting of many uses where an arbitrary prior distribution is given. The concept of the Chernoff bound for quantum operations is investigated to track the minimal average probability of error of discriminating two quantum operations asymptotically. We show that the Chernoff bound is faithful in the sense that it is finite if and only if the two quantum operations can not be distinguished perfectly. More precisely, upper bounds of the Chernoff bound for quantum operations are provided. We then generalize these results to multiple Chernoff bound for quantum operations. | |||||

报告时间：2018年11月23日10时00分 | 报告地点：西区科技西楼 18楼 1810 | ||||

报名截止日期：2018年11月23日 | 可选人数：50 |