Тёмный

Making the Leap to Quantum PCPs 

Simons Institute
Подписаться 62 тыс.
Просмотров 786
50% 1

Chinmay Nirkhe (IBM)
simons.berkeley.edu/talks/chi...
Quantum Summer Cluster Workshop
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.

Опубликовано:

 

22 июл 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии    
Далее
They got a Golden Buzzer 🤣✨
00:46
Просмотров 13 млн
Are LLMs the Beginning or End of NLP?
1:00:56
Просмотров 26 тыс.
An Observation on Generalization
57:21
Просмотров 158 тыс.
Complexity and Gravity - Leonard Susskind
1:27:26
Просмотров 184 тыс.
Mindscape 245 | Solo: The Crisis in Physics
4:22:00
Просмотров 131 тыс.
Why Only Us: Language and Evolution
1:21:19
Просмотров 28 тыс.
They got a Golden Buzzer 🤣✨
00:46
Просмотров 13 млн