摘要 Abstract

Interactive proofs are relaxed variants of mathematical proofs studied in theoretical computer science. Exciting notions such as probabilistically checkable proofs and zero-knowledge proofs arose in this proof model. This talk will review the progress and ideas in constructing and analyzing quantum interactive proofs, where the proofs and participants are quantum states and quantum computations, respectively. We will explore questions like the following: What are quantum proofs? What can we prove with interactive quantum proofs? What does Connes' embedding problem have to do with quantum interactive proofs?

报告人介绍 Profile

Zhengfeng Ji is currently a professor in the Department of Computer Science and Technology, Tsinghua University. His research studies quantum computing from a computer science perspective, recently focusing on the quantum algorithm and complexity theory, quantum cryptography, and quantum software.