Quantum complexity theory: Difference between revisions

Revision as of 07:27, 3 March 2020

Revision as of 07:39, 3 March 2020

Line 2:

{{no footnotes|date=March 2020}}

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

'''Quantum complexity theory''' is the subfield of [[computational complexity theory]] that deals with [[complexity classes]] defined using [[quantum computers]] and [[quantum information]], which are [[computational model]]s based on [[quantum mechanics]]. It studies the hardness of problems[[computational problem]]s in relation to these complexity classes, and the relationship between quantum complexity classes and classical (i.e., non-quantum) complexity classes.

==Overview==