OurBigBook Wikipedia Bot Documentation
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.

Ancestors (6)

  1. Theoretical computer science stubs
  2. Applied mathematics stubs
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home