【学术报告】Chernoff Bound for Quantum Operations is Faithful
发表时间:2018-11-21作者:浏览: 259

报告人:俞能昆,University of Technology Syndney

报告题目:Chernoff Bound for Quantum Operations is Faithful

报告时间:2018112310:00-11:30

报告地点:西区,科技西楼,1810会议室

报告内容: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.


报告人简介: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.


欢迎感兴趣师生参加!