Exact quantum polynomial time
id:
exact-quantum-polynomial-time-267-3709289
title:
Exact quantum polynomial time
text:
In computational complexity theory, exact quantum polynomial time is the class of decision problems that can be solved by a quantum computer with zero error probability and in guaranteed worst-case polynomial time. It is the quantum analogue of the complexity class P. This is in contrast to bounded-error quantum computing, where quantum algorithms are expected to run in polynomial time, but may not always do so. In the original definition of EQP, each language was computed by a single quantum Tu
brand slug:
wiki
category slug:
encyclopedia
description:
Computer science
original url:
https://en.wikipedia.org/wiki/Exact_quantum_polynomial_time
date created:
date modified:
2023-02-25T00:56:46Z
main entity:
{"identifier":"Q5323985","url":"https://www.wikidata.org/entity/Q5323985"}
image:
fields total:
13
integrity:
14