Making the leap to Quantum PCPs

Chinmay Nirkhe
IBM Watson Research Center

Last year, Anshu, Breuckmann, and I published a proof of the NLTS conjecture based on recent developments in quantum error-correcting codes. That result demonstrates the existence of robust entanglement even at low temperatures. Our motivation for studying NLTS was that it is a necessary precursor for the quantum PCP conjecture.

In this talk, I’ll speak about why our first construction of NLTS is based on codes and what I believe are the appropriate next questions to tackle for the quantum PCP conjecture. I’ll discuss the connections of these questions to other interesting problems in quantum complexity theory.

This talk will be math-light and intuition-heavy with a particular emphasis on identifying key challenges.

Back to Workshop IV: Topology, Quantum Error Correction and Quantum Gravity