A polynomial-time algorithm for the ground state of 1D gapped local Hamiltonians
Duration: 60 mins
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Vidick, T (Massachusetts Institute of Technology)
Wednesday 27 November 2013, 15:00-16:00 |
|---|
| Created: | 2013-11-29 11:45 |
|---|---|
| Collection: | Mathematical Challenges in Quantum Information |
| Publisher: | Isaac Newton Institute |
| Copyright: | Vidick, T |
| Language: | eng (English) |
| Abstract: | Co-authors: Zeph Landau (UC Berkeley), Umesh Vazirani (UC Berkeley)
Computing ground states of local Hamiltonians is a fundamental problem in condensed matter physics. We give the first randomized polynomial-time algorithm for finding ground states of gapped one-dimensional Hamiltonians: it outputs an (inverse-polynomial) approximation, expressed as a matrix product state (MPS) of polynomial bond dimension. The algorithm combines many ingredients, including recently discovered structural features of gapped 1D systems, convex programming, insights from classical algorithms for 1D satisfiability, and new techniques for manipulating and bounding the complexity of MPS. Our result provides one of the first major classes of Hamiltonians for which computing ground states is provably tractable despite the exponential nature of the objects involved. Joint work with Zeph Landau and Umesh Vazirani. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 877.11 MB | View | Download | |
| WebM | 640x360 | 588.55 kbits/sec | 258.64 MB | View | Download | |
| iPod Video | 480x270 | 523.91 kbits/sec | 230.24 MB | View | Download | |
| MP3 | 44100 Hz | 251.7 kbits/sec | 110.61 MB | Listen | Download | |
| Auto * | (Allows browser to choose a format it supports) | |||||