Quantum Computing and the Limits of the Efficiently Computable
From International Center for Computational Logic
Quantum Computing and the Limits of the Efficiently Computable
Talk by Scott Aaronson
- Location: APB E023
- Start: 28. August 2017 at 2:00 pm
- End: 28. August 2017 at 3:00 pm
- Research group: Knowledge-Based Systems
- iCal
I'll offer a crash course on quantum computing, which seeks to exploit the strange rules of quantum physics to solve certain problems dramatically faster than we know how to solve them with any existing computer. I promise no hype: just a a sober summary of how a quantum computer would actually work (hint: it's not just by "trying every possible answer in parallel"), for which problems quantum computers are and aren't expected to provide an advantage, and the current status of the effort to make quantum computing practical. I'll also say something about the ultimate physical limits of computation, and about speculative proposals for going beyond even quantum computers.
Bio