Exploiting translational invariance in matrix product state simulations of spin chains with periodic boundary conditions

B. Pirvu, F. Verstraete, and G. Vidal
Phys. Rev. B 83, 125104 – Published 17 March 2011

Abstract

We present a matrix product state (MPS) algorithm to approximate ground states of translationally invariant systems with periodic boundary conditions. For a fixed value of the bond dimension D of the MPS, we discuss how to minimize the computational cost to obtain a seemingly optimal MPS approximation to the ground state. In a chain with N sites and correlation length ξ, the computational cost formally scales as g(D,ξ/N)D3, where g(D,ξ/N) is a nontrivial function. For ξN, this scaling reduces to D3, independent of the system size N, making our method N times faster than previous proposals. We apply the algorithm to obtain MPS approximations for the ground states of the critical quantum Ising and Heisenberg spin-1/2 models as well as for the noncritical Heisenberg spin-1 model. In the critical case, for any chain length N, we find a model-dependent bond dimension D(N) above which the polynomial decay of correlations is faithfully reproduced throughout the entire system.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
8 More
  • Received 27 May 2010

DOI:https://doi.org/10.1103/PhysRevB.83.125104

©2011 American Physical Society

Authors & Affiliations

B. Pirvu1, F. Verstraete1, and G. Vidal2

  • 1Fakultät für Physik, Universität Wien, Boltzmanngasse 5, A-1090 Wien, Austria
  • 2School of Mathematics and Physics, The University of Queensland, Brisbane, Queensland 4072, Australia

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 83, Iss. 12 — 15 March 2011

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review B

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×