This HTML5 document contains 33 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n14http://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Quantum_complexity_theory
rdf:type
owl:Thing
rdfs:label
Quantum complexity theory
rdfs:comment
Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational model based on quantum mechanics. It studies the hardness of computational problems in relation to these complexity classes, as well as the relationship between quantum complexity classes and classical (i.e., non-quantum) complexity classes. Two important quantum complexity classes are BQP and QMA.
rdfs:seeAlso
dbr:Computational_complexity
owl:sameAs
yago-res:Quantum_complexity_theory freebase:m.080cql7
dbp:wikiPageUsesTemplate
dbt:Use_American_English dbt:= dbt:Reflist dbt:No dbt:Cite_arXiv dbt:Cite_book dbt:Tmath dbt:Emerging_technologies dbt:Yes dbt:Diagonal_split_header dbt:Main dbt:See_also dbt:Quantum_mechanics_topics dbt:Quantum_computing dbt:Short_description dbt:More_footnotes
dct:subject
dbc:Quantum_information_science dbc:Theoretical_computer_science dbc:Quantum_complexity_theory dbc:Computational_complexity_theory
gold:hypernym
dbr:Part
prov:wasDerivedFrom
n14:Quantum_complexity_theory?oldid=1068865430&ns=0
dbo:wikiPageID
24092190
dbo:wikiPageLength
25343
dbo:wikiPageRevisionID
1068865430
dbo:abstract
Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational model based on quantum mechanics. It studies the hardness of computational problems in relation to these complexity classes, as well as the relationship between quantum complexity classes and classical (i.e., non-quantum) complexity classes. Two important quantum complexity classes are BQP and QMA.
foaf:isPrimaryTopicOf
n14:Quantum_complexity_theory