Rigorous RG Algorithms for Low-Energy Eigenstates in 1D Systems

rigorous rg algorithms rigorous rg algorithms n.w
1 / 13
Embed
Share

"Discover the rigorous renormalization group algorithms and area laws for low-energy eigenstates in 1D systems. Explore the algorithmic approaches and results for local Hamiltonians and ground state projections."

  • Algorithms
  • Eigenstates
  • Renormalization
  • Hamiltonians
  • Energy

Uploaded on | 0 Views


Download Presentation

Please find below an Image/Link to download the presentation.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.

You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.

E N D

Presentation Transcript


  1. Rigorous RG algorithms Rigorous RG algorithms and area laws for low and area laws for low energy eigenstates in 1D energy eigenstates in 1D THOMAS VIDICK CALIFORNIA INSTITUTE OF TECHNOLOGY JOINT WORK WITH ITAI ARAD (TECHNION), ZEPH LANDAU AND UMESH VAZIRANI (UC BERKELEY)

  2. Local Hamiltonians eigenvalues eigenstates

  3. Low-lying states of local Hamiltonians T

  4. Low-lying states of local Hamiltonians eigenvalues eigenstates

  5. Results eigenvalues eigenstates eigenvalues eigenstates

  6. Outline 1. Approximate ground state projections (AGSP) 2. Viable sets 3. Algorithm

  7. Approximate Ground State Projections [ALV12] Q.E.D.

  8. Approximate Ground State Projections [ALV12]

  9. Viable sets [LVV15]

  10. The algorithm Initialization: create viable sets on pairs of qubits Approximation error remains constant throughout!

  11. AGSP construction

  12. AGSP construction don t care keep

  13. Summary Area law + efficient algorithms for: (DG) polynomial-size ground space, constant gap (LD) polynomial density of states Features: Iterative tree-like procedure reminiscent of RG Elementary structure is viable set rather than state Operates in delicate constant-approximation regime, controlled by AGSP Questions: Efficient?? [Roberts-Motrunich-V., in progress: benchmark against DMRG] Poly-time algorithm for (LD)? Using MERA? Higher dimension!

Related


More Related Content