An efficient computation of geometric entanglement for two-dimensional quantum lattice systems

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4+ pages, 4 figures

Scientific paper

The geometric entanglement per lattice site, as a holistic measure of the multipartite entanglement, serves as a universal marker to detect quantum phase transitions in quantum many-body systems. However, it is very difficult to compute the geometric entanglement due to the fact that it involves a complicated optimization over all the possible separable states. In this paper, we propose a systematic method to efficiently compute the geometric entanglement per lattice site for quantum many-body lattice systems in two spatial dimensions in the context of a newly-developed tensor network algorithm based on an infinite projected entangled pair state representation. It is tested for quantum Ising model in a transverse magnetic field and anisotropic spin 1/2 anti-ferromagnetic XYX model in an external magnetic field on an infinite-size square lattice. In addition, the geometric entanglement per lattice site is able to detect the so-called factorizing field. Our results are in a quantitative agreement with Quantum Monte Carlo simulations.

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

An efficient computation of geometric entanglement for two-dimensional quantum lattice systems 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 An efficient computation of geometric entanglement for two-dimensional quantum lattice systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An efficient computation of geometric entanglement for two-dimensional quantum lattice systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-320886

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