Quantum complexity theory

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

Overview

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

Two important quantum complexity classes are BQP and QMA which are the bounded-error quantum analogues of P and NP. One of the main aims of quantum complexity theory is to find out where these classes lie with respect to classical complexity classes such as P, NP, PP, PSPACE and other complexity classes.

Quantum query complexity

In the query complexity model, the input is given as an oracle (black box). The algorithm gets information about the input only by querying the oracle. The algorithm starts in some fixed quantum state and the state evolves as it queries the oracle.

Quantum Query Complexity is the smallest number of queries to the oracle that are required in order to calculate the function. This makes the Quantum Query Complexity a lower bound on the overall time complexity of a function.

An example depicting the power of Quantum Computing is Grover's algorithm for searching unstructured databases. The algorithm's Quantum Query Complexity is ${\textstyle O{\left({\sqrt {N}}\right)}}$, a quadratically improvement over the best possible classical query complexity (i.e. a linear search).

Quantum complexity theorists

This list is incomplete; you can help by expanding it.

• Scott Aaronson
• Dorit Aharonov
• John Watrous
• David Cory
• Richard Cleve
• John Preskill

See also

• Quantum computing
• BQP
• Polynomial hierarchy (PH)
• Quantum Turing machine

References

• John Watrous (2008). "Quantum Computational Complexity". arXiv:0804.3401v1 [quant-ph].
• Artem Kaznatcheev. Quantum query complexity.