BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Lecture 2: Introduction to Quantum Complexity (tutorial) - Nagaj\,
  D (Universitt Wien)
DTSTART:20130906T103000Z
DTEND:20130906T113000Z
UID:TALK46982@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:Coauthors: David Gosset\, Sandeep Narayanaswami and Sean Hallg
 ren\n\nIn this and tomorrow's lecture\, we will look at why frustrated (lo
 cal Hamiltonian) and unfrustrated (quantum SAT) problems can be very hard 
 to solve\, even for the computers we don't have yet. The keywords are: uni
 versal computation\, ground states\, locality\, qudits\, promise gaps\, ei
 genvalue gaps\, history states\, clocks\, and translational invariance.\n\
 nThe goal is to build the basics so that we can focus on recent ideas abou
 t the Quantum 3-SAT problem\, random Quantum SAT (its SAT/UNSAT transition
 )\, perfect verifiers (QMA_1 vs QMA)\, quantum walks (the difficulty of so
 lving scattering)\, blind quantum computation (limited power of QMA verifi
 ers) and QMA vs. QCMA (MQA).\n\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR