Inspired by the 2 definitions (theorems) I am aware of, that are as follows.
- A language L belongs to QMA if there exists a BQP verifier V.
- A language L belongs to NP if there exists a P verifier V.
Now I am curious about what's the complexity class A, such that the following statement holds. A language L belong to A if there exists a PSPACE verifier V. Is there an alternate characterization of A? Is there a good name for such a class a A for an arbitrary class X?