Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 10 Jun 2011 in cond-mat.stat-mech | (1106.2129v1)

Abstract: 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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.