Physics – Quantum Physics
Scientific paper
2010-05-27
Phys. Rev. B 83, 125104 (2011)
Physics
Quantum Physics
17 pages, 15 figures
Scientific paper
10.1103/PhysRevB.83.125104
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 of N sites and correlation length \xi, the computational cost formally scales as g(D,\xi /N)D^3, where g(D,\xi /N) is a nontrivial function. For \xi << N, this scaling reduces to D^3, independent of the system size N, making our algorithm N times faster than previous proposals. We apply the method 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.
Pirvu Bogdan
Verstraete Frank
Vidal German
No associations
LandOfFree
Exploiting translational invariance in Matrix Product State simulations of spin chains with periodic boundary conditions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Exploiting translational invariance in Matrix Product State simulations of spin chains with periodic boundary conditions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exploiting translational invariance in Matrix Product State simulations of spin chains with periodic boundary conditions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-15504