Algorithms for entanglement renormalization

233Citations
Citations of this article
213Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe an iterative method to optimize the multiscale entanglement renormalization ansatz for the low-energy subspace of local Hamiltonians on a D -dimensional lattice. For translation-invariant systems the cost of this optimization is logarithmic in the linear system size. Specialized algorithms for the treatment of infinite systems are also described. Benchmark simulation results are presented for a variety of one-dimensional systems, namely, Ising, Potts, XX, and Heisenberg models. The potential to compute expected values of local observables, energy gaps, and correlators is investigated. © 2009 The American Physical Society.

Cite

CITATION STYLE

APA

Evenbly, G., & Vidal, G. (2009). Algorithms for entanglement renormalization. Physical Review B - Condensed Matter and Materials Physics, 79(14). https://doi.org/10.1103/PhysRevB.79.144108

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free