##### Wikipedia

**AWPP (complexity)**

In theoretical computer science, **Almost Wide Probabilistic Polynomial-Time** (AWPP) is a complexity class for problems in the context of quantum computing.

AWPP contains the BQP (Bounded error, Quantum, Polynomial time) class, which contains the decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances. In fact, it is the best known classical upper bound for BQP. Furthermore, it is contained in the APP class.

**AWPP**

**AWPP** may refer to:

- Adaptive Wireless Path Protocol
- Almost Wide Probabilistic Polynomial-Time