Sergey Bravyi is a research staff member at IBM's Watson Research Center. His research interests include algorithms for simulation of many-body quantum systems, quantum complexity theory, and quantum error correction. His recent research focuses on classical algorithms for simulation of quantum circuits. https://simons.berkeley.edu/people/sergey-bravyi
"Quantum advantage with shallow circuits" Bravyi, Gosset and Konig 2017
Our problem is more closely related to the Bernstein Vazirani problem [17] or, more generally, the Fourier Fishing problem introduced by Aaronson [25, 29]. Fourier Fishing is a search problem where the goal is to identify a bit sting z such that the Fourier transform of a given Boolean function has non-negligible weight on z. We shall see that a string z is a solution of the 2D Hidden Linear Function problem for a quadratic form q iff the Fourier transform of q has a non-zero weight on z, see Lemma 2 in Section 3. https://arxiv.org/abs/1704.00690
"Quantum advantage with shallow circuits" Bravyi, Gosset and Konig 2017
cited: https://scholar.google.com/scholar?um=1&ie=UTF-8&lr&cites=14269798886549310332
PAPERS of Sergey Bravyi
https://arxiv.org/search/quant-ph?searchtype=author&query=Bravyi%2C+S