University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Lecture 2: Introduction to Quantum Complexity (tutorial)

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Lecture 2: Introduction to Quantum Complexity (tutorial)

Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani .

Mathematical Challenges in Quantum Information

Coauthors: 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).

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

puré mathematics Synthetic Differential Geometry Seminar in person & via zoom

Other talks

Topology of the Ritz energy landscape Evolution: Inevitable or Remarkable? Talk TBC Title to be confirmed Afternoon Break TBC
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity