YoVDO

NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes

Offered By: Simons Institute via YouTube

Tags

Quantum Computing Courses Quantum Complexity Theory Courses Quantum LDPC Codes Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Quantum Information Science II: Quantum states, noise and error correction
Massachusetts Institute of Technology via edX
Quantum Information Science II: Efficient Quantum Computing - fault tolerance and complexity
Massachusetts Institute of Technology via edX
Panel on Quantum Machine Learning and Barren Plateaus
Simons Institute via YouTube
Summer Cluster in Quantum Computation - Polylogues
Simons Institute via YouTube
QMA and the Power of Positivity
Simons Institute via YouTube