Editing PP (complexity) (section)

===PQP===
'''PP''' is also equal to another quantum complexity class known as '''PQP''', which is the unbounded error analog of '''BQP'''. It denotes the class of decision problems solvable by a quantum computer in polynomial time, with an error probability of less than 1/2 for all instances. Even if all amplitudes used for '''PQP'''-computation are drawn from algebraic numbers, still '''PQP''' coincides with '''PP'''.<ref>{{cite journal|last1=Yamakami|first1=Tomoyuki|title=Analysis of Quantum Functions|journal=Int. J. Found. Comput. Sci.|volume=14|issue=5|pages=815–852|bibcode=1999quant.ph..9012Y|year=1999|doi=10.1142/S0129054103002047 |arxiv=quant-ph/9909012|s2cid=3265603 }}</ref>