Events

Events

01
Oct
2020
14:30
A general quantum circuit can be simulated in exponential time on a classical computer. If the circuit has a planar layout, then a tensor-network contraction algorithm due to Markov and Shi has a runtime exponential in the square root of its size, or more generally exponential in the treewidth of the underlying graph.
17
Sep
2020
14:30
In this talk I will offer an overview of my Oxford group’s recent work targetting NISQ (noisy intermediate scale quantum) devices. This is an area of tremendous interest at the moment as we are starting to see quantum devices at, or beyond, the practical limits of simulation power of today’s supercomputers. But of course the ability to build a machine that a conventional computer cannot simulate may be a long way from building something useful!
03
Sep
2020
14:30
Prior work has shown that there exists a relation problem which can be solved with certainty by a constant-depth quantum circuit composed of geometrically local gates in two dimensions, but cannot be solved with high probability by any classical constant depth circuit composed of bounded fan-in gates. Here we provide two extensions of this result.