Lecture
Elements of computational complexity
Related lectures (182)
Quantum Computation Delegation
Covers the concept of quantum computation delegation and the relationship between MIP and RE, addressing common FAQs and discussing helpful materials and interactions with quantum devices.
Elements of Computational Complexity
Covers quantum algorithms, complexity classes, Grover's algorithm, and quantum information in computational complexity.
Elements of Computational Complexity
Introduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.
Grover's Search Algorithm
Covers Grover's search algorithm, a quantum algorithm for searching unstructured databases.
Solving Parity Games in Practice
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
The Deutsch and Deutsch-Jozsa Algorithms
Covers the Deutsch and Deutsch-Jozsa algorithms in quantum computing, explaining the principles behind them and their implications.
Quantum Computing: Introduction
Covers quantum computing basics, quantum algorithms, error correction, and quantum bit manipulation.
Correctness and Soundness of the Qubit Test
Explores the correctness and soundness of the Qubit Test, emphasizing probabilistic algorithms, trapdoors, and function inversion.
Shor Algorithm: Circuit Details II
Explores the Shor algorithm circuit details for efficient number factoring using quantum computing.