报告人：Zhengfeng Ji (University of Technology Sydney)
地点：Room 1570, Sciences Building No. 1
Abstract: In this talk, we will go through several interesting recent developments in the theory of
quantum proofs, an area that has rich connections to computer science, physics, and mathematics.
We will start with classical proof verification models, and try to cover both the Hamiltonian
complexity theory and the theory of multi-player entangled games in the talk. These studies are
motivated by the classical concept of efficient proof verification in computer science and have
interesting connections to physics such as condensed matter physics and the theory of Bell
inequalities. Time permitted, we will also briefly introduce why approximate group representations
and other interesting mathematics arise naturally in the study of entangled games.
Bio: Dr. Zhengfeng Ji is currently a Professor and the Acting Director of the Centre for Quantum
Software and Information, Faculty of Engineering and Information Technology, University of
Technology Sydney. His current research interests include quantum algorithms, quantum complexity
theory, quantum cryptography, and quantum programming language theory.