Quantum computing and "quantum computational supremacy"
24th November 2017, 3:30 pm – 4:30 pm
Main Maths Building, SM4
Quantum computers are believed to outperform their classical counterparts for certain tasks. The fast pace of recent developments in quantum computing hardware has raised the hope that a quantum computer could soon perform a computational task that is beyond the capability of any classical computer, an event known as quantum (computational) supremacy.
In this talk, I will introduce the mathematical model of quantum computation and describe how it differs from classical computation. I will then discuss a simple class of quantum computations known as IQP ("Instantaneous Quantum Polynomial-time"), which is a candidate for demonstrating quantum supremacy and can be understood mathematically in terms of Fourier analysis over Z_2^n. No prior knowledge of quantum computing will be assumed.
The talk is based on joint work with:
- Michael Bremner and Dan Shepherd (Physical Review Letters 117, 080501, 2016 [arXiv:1504.07999]; Quantum 1, 8, 2017 [arXiv:1610.01808] )
- Aram Harrow (Nature 549, 2017)