A matrix product state based algorithm for determining dispersion relations of quantum spin chains with periodic boundary conditions

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, 11 figures, 5 tables

Scientific paper

10.1103/PhysRevB.85.035130

We study a matrix product state (MPS) algorithm to approximate excited states of translationally invariant quantum spin systems with periodic boundary conditions. By means of a momentum eigenstate ansatz generalizing the one of \"Ostlund and Rommer [1], we separate the Hilbert space of the system into subspaces with different momentum. This gives rise to a direct sum of effective Hamiltonians, each one corresponding to a different momentum, and we determine their spectrum by solving a generalized eigenvalue equation. Surprisingly, many branches of the dispersion relation are approximated to a very good precision. We benchmark the accuracy of the algorithm by comparison with the exact solutions of the quantum Ising and the antiferromagnetic Heisenberg spin-1/2 model.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A matrix product state based algorithm for determining dispersion relations of quantum 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 A matrix product state based algorithm for determining dispersion relations of quantum spin chains with periodic boundary conditions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A matrix product state based algorithm for determining dispersion relations of quantum spin chains with periodic boundary conditions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-260521

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.