QMA, or Quantum Merlin-Arthur, is a complexity class in quantum computing that is analogous to the classical complexity class NP (nondeterministic polynomial time). In QMA, a "quantum verifier" (Arthur) interacts with a "quantum proof" (Merlin) in order to determine the correctness of a solution to a decision problem.
New to topics? Read the docs here!