YoVDO

Entanglement Subvolume Law for 2D Frustration-Free Spin Systems

Offered By: Association for Computing Machinery (ACM) via YouTube

Tags

Quantum Physics Courses Computational Complexity Courses Theoretical Physics Courses Hamiltonian Systems Courses Quantum Information Theory Courses Entanglement Entropy Courses

Course Description

Overview

Explore the intricacies of entanglement entropy in 2D frustration-free spin systems through this 23-minute conference talk presented at an Association for Computing Machinery (ACM) event. Delve into the central concepts of local Hamiltonians, ground states, and entanglement entropy, while examining Hastings' proof and its underlying assumptions. Learn about the upper bounding approach, robust polynomials, and the Whole Screen Directivity Lemma. Conclude by discussing future directions and open questions in this fascinating area of quantum physics and computational complexity.

Syllabus

Introduction
Central Concept
Local Hamiltonian
Ground State
Entanglement
Entropy
Hastings Proof
Assumptions
Upper Bounding
Approach
Robust Polynomials
Hamiltonian System
Whole Screen Directivity Lemma
Future Directions
Open Questions


Taught by

Association for Computing Machinery (ACM)

Related Courses

Automata Theory
Stanford University via edX
Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX
算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera
How to Win Coding Competitions: Secrets of Champions
ITMO University via edX
Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera