ObsidianVault/SS2026/Quantum Computing/19. Quantum Complexity/Quantum Complexity.md

We start with the common class NP (Non-deterministic polynomial time)

! *Some details omitted

!

Question: can quantum computers solve SAT in polynomial time? (and by that, all problems in NP?)

Oracle lower bound

!

! ! !!

Quantum Merlin Arthur

Is there a "quantum NP"?

We define the class QMA (Quantum Merlin Arthur):

!

Example of a QMA Problem: Local Hamiltonian Problem

!