Probabilistic complexity classes

complexity class

complexity class

complexity class

complexity class

alt=Diagram of randomised complexity classes|thumb|upright=1.25|BQP in relation to other probabilistic complexity classes (ZPP (complexity)|ZPP, RP, co-RP, BPP, PP), which generalise P within [[PSPACE. It is unknown if any of these containments are strict.]] In computational complexity theory, bounded-error quantum polynomial time (BQP) is the class of decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances. It is the quantum analogue to the complexity class BPP.

complexity class

QMA, as an abbreviation for Quantum Merlin Arthur, refers to a complexity class in computational complexity theory. It is the set of all formal languages that satisfy the following properties:

complexity class