演讲摘要：Quantum technology is widely recognized for its revolutionary advantages in various fields, such as computation, communication, and metrology. This talk aims to focus on the quantum advantages of the quantum computational model from the perspective of computational complexity. The relationship between complexity theory and quantum advantage is mutually influential. On the one hand, quantum complexity theory explores the impact of quantum mechanics on different computational models, offering valuable insights into the superiority of quantum computing over classical computing. This analysis serves as a powerful tool for formally examining potential quantum advantages. On the other hand, original physical ideas of potential quantum advantages have guided the development of quantum complexity theory over the past decades. Our talk will be divided into three main parts, each addressing the connection from a specific complexity regime: beyond BQP, where quantum proof models are considered; the complexity of standard BQP; and the realm below BQP, where NISQ models and heuristic algorithms are discussed.
讲者简介：Zhengfeng Ji is a Professor at the Department of Computer Science and Technology, Tsinghua University, he obtained his BEng and PhD degrees from the same department in 2002 and 2007, respectively. His research pursuits primarily revolve around quantum algorithm and complexity theory, quantum cryptography, and quantum software.
本期嘉宾
第二届CCF量子计算大会暨中国量子计算产业峰会（CQCC 2023）
京公网安备11010802032778号