- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from

**public sources and our publisher partners.**Given a verifier circuit for a problem in QMA, we show how to exponentially amplifythe gap between its acceptance probabilities in the 'yes' and 'no' cases, with a methodthat is quadratically faster… Expand

We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of ten-dimensional qudits that makes it possible to realize universal quantum computing without any external… Expand

This paper proves that classical-witness quantum Merlin-Arthur proof systems can achieve perfect completeness. That is, QCMA = QCMA1. This holds under any gate set with which the Hadamard and… Expand

Frustration-free (FF) spin chains have a property that their ground state minimizes all individual terms in the chain Hamiltonian. We ask how entangled the ground state of a FF quantum spin-s chain… Expand

We study the glued-trees problem from A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. Spielman, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (ACM, San Diego,… Expand

We achieve a quantum speed-up of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the Monte-Carlo Markov Chain method… Expand

We present a new way of encoding a quantum computation into a three-local Hamiltonian. Our construction is novel in that it does not include any terms that induce legal-illegal clock transitions.… Expand

We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10dimensional qudits that makes it possible to realize universal quantum computing without any external… Expand

Quantum satisfiability is a constraint satisfaction problem that generalizes classical boolean satisfiability. In the quantum $k$-SAT problem, each constraint is specified by a $k$-local projector… Expand

We give a generalization to an infinite tree geometry of Vidal's infinite time-evolving block decimation (iTEBD) algorithm [G. Vidal, Phys. Rev. Lett. 98, 070201 (2007)] for simulating an infinite… Expand