Quantum Constraint Problems can be complete for BQP, QCMA, and more
Abstract
A quantum constraint problem is a frustration-free Hamiltonian problem: given a collection of local operators, is there a state that is in the ground state of each operator simultaneously? It has previously been shown that these problems can be in P, NP-complete, MA-complete, or QMA1-complete, but this list has not been shown to be exhaustive. We present three quantum constraint problems, that are (1) BQP1-complete (also known as coRQP), (2) QCMA1-complete and (3) coRP-complete. This provides the first natural complete problem for BQP1. We also show that all quantum constraint problems can be realized on qubits, a trait not shared with classical constraint problems. These results suggest a significant diversity of complexity classes present in quantum constraint problems.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.