Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/BQP> ?p ?o }
Showing triples 1 to 76 of
76
with 100 triples 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 wikiPageLength "6522".
- BQP wikiPageOutDegree "38".
- BQP wikiPageRevisionID "673892542".
- BQP wikiPageWikiLink AWPP_(complexity).
- BQP wikiPageWikiLink Algorithm.
- BQP wikiPageWikiLink Almost_Wide_Probabilistic_Polynomial-Time.
- BQP wikiPageWikiLink BPP_(complexity).
- BQP wikiPageWikiLink Bounded-error_probabilistic_polynomial.
- BQP wikiPageWikiLink Category:Probabilistic_complexity_classes.
- BQP wikiPageWikiLink Category:Quantum_complexity_theory.
- BQP wikiPageWikiLink Category:Quantum_computing.
- BQP wikiPageWikiLink Chernoff_bound.
- BQP wikiPageWikiLink Circuit_complexity.
- BQP wikiPageWikiLink Computational_complexity_theory.
- BQP wikiPageWikiLink Decision_problem.
- BQP wikiPageWikiLink Decision_problems.
- BQP wikiPageWikiLink Discrete_logarithm.
- BQP wikiPageWikiLink Integer_factorization.
- BQP wikiPageWikiLink Jones_polynomial.
- BQP wikiPageWikiLink Low_(complexity).
- BQP wikiPageWikiLink Measurement_in_quantum_mechanics.
- BQP wikiPageWikiLink NP_(complexity).
- BQP wikiPageWikiLink PP_(complexity).
- BQP wikiPageWikiLink PSPACE.
- BQP wikiPageWikiLink P_(complexity).
- BQP wikiPageWikiLink Polynomial.
- BQP wikiPageWikiLink Polynomial_function.
- BQP wikiPageWikiLink Polynomial_time.
- BQP wikiPageWikiLink PostBQP.
- BQP wikiPageWikiLink Postselection.
- BQP wikiPageWikiLink Quantum_algorithm.
- BQP wikiPageWikiLink Quantum_circuit.
- BQP wikiPageWikiLink Quantum_computer.
- BQP wikiPageWikiLink Quantum_computing.
- BQP wikiPageWikiLink Quantum_simulator.
- BQP wikiPageWikiLink Quantum_state.
- BQP wikiPageWikiLink Qubit.
- BQP wikiPageWikiLink Shors_algorithm.
- BQP wikiPageWikiLink Time_complexity.
- BQP wikiPageWikiLink Turing_machine.
- BQP wikiPageWikiLink Universal_quantum_simulator.
- BQP wikiPageWikiLink Wave_function_collapse.
- BQP wikiPageWikiLink Wavefunction_collapse.
- BQP wikiPageWikiLink File:BQP_complexity_class_diagram.svg.
- BQP wikiPageWikiLinkText "BQP".
- BQP hasPhotoCollection BQP.
- BQP wikiPageUsesTemplate Template:ComplexityClasses.
- BQP wikiPageUsesTemplate Template:Quantum_computing.
- BQP wikiPageUsesTemplate Template:Unsolved.
- BQP subject Category:Probabilistic_complexity_classes.
- BQP subject Category:Quantum_complexity_theory.
- BQP subject Category:Quantum_computing.
- BQP hypernym Problems.
- BQP type Disease.
- BQP type Class.
- 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".
- BQP sameAs BQP.
- BQP sameAs BQP.
- BQP sameAs BQP.
- BQP sameAs BQP.
- BQP sameAs BQP_(complessità).
- BQP sameAs BQP.
- BQP sameAs BQP.
- BQP sameAs BQP.
- BQP sameAs m.01b4g.
- BQP sameAs Класс_BQP.
- BQP sameAs Q601325.
- BQP sameAs Q601325.
- BQP sameAs BQP_(複雜度).
- BQP wasDerivedFrom BQP?oldid=673892542.
- BQP depiction BQP_complexity_class_diagram.svg.
- BQP isPrimaryTopicOf BQP.