 Exact quantum polynomial time

Exact quantum polynomial time (EQP) is a complexity class that relates to quantum computing. It consists of decision problems that can be solved by a quantum computer in polynomial time with a high degree of certainty. Specifically, EQP represents the set of problems for which there exists a quantum algorithm that can provide the correct answer with certainty (i.e., with probability 1) within a time that is polynomial with respect to the size of the input.