Video URL

https://simons.berkeley.edu/talks/tbd-152

On Entropy from Random Circuit Sampling

(2020). On Entropy from Random Circuit Sampling. The Simons Institute for the Theory of Computing. https://simons.berkeley.edu/talks/tbd-152

On Entropy from Random Circuit Sampling. The Simons Institute for the Theory of Computing, May. 04, 2020, https://simons.berkeley.edu/talks/tbd-152 

          @misc{ scivideos_15679,
            doi = {},
            url = {https://simons.berkeley.edu/talks/tbd-152},
            author = {},
            keywords = {},
            language = {en},
            title = {On Entropy from Random Circuit Sampling},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2020},
            month = {may},
            note = {15679 see, \url{https://scivideos.org/Simons-Institute/15679}}
          }
Scott Aaronson (University of Texas at Austin)
Source Repository Simons Institute
Subject

Abstract

Two years ago, I proposed that near-term, sampling-based quantum supremacy experiments, such as Google's, could be repurposed to generate bits that are certifiably random under computational assumptions.  In this talk, I'll discuss an aspect of that proposal that I haven't had time to go into in earlier talks: namely, how does one actually derive the conclusion that fresh entropy is being generated, from relatively "standard" computational assumptions?  I'll also discuss the major challenges that remain in turning this proposal into a genuine near-term application of quantum computers.