Elements of Computational ComplexityIntroduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.
The Local Hamiltonian ProblemCovers the Local Hamiltonian Problem, focusing on QMA-Complete problems and the complexity of verifying quantum computations.
Learning from Probabilistic ModelsDelves into challenges of learning from probabilistic models, covering computational complexity, data reconstruction, and statistical gaps.
P vs NP: Complexity TheoryDelves into complexity theory, focusing on the P vs NP problem and the classification of computational problems based on efficiency.
Deutsch-Jozsa AlgorithmCovers the Deutsch-Jozsa algorithm, determining if a function is constant or balanced with a single query.
