Quantum complexity theory: Difference between revisions

Revision as of 08:40, 17 January 2019

Revision as of 16:09, 22 January 2019

Line 1:

{{Use American English|date=January 2019}}

{{Short description|Computational complexity of quantum algorithms}}

'''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.

Line 24 ⟶ 26:

==See also==

* [[Quantum computing]]

* [[BQP]]

* [[Polynomial hierarchy]] (PH)

* [[Quantum Turing machine]]

==References==