15415

Classical Algorithms for Quantum Mean Values

APA

(2020). Classical Algorithms for Quantum Mean Values. The Simons Institute for the Theory of Computing. https://simons.berkeley.edu/talks/classical-algorithms-quantum-mean-values

MLA

Classical Algorithms for Quantum Mean Values. The Simons Institute for the Theory of Computing, Feb. 26, 2020, https://simons.berkeley.edu/talks/classical-algorithms-quantum-mean-values

BibTex

          @misc{ scivideos_15415,
            doi = {},
            url = {https://simons.berkeley.edu/talks/classical-algorithms-quantum-mean-values},
            author = {},
            keywords = {},
            language = {en},
            title = {Classical Algorithms for Quantum Mean Values},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2020},
            month = {feb},
            note = {15415 see, \url{https://scivideos.org/index.php/Simons-Institute/15415}}
          }
          
David Gosset (University of Waterloo)
Talk number15415
Source RepositorySimons Institute

Abstract

Consider the task of estimating the expectation value of an n-qubit tensor product observable in the output state of a shallow quantum circuit. This task is a cornerstone of variational quantum algorithms for optimization, machine learning, and the simulation of quantum many-body systems. In this talk I will describe three special cases of this problem which are "easy" for classical computers. This is joint work with Sergey Bravyi and Ramis Movassagh.