PostBQP is a complexity class in computational theory that extends the class BQP (Bounded-error Quantum Polynomial time). It pertains to problems solvable by a quantum computer with bounded error, but with added flexibility for the kinds of quantifiers allowed in decision problems. The "Post" in PostBQP refers to the use of quantifier alternation, similar to how the class PSPACE works with alternating quantifiers.
New to topics? Read the docs here!