Quantum Computing Colloquium: Ryan O'Donnell (CMU)
50 views
Skip to first unread message
Tom Gur
Aug 16, 2022, 3:26:16 PM8/16/22
to Cambridge-Warwick Quantum Colloquium
Hi everyone,
The second colloquium in this series will be given by Ryan O'Donnell (CMU), who will talk about Quantum Monte Carlo Methods. See details and calendar entry below.
The talk will take place this Friday, 19 August, at 2pm BST.
The second colloquium in this series will be given by Ryan O'Donnell (CMU), who will talk about Quantum Monte Carlo Methods. See details and calendar entry below.
The talk will take place this Friday, 19 August, at 2pm BST.
Zoom link: https://us02web.zoom.us/j/84117514646?pwd=ckNhYkRqNGlMcmQ0MlREdFdVNUFNdz09
Best,
Tom and Sergii
*********
Best,
Tom and Sergii
*********
Ryan O'Donnell (CMU)
Title: Mean Estimation When You Have The Source Code; or, Quantum Monte Carlo Methods
Abstract: Suppose y is a real random variable, and one is given access to "the code" that generates it (for example, a randomized or quantum circuit whose output is y). We give a quantum procedure that runs the code O(n) times and returns an estimate for E[y] with optimal dependence on n for quantum algorithms. The central subroutine for our result is essentially Grover's algorithm but with complex phases.
Title: Mean Estimation When You Have The Source Code; or, Quantum Monte Carlo Methods
Abstract: Suppose y is a real random variable, and one is given access to "the code" that generates it (for example, a randomized or quantum circuit whose output is y). We give a quantum procedure that runs the code O(n) times and returns an estimate for E[y] with optimal dependence on n for quantum algorithms. The central subroutine for our result is essentially Grover's algorithm but with complex phases.
Joint work with Robin Kothari (Microsoft).
Reply all
Reply to author
Forward
0 new messages