Monday, January 21, 2019 2:30 pm
-
2:30 pm
EST (GMT -05:00)
Alexander Belovs, University of Latvia
This talk reflects on recent research in progress with Andras Gilyen. Over the years, there have been a number of papers dealing with quantum algorithms testing some properties of classical probability distributions. Our goal is to understand what is the right way for quantum algorithms to access the distribution. There is a number of possible models, and we analyse their mutual strength.