Lectures related to Computation with Tensor Networks

Covers the Deutsch and Deutsch-Jozsa algorithms in quantum computing, explaining the principles behind them and their implications.

Explores communication complexity and quantum computation models in Distributed Quantum Computing.

Explores the statistical physics of clusters, focusing on complexity and equilibrium behavior.

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Covers quantum information, computing, algorithms, error correction, and challenges in the field.

Covers classical single qubit Hamiltonian verification and quantum delegation protocols.

Explores Replica Symmetry Breaking in the Random Energy Model, focusing on entropy and probability states.

Explores continuous random variables, density functions, joint variables, independence, and conditional densities.

Explains the Quantum Phase Estimation (QPE) algorithm and its complexity using two registers and SWAP gates.

Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.

Explores fully classical qubits, blind quantum computing, and verifiability in quantum delegation protocols.

Covers the Local Hamiltonian Problem, focusing on QMA-Complete problems and the complexity of verifying quantum computations.

Covers the mechanisms behind quantum computation and explores the advantages of restricted computational models.

Covers quantum computing basics, quantum algorithms, error correction, and quantum bit manipulation.

Explores quantum algorithms, their complexity, and applications in learning, highlighting key concepts and recent research findings.

Covers classical and quantum computational complexity concepts and implications.

Explores recent progress in quantum computational advantage and discusses the challenges in achieving quantum supremacy.

Explores the quantum circuit model of computation, focusing on unitary gates and multi-controlled gates.

Introduces the course syllabus, grading scheme, and classical and quantum computation models.

Covers the Deutsch and Josza problem in quantum computation, focusing on boolean functions and oracles.