NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore a 44-minute lecture on recent advancements in quantum complexity theory, focusing on NLTS Hamiltonians and Sum-of-Squares (SoS) lower bounds derived from low-rate quantum LDPC codes. Delve into Louis Golowich's presentation at the Simons Institute, where he discusses improvements to previous results in the field. Learn how quantum LDPC codes with arbitrarily small positive dimension can yield NLTS Hamiltonians, surpassing earlier findings. Discover a novel method for planting strongly explicit nontrivial codewords in linear-distance quantum LDPC codes, leading to strongly explicit SoS lower bounds. Gain insights into the potential applications of these "planted" quantum LDPC codes, which offer increased flexibility in code construction without relying on parity check counting.
Syllabus
NLTS Hamiltonians (and Strongly-Explicit SoS Lower Bounds) from Low-Rate Quantum LDPC Codes
Taught by
Simons Institute
Related Courses
Intro to Computer ScienceUniversity of Virginia via Udacity Quantum Mechanics for IT/NT/BT
Korea University via Open Education by Blackboard Emergent Phenomena in Science and Everyday Life
University of California, Irvine via Coursera Quantum Information and Computing
Indian Institute of Technology Bombay via Swayam Quantum Computing
Indian Institute of Technology Kanpur via Swayam