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.
Wikipage disambiguates
Link from a Wikipage to another Wikipage
primaryTopic
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.
has abstract
In computational complexity th ...... eed to run in polynomial time.
@en
В теории сложности вычислений ...... вается в полиномиальное время.
@ru
計算複雑性理論において、 EQP (exact quantu ...... 決定的に、多項式時間内に解くものが存在するということである。
@ja
Wikipage page ID
27,942,982
page length (characters) of wiki page
Wikipage revision ID
995,966,891
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
In computational complexity th ...... eed to run in polynomial time.
@en
В теории сложности вычислений ...... вается в полиномиальное время.
@ru
計算複雑性理論において、 EQP (exact quantu ...... 決定的に、多項式時間内に解くものが存在するということである。
@ja
label
EQP (complexity)
@en
EQP (計算複雑性理論)
@ja
EQP
@ru