A Polynomial-time Algorithm for Finding Ground States of Gapped Local Hamiltonians in 1D

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=vGbiD_d350E


Duration: 1:01:18
790 views
5

Thomas Vidick, California Institute of Technology
Tensor Networks and Simulations
http://simons.berkeley.edu/talks/thomas-vidick-2014-04-23



Other Videos By Simons Institute for the Theory of Computing


2014-05-01'Gauging' Time Reversal Symmetry in Tensor Network States
2014-05-01Exact Holographic Mapping and Emergent Space-time Geometry
2014-05-01Einstein's Equations Starting from Qubits
2014-05-01Tensor Networks and Conformal Field Theory
2014-05-01Topological Order in Projected Entangled Pair States
2014-05-01Tensor Network States for Chiral Topological Phases
2014-05-01Wavelets, MERA, and Holography
2014-05-01Invariants for Gapped Ground State Phases
2014-05-01Bifurcation in Entanglement Renormalization Group Flow of a Gapped Spin Model
2014-05-01Walking Graph States: General Ansatz for Non-equilibrium Density Operators of Quantum Chains
2014-05-01A Polynomial-time Algorithm for Finding Ground States of Gapped Local Hamiltonians in 1D
2014-05-01Tensor Networks and Quantum Algorithms
2014-05-01Area Laws and Topological Order in a Many-body Localized State
2014-05-01Doped Bosonic and Fermionic Resonating Valence Bond States
2014-05-01The Algebraic Bethe Ansatz and Tensor Networks
2014-05-01Symmetry and Topological Order in Quantum States
2014-04-29A Few Comments (& Questions!) from a Condensed Matter Physicist
2014-04-22Complexity of Evolutionary Equilibria in Static Fitness Landscapes
2014-04-11Evolutionary Genetics in the Crush of Genomics
2014-04-03How Quantum is D-Wave?
2014-04-03Experiments with D-Wave


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Quantum Hamiltonian Complexity
Thomas Vidick