Dissipative ground state preparation and the Dissipative Quantum Eigensolver

Understand

For any local Hamiltonian H, I construct a local CPT map and stopping condition which converges to the ground state subspace of H.

• Like any ground state preparation algorithm, this algorithm necessarily has exponential run-time in general (otherwise BQP=QMA), even for gapped, frustration-free Hamiltonians (otherwise BQP is in NP).
• However, this dissipative quantum eigensolver has a number of interesting characteristics, which give advantages over previous ground state preparation algorithms.
• - The entire algorithm consists simply of iterating the same set of local measurements repeatedly.