У нас вы можете посмотреть бесплатно Scott Aaronson | On the Hardness of Detecting Macroscopic Superpositions или скачать в максимальном доступном качестве, которое было загружено на ютуб. Для скачивания выберите вариант из формы ниже:
Если кнопки скачивания не
загрузились
НАЖМИТЕ ЗДЕСЬ или обновите страницу
Если возникают проблемы со скачиванием, пожалуйста напишите в поддержку по адресу внизу
страницы.
Спасибо за использование сервиса savevideohd.ru
Abstract: When is decoherence "effectively irreversible"? We examine this question of quantum foundations using the tools of quantum computational complexity. We prove that, if one had a quantum circuit to determine if a system was in an equal superposition of two orthogonal states (for example, the |Alive⟩ and |Dead⟩ states of Schrödinger's cat), then with only a slightly larger circuit, one could also swap the two states (e.g., bring a dead cat back to life). In other words, observing interference between the |Alive⟩ and |Dead⟩ states is a "necromancy-hard" problem, technologically infeasible in any world where death is permanent. We also prove several related results, and we show that our results are quantitatively tight. Given the subject of the workshop, I'll also discuss some potential implications for how one should think about the Everett interpretation. See https://arxiv.org/abs/2009.07450. About the speaker: Scott Aaronson is David J. Bruton Jr. Centennial Professor of Computer Science at the University of Texas at Austin. He is well known for his research into quantum computation and computational complexity theory, as well as for his blog, Shtetl-Optimised.