We study multiprover interactive proof systems. The power of classical multiprover
interactive proof systems, in which the provers do not share entanglement, was …

Research on quantum technology spans multiple disciplines: physics, computer science,
engineering, and mathematics. The objective of this chapter is to provide an accessible …

It is known that three fundamental questions regarding local Hamiltonians--approximating
the ground state energy (the Local Hamiltonian problem), simulating local measurements on …

Recent work has characterized rigorously what it means for one quantum system to simulate
another and demonstrated the existence of universal Hamiltonians—simple spin lattice …

A foundational result in the theory of quantum computation, known as the" principle of safe
storage," shows that it is always possible to take a quantum circuit and produce an …

Driven by exploring the power of quantum computation with a limited number of qubits, we
present a novel complete characterization for space-bounded quantum computation, which …

An important task in quantum physics is the estimation of local quantities for ground states of
local Hamiltonians. Recently,[Ambainis, CCC 2014] defined the complexity class …

Complexity theory typically focuses on the difficulty of solving computational problems using
classical inputs and outputs, even with a quantum computer. In the quantum world, it is …

We introduce two models of space-bounded quantum interactive proof systems, ${\sf QIPL} $
and ${\sf QIP_ {\rm U} L} $. The ${\sf QIP_ {\rm U} L} $ model, a space-bounded variant of …

The field of quantum Hamiltonian complexity lies at the intersection of quantum many-body
physics and computational complexity theory, with deep implications to both fields. The main …