Digital quantum computers provide a computational framework for solving the Schrödinger
equation for a variety of many‐particle systems. Quantum computing algorithms for the …

Adiabatic quantum computing (AQC) started as an approach to solving optimization
problems and has evolved into an important universal alternative to the standard circuit …

The model of adiabatic quantum computation is a relatively recent model of quantum
computation that has attracted attention in the physics and computer science communities …

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 …

Constraint satisfaction problems are a central pillar of modern computational complexity
theory. This survey provides an introduction to the rapidly growing field of Quantum …

In recent years we have seen the birth of a new field known as Hamiltonian complexity lying
at the crossroads between computer science and theoretical physics. Hamiltonian …

We study several problems related to properties of nonnegative matrices that arise at the
boundary between quantum and classical probabilistic computation. Our results are twofold …

An algebraic method has been developed which allows one to engineer several energy
levels including the low-energy subspace of interacting spin systems. By introducing …

In this paper we give an overview of the quantum computational complexity class QMA and
a description of known QMA-complete problems to date. Such problems are believed to be …

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 …