Strachey Lecture: Quantum Supremacy

Dr Scott Aaronson (MIT, UT Austin) gives the 2016 Strachey lecture. In the near future, it will likely become possible to perform special-purpose quantum computations that, while not immediately useful for anything, are plausibly hard to simulate using a classical computer. These "quantum supremacy experiments" would be a scientific milestone---decisively answering quantum computing skeptics, while casting doubt on one of the foundational tenets of computer science, the Extended Church-Turing Thesis. At the same time, these experiments also raise fascinating questions for computational complexity theorists: for example, on what grounds should we believe that a given quantum system really is hard to simulate classically? Does classical simulation become easier as a quantum system becomes noisier? and how do we verify the results of such an experiment? In this lecture, I'll discuss recent results and open problems about these questions, using three proposed "quantum supremacy experiments" as examples: BosonSampling, IQP / commuting Hamiltonians, and random quantum circuits. Based partly on joint work with Alex Arkhipov and with Lijie Chen. The Strachey Lectures are generously supported by OxFORD Asset Management.

You can listen to Strachey Lecture: Quantum Supremacy online on Radio and Podcast. Open the player on this page to stream the available audio.

Strachey Lecture: Quantum Supremacy is an episode from Computer Science by Oxford University.

This episode is 72:01 long.

This episode was published on Jun 14, 2016.

Yes. Use the heart button on the episode page to add it to your favorite episodes list.

Yes. This page shows related episodes from Computer Science when more episodes are available from the podcast feed.