Students will be responsible for completing 3 problem sets, scribing lecture notes, and writing a final project report. This is a theory-based course that assumes familiarity with quantum information, and familiarity with algorithms/complexity theory is strongly recommended. Hamiltonian complexity theory: QMA completeness, local Hamiltonians, QMA(2), Quantum PCP Conjecture, area laws, and algorithms for solving local Hamiltonians.
E SCRIBE THEMES VERIFICATION
This course will cover advanced and cutting edge topics in quantum information theory, organized into the following two themes:Ĭlassical verification of quantum systems: nonlocal games, self-testing, verifiable delegation of quantum computation, the use of lattice cryptography, and MIP* = RE and its connection to the Connes’ Embedding Conjecture.
There have been very exciting developments recently, including the connection between the complexity of quantum multiprover interactive proofs and questions in functional analysis and operator algebras new cryptographic primitives such as quantum money/quantum copy-protection quantum homomorphic encryption and the use of lattice cryptography the quantum PCP Conjecture and its connections with condensed matter physics. The goal of the course is to take a deep dive into some of the most exciting topics at the frontier of quantum complexity theory and quantum cryptography.
0 kommentar(er)
