1 / 11

Scott Aaronson Associate Professor, EECS

The Limits of Computation. Quantum Computers and Beyond. Scott Aaronson Associate Professor, EECS. Moore’s Law. Extrapolating: Robot uprising?. But even a killer robot would still be “merely” a Turing machine, operating on principles laid down in the 1930s…. =.

trynt
Télécharger la présentation

Scott Aaronson Associate Professor, EECS

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The Limits of Computation Quantum Computers and Beyond Scott Aaronson Associate Professor, EECS

  2. Moore’s Law

  3. Extrapolating: Robot uprising?

  4. But even a killer robot would still be “merely” a Turing machine, operating on principles laid down in the 1930s… =

  5. And it’s conjectured that thousands of interesting problems are inherently intractable for Turing machines… Is there any feasible way to solve these problems, consistent with the laws of physics?

  6. Relativity Computer DONE

  7. Zeno’s Computer STEP 1 STEP 2 Time (seconds) STEP 3 STEP 4 STEP 5

  8. Time Travel Computer S. Aaronson and J. Watrous. Closed Timelike Curves Make Quantum and Classical Computing Equivalent, Proceedings of the Royal Society A 465:631-647, 2009. arXiv:0808.2669.

  9. Quantum Computers What we’ve learned from quantum computers so far: 15 = 3 × 5(with high probability)

  10. My student Alex Arkhipov and I recently proposed an experiment, which involves generating n identical photons, passing them through a network of beamsplitters, then measuring where they end up Our proposal almost certainly wouldn’t yield a universal quantum computer—and indeed, it seems a lot easier to implement Linear-Optical Quantum Computingwww.scottaaronson.com/papers/optics.pdf Nevertheless, we give complexity-theoretic evidence that our experiment would solve some sampling problem that’s classically intractable Groups in Brisbane, Australia and Imperial College London are currently working to implement our experiment

  11. From a theoretical standpoint, modern computers are “all the same slop”: polynomial-time Turing machines • We can imagine computers that vastly exceed those (by using closed timelike curves, etc.) • But going even a tiny bit beyond polynomial-time Turing machines (say, with linear-optical quantum computers) is a great experimental challenge Summary

More Related