pith. sign in

arxiv: 1106.2129 · v1 · pith:SMHEK4BYnew · submitted 2011-06-10 · ❄️ cond-mat.stat-mech

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

classification ❄️ cond-mat.stat-mech
keywords entanglementlatticequantumgeometricfieldsitesystemscompute
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.