About: Quantum complexity theory

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Quantum complexity theory Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

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.

Attributes	Values
rdf:type	Thing
rdfs:label	Quantum complexity theory (en)
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. (en)
rdfs:seeAlso	Computational complexity
sameAs	Quantum complexity theory Quantum complexity theory
dbp:wikiPageUsesTemplate	dbt:= dbt:Cite_arXiv dbt:Cite_book dbt:Main dbt:More_footnotes dbt:No dbt:Reflist dbt:See_also dbt:Short_description dbt:Tmath dbt:Use_American_English dbt:Yes dbt:Diagonal_split_header dbt:Emerging_technologies dbt:Quantum_computing dbt:Quantum_mechanics_topics
Subject	Computational complexity theory Quantum complexity theory Quantum information science Theoretical computer science
gold:hypernym	Part
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Quantum_complexity_theory?oldid=1068865430&ns=0
Wikipage page ID	24092190 (xsd:integer)
page length (characters) of wiki page	25343 (xsd:nonNegativeInteger)
Wikipage revision ID	1068865430 (xsd:integer)
has 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. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Quantum_complexity_theory
is Wikipage redirect of	Quantum computational complexity
is Link from a Wikipage to another Wikipage of	Mark Wilde Non-constructive algorithm existence proofs 100 prisoners problem Alan R. Bishop Andris Ambainis BQP Leonard Susskind Church–Turing–Deutsch principle Computational complexity Algorithmic complexity Connes embedding problem Continuous-variable quantum information Hamiltonian complexity MAXEkSAT
is known for of	Andris Ambainis

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software