Content deleted Content added
m Bot: Migrating 1 langlinks, now provided by Wikidata on d:Q7269023 |
No edit summary |
||
Line 1:
'''Quantum complexity theory''' is a part of [[computational complexity theory]] in [[theoretical computer science]]. It studies [[complexity classes]] defined using [[quantum computers]] and [[quantum information]] which are [[computational model]]s based on [[quantum mechanics]]. It studies the hardness of problems in relation to these complexity classes, and the relationship between quantum complexity classes and classical (i.e., non-quantum) complexity classes.dreysr thyaer srt aer srth aegh sre rts
A complexity class is a collection of problems which can be solved by some computational model under resource constraints. For instance, the complexity class [[P_(complexity)|P]] is defined to be the set of problems solvable by a [[Turing machine]] in [[polynomial time]]. Similarly, one may define a quantum complexity class using a quantum model of computation, such as a standard [[quantum computer]] or a [[quantum Turing machine]]. Thus, the complexity class [[BQP]] is defined to be the set of problems solvable by a quantum computer in polynomial time with bounded error.
| |||