Quantum Metropolis sampling.

The original motivation to build a quantum computer came from Feynman, who imagined a machine capable of simulating generic quantum mechanical systems--a task that is believed to be intractable for classical computers. Such a machine could have far-reaching applications in the simulation of many-body quantum physics in condensed-matter, chemical and high-energy systems. Part of Feynman's challenge was met by Lloyd, who showed how to approximately decompose the time evolution operator of interacting quantum particles into a short sequence of elementary gates, suitable for operation on a quantum computer. However, this left open the problem of how to simulate the equilibrium and static properties of quantum systems. This requires the preparation of ground and Gibbs states on a quantum computer. For classical systems, this problem is solved by the ubiquitous Metropolis algorithm, a method that has basically acquired a monopoly on the simulation of interacting particles. Here we demonstrate how to implement a quantum version of the Metropolis algorithm. This algorithm permits sampling directly from the eigenstates of the Hamiltonian, and thus evades the sign problem present in classical simulations. A small-scale implementation of this algorithm should be achievable with today's technology.

Solving frustration-free spin systems.

We identify a large class of quantum many-body systems that can be solved exactly: natural frustration-free spin-1/2 nearest-neighbor Hamiltonians on arbitrary lattices. We show that the entire ground-state manifold of such models can be found exactly by a tensor network of isometries acting on a space locally isomorphic to the symmetric subspace. Thus, for this wide class of models, real-space renormalization can be made exact. Our findings also imply that every such frustration-free spin model satisfies an area law for the entanglement entropy of the ground state, establishing a novel large class of models for which an area law is known. Finally, we show that our approach gives rise to an ansatz class useful for the simulation of almost frustration-free models in a simple fashion, outperforming mean-field theory.

Unifying variational methods for simulating quantum many-body systems.

We introduce a unified formulation of variational methods for simulating ground state properties of quantum many-body systems. The key feature is a novel variational method over quantum circuits via infinitesimal unitary transformations, inspired by flow equation methods. Variational classes are represented as efficiently contractible unitary networks, including the matrix-product states of density matrix renormalization, multiscale entanglement renormalization (MERA) states, weighted graph states, and quantum cellular automata. In particular, this provides a tool for varying over classes of states, such as MERA, for which so far no efficient way of variation has been known. The scheme is flexible when it comes to hybridizing methods or formulating new ones. We demonstrate the functioning by numerical implementations of MERA, matrix-product states, and a new variational set on benchmarks.

Exact relaxation in a class of nonequilibrium quantum lattice systems.

A reasonable physical intuition in the study of interacting quantum systems says that, independent of the initial state, the system will tend to equilibrate. In this work we introduce an experimentally accessible setting where relaxation to a steady state is exact, namely, for the Bose-Hubbard model quenched from a Mott quantum phase to the free strong superfluid regime. We rigorously prove that the evolving state locally relaxes to a steady state with maximum entropy constrained by second moments--thus maximizing the entanglement. Remarkably, for this to be true, no time average is necessary. Our argument includes a central limit theorem and exploits the finite speed of information transfer. We also show that for all periodic initial configurations (charge density waves) the system relaxes locally, and identify experimentally accessible signatures in optical lattices as well as implications for the foundations of statistical mechanics.