Theodore J. Yoder

Learn More
Grover's quantum search and its generalization, quantum amplitude amplification, provide a quadratic advantage over classical algorithms for a diverse set of tasks but are tricky to use without knowing beforehand what fraction λ of the initial state is comprised of the target states. In contrast, fixed-point search algorithms need only a reliable lower(More)
Performing exact inference on Bayesian networks is known to be #P-hard. Typically approximate inference techniques are used instead to sample from the distribution on query variables given the values e of evidence variables. Classically, a single unbiased sample is obtained from a Bayesian network on n variables with at most m parents per node in time O(nmP(More)
Robust calibration of a universal single-qubit gate set via robust phase estimation. Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story(More)
We present a new approach to simulate arbitrary quantum circuits on a classical computer. Our technique generalizes the stabilizer formalism, the underpinnings of the Gottesman-Knill theorem, to include arbitrary states and arbitrary quantum operations. The core of our approach is a novel state representation combining the density matrix and stabilizer(More)
  • 1