##### Wikipedia

**EQP**

**EQP**, an abbreviation for **equational prover**, is an automated theorem proving program for equational logic, developed by the Mathematics and Computer Science Division of the Argonne National Laboratory. It was one of the provers used for solving a longstanding problem posed by Herbert Robbins, namely, whether all Robbins algebras are Boolean algebras.

**EQP (complexity)**

In computational complexity theory, **EQP** (sometimes called **QP**), which stands for exact quantum polynomial time, is the class of decision problems solvable by a quantum computer which outputs the correct answer with probability 1 and runs in polynomial time. It is the quantum analogue of the complexity class P.

In other words, there is an algorithm for a quantum computer (a quantum algorithm) that solves the decision problem exactly and is guaranteed to run in polynomial time.