vix.ing · top · new · best · stats · spec

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

2011/06/10 by Hong-Lei Wang, Honglei Wang, Qian-Qian Shi +7
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Statistical Mechanics (cond-mat.stat-mech) #cond-mat.stat-mech

paper · pdf · doi:10.48550/arxiv.1106.2129

4+ pages, 4 figures

arxiv created 2011/06/10 · openalex publication_date 2011/06/10 · arxiv updated 2011/06/13 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

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.

Related