Matches in DBpedia 2014 for { <http://dbpedia.org/resource/BQP> ?p ?o. }
Showing items 1 to 34 of
34
with 100 items per page.
- BQP abstract "In computational complexity theory, BQP (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. It is the quantum analogue of the complexity class BPP.In other words, there is an algorithm for a quantum computer (a quantum algorithm) that solves the decision problem with high probability and is guaranteed to run in polynomial time. On any given run of the algorithm, it has a probability of at most 1/3 that it will give the wrong answer.Similarly to other "bounded error" probabilistic classes the choice of 1/3 in the definition is arbitrary. We can run the algorithm a constant number of times and take a majority vote to achieve any desired probability of correctness less than 1, using the Chernoff bound. Detailed analysis shows that the complexity class is unchanged by allowing error as high as 1/2 − n−c on the one hand, or requiring error as small as 2−nc on the other hand, where c is any positive constant, and n is the length of input.".
- BQP thumbnail BQP_complexity_class_diagram.svg?width=300.
- BQP wikiPageID "4080".
- BQP wikiPageRevisionID "573155472".
- BQP hasPhotoCollection BQP.
- BQP subject Category:Probabilistic_complexity_classes.
- BQP subject Category:Quantum_complexity_theory.
- BQP type Abstraction100002137.
- BQP type Class107997703.
- BQP type Collection107951464.
- BQP type Group100031264.
- BQP type ProbabilisticComplexityClasses.
- BQP comment "In computational complexity theory, BQP (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. It is the quantum analogue of the complexity class BPP.In other words, there is an algorithm for a quantum computer (a quantum algorithm) that solves the decision problem with high probability and is guaranteed to run in polynomial time.".
- BQP label "BQP (complessità)".
- BQP label "BQP (複雜度)".
- BQP label "BQP".
- BQP label "BQP".
- BQP label "BQP".
- BQP label "BQP".
- BQP label "BQP".
- BQP label "Класс BQP".
- BQP sameAs BQP.
- BQP sameAs BQP.
- BQP sameAs BQP.
- BQP sameAs BQP_(complessità).
- BQP sameAs BQP.
- BQP sameAs BQP.
- BQP sameAs m.01b4g.
- BQP sameAs Q601325.
- BQP sameAs Q601325.
- BQP sameAs BQP.
- BQP wasDerivedFrom BQP?oldid=573155472.
- BQP depiction BQP_complexity_class_diagram.svg.
- BQP isPrimaryTopicOf BQP.