Explore a 50-minute conference talk on quantum computing and complexity theory presented by Chinmay Nirkhe from IBM Watson Research Center at IPAM's Topology, Quantum Error Correction and Quantum Gravity Workshop. Delve into the recent proof of the NLTS conjecture and its implications for robust entanglement at low temperatures. Discover the connections between quantum error-correcting codes and the quantum PCP conjecture. Gain insights into key challenges and future directions in quantum complexity theory through an intuition-focused, math-light presentation. Understand the significance of these developments for advancing quantum computing research and applications.
Making the Leap to Quantum PCPs - IPAM at UCLA
Institute for Pure & Applied Mathematics (IPAM) via YouTube
Overview
Syllabus
Chimnay Nirkhe - Making the leap to Quantum PCPs - IPAM at UCLA
Taught by
Institute for Pure & Applied Mathematics (IPAM)
Related Courses
-
Fast Erasure Decoder for a Class of Quantum LDPC Codes - IPAM at UCLA
-
NLTS Hamiltonians from Good Quantum Codes - Understanding Low-Energy States and Circuit Complexity
-
Introduction to Quantum Computing: Quantum Algorithms and Qiskit
-
Quantum Error Correcting for Gravity in the Large-N Limit - IPAM at UCLA
-
Quantum Computation From Dynamic Automorphism Codes - IPAM at UCLA
-
The Development of Quantum Error Correction - Green Family Lecture at IPAM at UCLA
