Same as QMA, except now the witness is a pure state, and the verifier can directly obtain the probability that any one of a polynomial number of observables of the witness, if measured, would equal 1. (In the usual model, by contrast, one can only sample an observable.) Without the pure state restriction, this class is SuperQMA.
Defined in [KR24] whose complete problem is the pure state marginal problem. It is known to be QMA-hard but contained in PSPACE and QMA(2). Surprisingly, it is unknown whether this class equals SuperQMA = QMA.
No class.