Key static and dynamic properties of matter—from creation in the Big Bang to evolution into
subatomic and astrophysical environments—arise from the underlying fundamental …

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

In some of the earliest work on quantum computing, Feynman showed how to implement
universal quantum computation with a time-independent Hamiltonian. I show that this …

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 …

The k-\locHam problem is a natural complete problem for the complexity class \QMA, the
quantum analogue of \NP. It is similar in spirit to\sc MAX-k-SAT, which is \NP-complete for …

Quantum field theory provides the framework for the most fundamental physical theories to
be confirmed experimentally and has enabled predictions of unprecedented precision …

Quantum signal processing (QSP) is a powerful toolbox for the design of quantum
algorithms and can lead to asymptotically optimal computational costs. Its realization on …

This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which
Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum …

Conventional methods of quantum simulation involve trade-offs that limit their applicability to
specific contexts where their use is optimal. In particular, the interaction picture simulation …

The problem 2-LOCAL HAMILTONIAN has been shown to be complete for the quantum
computational class QMA, see quant-ph/0406180. In this paper we show that this important …