Useful Links
Computer Science
Algorithms and Data Structures
Computational Complexity Theory
1. Introduction to Computational Complexity Theory
2. Mathematical Foundations
3. Models of Computation
4. Complexity Measurement
5. Time Complexity Classes
6. Reducibility and NP-Completeness
7. Space Complexity Theory
8. Hierarchy Theorems
9. Polynomial Hierarchy
10. Randomized Complexity
11. Interactive Proof Systems
12. Circuit Complexity
13. Quantum Complexity
14. Advanced Topics
Quantum Complexity
Quantum Computation Basics
Quantum Bits
Superposition States
Measurement Process
Quantum Gates
Unitary Operations
Basic Gate Set
Quantum Circuits
Circuit Model
Quantum Parallelism
Quantum Complexity Classes
Bounded-Error Quantum Polynomial Time BQP
Definition and Properties
Error Bounds
Relationship to Classical Classes
Exact Quantum Polynomial Time EQP
Quantum Interactive Proofs QIP
Quantum Algorithms
Shor's Factoring Algorithm
Quantum Fourier Transform
Period Finding
Cryptographic Implications
Grover's Search Algorithm
Unstructured Search
Quadratic Speedup
Optimality Results
Quantum Simulation
Quantum Complexity Theory
Quantum-Classical Separations
Quantum Lower Bounds
Open Problems
Previous
12. Circuit Complexity
Go to top
Next
14. Advanced Topics