filmov
tv
Scott Aaronson | On the Hardness of Detecting Macroscopic Superpositions
Показать описание
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.
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.
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.
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.
The truth about quantum computing | Scott Aaronson
OpenAI expert Scott Aaronson on consciousness, quantum physics and AI safety | FULL INTERVIEW
Scott Aaronson - AGI That Evolves Our Values Without Replacing Them (Worthy Successor, Episode 4)
Scott Aaronson - What Things Are Conscious?
The Problem with Human Specialness in the Age of AI | Scott Aaronson | TEDxPaloAlto
Theory of Everything | Scott Aaronson and Lex Fridman
Scott Aaronson - Is the Cosmos a Computer?
What Quantum Computing Isn't | Scott Aaronson | TEDxDresden
Scott Aaronson's voiceover roasting Michio Kaku on his claim on Quantum Computing
Scott Aaronson on Computational Complexity Theory and Quantum Computers
Scott Aaronson, 'Remarks on the Physical Church-Turing Thesis' FQXi conference 2014 in Vie...
Scott Aaronson - Why There is ‘Something’ Rather than ‘Nothing’?
Universality of Computation is Beautiful | Scott Aaronson and Lex Fridman
Scott Aaronson: The Greatest Unsolved Problem in Math
Straight Talk on Quantum Computing
Can we prove P=NP and not find the algorithm? | Scott Aaronson and Lex Fridman
The odds that P=NP is 3% | Scott Aaronson and Lex Fridman
Cancel Culture is Ridiculous | Scott Aaronson and Lex Fridman
Scott Aaronson - Is Reality Discrete or Continuous?
Scott Aaronson - What Does Quantum Theory Mean?
TEDxCaltech - Scott Aaronson - Physics in the 21st Century: Toiling in Feynman's Shadow
The consciousness ghost in the quantum machine | Scott Aaronson and Lex Fridman
Scott Aaronson: Computational Complexity and Consciousness | Lex Fridman Podcast #130
Refuting Eric Weinstein's and Stephen Wolfram's Theories of Everything | Scott Aaronson &a...
Комментарии