Hamiltonian complexity

Hamiltonian complexity or quantum Hamiltonian complexity is a topic which deals with problems in quantum complexity theory and condensed matter physics. It mostly studies constraint satisfaction problems related to ground states of local Hamiltonians; that is, Hermitian matrices that act locally on a system of interest. The constraint satisfaction problems in quantum Hamiltonian complexity have led to the quantum version of the Cook–Levin theorem. Quantum Hamiltonian complexity has helped physicists understand the difficulty of simulating physical systems.

Local Hamiltonian problem

Main article: QMA § The local Hamiltonian problem

Given a Hermitian matrix $H$, let $\lambda _{0}$ denote the ground state energy of the Hamiltonian $H$, and let $a$ and $b$ be non-negative real numbers with $b\geq a+1$. If $\lambda _{0}\leq a$, output Yes. If $\lambda _{0}\geq b$, output No. The k-local Hamiltonian problem is similar except the Hamiltonians have $k$-local interactions. This problem has been shown to be QMA-complete for $k\geq 2$.

Area law

Main article: Entropy of entanglement § Area law of bipartite entanglement entropy

The area law explains the structure of entanglement present in ground states of physically relevant systems. It states that the entropy of a reduced density matrix of a quantum system in its ground state is proportional to the boundary length of the area.

The area law has been useful in finding efficient ways to simulate entangled quantum systems.

Quantum analog of the PCP theorem

Main article: PCP theorem § Quantum analog of the PCP theorem

The classical PCP theorem states that simulating the ground states of classical systems is hard. The quantum analog of the PCP theorem concerns simulations of quantum systems. Proving the quantum analog of the PCP theorem is an open problem.

See also

• Hamiltonian simulation
• Density matrix renormalization group
• Matrix product state