Delves into complexity theory, focusing on the P vs NP problem and the classification of computational problems based on efficiency.
Explores computation with tensor networks, covering joint probability distributions, statistical mechanics, and quantum computation applications.
Covers the basics of statistical field theory, focusing on Ising models and the Ginsburg-Landau theory.
Explores simplifying belief propagation equations for pairwise models, reducing computational complexity from order n cubed to order n.
Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.
Explains the Quantum Phase Estimation (QPE) algorithm and its complexity using two registers and SWAP gates.
