About: Quantum complexity theory     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Thinking105770926, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/c/Ltmrz42Xq

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.

AttributesValues
rdf:type
rdfs:label
  • Quantum complexity theory (en)
  • Teoría de la complejidad cuántica (es)
  • Теория квантовой сложности (ru)
  • 量子复杂性理论 (zh)
rdfs:comment
  • La Teoría de complejidad cuántica es una parte de la Teoría de complejidad computacional en informática teórica. Estudia clases de complejidad definidas utilizando ordenadores cuánticos e información cuántica, qué son los modelos computacionales basados en la mecánica cuántica.. Se ocupa de la dureza de problemas en relación con estas clases de complejidad y la relación entre clases de complejidad cuántica y clases de complejidad clásicas (p.e., no cuánticas). (es)
  • 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)
  • Квантовая теория сложности — часть теории сложности вычислений в теоретической информатике. Изучает классы сложности, определённые с использованием квантовых компьютеров и квантовой информации, а также проблемы, связанные с этими классами сложности, и связи между классами квантовой сложности и классическими (неквантовыми) классами сложности. (ru)
  • 量子复杂性理论(Quantum complexity theory)是理论计算机科学中计算复杂性理论的一部份。该理论使用量子计算机和量子信息来研究分析复杂性类定义,量子信息是基于量子力学的计算模型。量子复杂性理论用来研究这些复杂性类的问题的困难度,和量子复杂性类与经典(非量子的)复杂性类的关系。 复杂性类是指的是一群複雜度類似的問題的集合,可以用滿足特定資源限制下的演算法求解。例如复杂性类P就是可以用图灵机在多項式時間內求解的問題。也可以用量子算法(如量子计算机或量子圖靈機)定義量子复杂性,例如複雜度BQP就是可以用量子计算机在多項式時間內解決,其錯誤的機率小於一定比例的問題。 量子复杂性中二個比較重要的复杂性類分別是BQP及,分別對應複雜度P及NP (複雜度)。量子复杂性理论的一個主要目的是要找到對應傳統复杂性類(如P、NP、PSPACE、PP等)的量子复杂性。 (zh)
rdfs:seeAlso
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/BQP_complexity_class_diagram.svg
dct:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
Faceted Search & Find service v1.17_git147 as of Sep 06 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3331 as of Sep 2 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 59 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software