Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03138765n
Noun Named Entity
SYL
Bqp
EN
In computational complexity theory, bounded-error quantum polynomial time is the class of decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances. Wikipedia
Relations
Sources
IS A
EN
complexity class
EN
computational problem
HAS PART
BPP
PART OF
EN
AWPP
BabelNet
SYL
Bqp

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License