During the last ten years, superconducting circuits have passed from being interesting
physical devices to becoming contenders for near-future useful and scalable quantum …

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 …

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

The calculation of ground-state energies of physical systems can be formalized as the k-
local Hamiltonian problem, which is a natural quantum analogue of classical constraint …

We present a decomposition technique that uses non-deterministic circuits to approximate
an arbitrary single-qubit unitary to within distance $\epsilon $ and requires significantly …

Quantum information and computation provide a fascinating twist on the notion of proofs in
computational complexity theory. For instance, one may consider a quantum computational …

We tackle the long-standing question of the computational complexity of determining
homology groups of simplicial complexes, a fundamental task in computational topology …

We consider the complexity of the local Hamiltonian problem in the context of fermionic
Hamiltonians with $\mathcal N= 2$ supersymmetry and show that the problem remains …

Prior work has established that all problems in NP admit classical zero-knowledge proof
systems, and under reasonable hardness assumptions for quantum computations, these …