PIRSA:20050022

Video URL

https://pirsa.org/20050022

Cayley path and quantum supremacy: Average case #P-Hardness of random circuit sampling

Movassagh, R. (2020). Cayley path and quantum supremacy: Average case #P-Hardness of random circuit sampling. Perimeter Institute for Theoretical Physics. https://pirsa.org/20050022

Movassagh, Ramis. Cayley path and quantum supremacy: Average case #P-Hardness of random circuit sampling. Perimeter Institute for Theoretical Physics, May. 20, 2020, https://pirsa.org/20050022 

          @misc{ scivideos_PIRSA:20050022,
            doi = {10.48660/20050022},
            url = {https://pirsa.org/20050022},
            author = {Movassagh, Ramis},
            keywords = {Other Physics},
            language = {en},
            title = {Cayley path and quantum supremacy: Average case $\#$P-Hardness of random circuit sampling},
            publisher = {Perimeter Institute for Theoretical Physics},
            year = {2020},
            month = {may},
            note = {PIRSA:20050022 see, \url{https://scivideos.org/pirsa/20050022}}
          }

Ramis Movassagh MIT-IBM Watson AI Lab

Talk numberPIRSA:20050022
DOI10.48660/20050022
Source RepositoryPIRSA
Collection
Talk Type Scientific Series
Subject

Abstract

Given the large push by academia and industry (e.g., IBM and Google), quantum computers with hundred(s) of qubits are at the brink of existence with the promise of outperforming any classical computer. Demonstration of computational advantages of noisy near-term quantum computers over classical computers is an imperative near-term goal. The foremost candidate task for showing this is Random Circuit Sampling (RCS), which is the task of sampling from the output distribution of a random circuit. This is exactly the task that recently Google experimentally performed on 53-qubits.

Stockmeyer's theorem implies that efficient sampling allows for estimation of probability amplitudes. Therefore, hardness of probability estimation implies hardness of sampling. We prove that estimating probabilities to within small errors is #P-hard on average (i.e. for random circuits), and put the results in the context of previous works.

Some ingredients that are developed to make this proof possible are construction of the Cayley path as a rational function valued unitary path that interpolate between two arbitrary unitaries, an extension of Berlekamp-Welch algorithm that efficiently and exactly interpolates rational functions, and construction of probability distributions over unitaries that are arbitrarily close to the Haar measure.