NLTS Hamiltonians from Good Quantum Codes - Understanding Low-Energy States and Circuit Complexity
Centre for Quantum Technologies via YouTube
Finance Certifications Goldman Sachs & Amazon Teams Trust
Live Online Classes in Design, Coding & AI — Small Classes, Free Retakes
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Watch a 42-minute colloquium talk from Harvard University's Anurag Anshu at the Centre for Quantum Technologies exploring the NLTS (No Low-Energy Trivial State) conjecture proposed by Freedman and Hastings in 2014. Delve into groundbreaking research that proves this conjecture by demonstrating how constant-rate and linear-distance Quantum LDPC codes correspond to NLTS local Hamiltonians. Learn about the conjecture's background, its significance in understanding many-body entanglement at high temperatures, and its connections to the quantum PCP conjecture. Gain insights into advanced proof techniques, including tools for proving quantum circuit lower bounds, while examining recent work that establishes fundamental principles in quantum computing and coding theory.
Syllabus
NLTS Hamiltonians from good quantum codes
Taught by
Centre for Quantum Technologies