How do closed quantum many-body systems driven out of equilibrium eventually achieve
equilibration? And how do these systems thermalize, given that they comprise so many …

We study the problem of simulating the time evolution of a lattice Hamiltonian, where the
qubits are laid out on a lattice and the Hamiltonian only includes geometrically local …

We show how to apply the quantum adiabatic algorithm directly to the quantum computation
of molecular properties. We describe a procedure to map electronic structure Hamiltonians …

Accurate prediction of chemical and material properties from first-principles quantum
chemistry is a challenging task on traditional computers. Recent developments in quantum …

One of the main challenges in the field of quantum simulation and computation is to identify
ways to certify the correct functioning of a device when a classical efficient simulation is not …

A book about turning high-degree optimization problems into quadratic optimization
problems that maintain the same global minimum (ground state). This book explores …

Using a recently introduced framework, we derive criteria for quantum k-separability, which
are very easily computed. In the case k= 2, our criteria are equally strong to the best …

Quantum computing has been a fascinating research field in quantum physics. Recent
progresses motivate us to study in depth the universal quantum computing models …

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 …

The Local Hamiltonian problem is the problem of estimating the least eigenvalue of a local
Hamiltonian, and is complete for the class QMA. The 1D problem on a chain of qubits has …