Lecture 2: Introduction to Quantum Complexity (tutorial)
Seminar Room 1, Newton Institute
AbstractCoauthors: David Gosset, Sandeep Narayanaswami and Sean Hallgren
In this and tomorrow's lecture, we will look at why frustrated (local Hamiltonian) and unfrustrated (quantum SAT) problems can be very hard to solve, even for the computers we don't have yet. The keywords are: universal computation, ground states, locality, qudits, promise gaps, eigenvalue gaps, history states, clocks, and translational invariance.
The goal is to build the basics so that we can focus on recent ideas about the Quantum 3-SAT problem, random Quantum SAT (its SAT/UNSAT transition), perfect verifiers (QMA_1 vs QMA), quantum walks (the difficulty of solving scattering), blind quantum computation (limited power of QMA verifiers) and QMA vs. QCMA (MQA).
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.