# Category:Quantum complexity theory

Computing portal |

Here is a list of articles in the Quantum complexity theory category of the Computing portal that unifies foundations of mathematics and computations using computers.

Computational complexity theory with quantum computers.

## Pages in category "Quantum complexity theory"

The following 15 pages are in this category, out of 15 total.

- Quantum complexity theory
*(computing)*

### A

- AWPP (complexity)
*(computing)*

### B

- BQP
*(computing)*

### C

- Claw finding problem
*(computing)* - Communication complexity
*(computing)*

### E

- EQP (complexity)
*(physics)*

### G

- Gap-Hamming problem
*(computing)*

### H

- Hamiltonian complexity
*(computing)*

### P

- PostBQP
*(computing)* - PP (complexity)
*(computing)*

### Q

- QCMA
*(computing)* - QMA
*(computing)* - Bernstein–Vazirani algorithm
*(computing)* - Hidden linear function problem
*(computing)* - Quantum Turing machine
*(computing)*