Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2302.04192 · Physical review. B./Physical review. B

Finite projected entangled pair states for the Hubbard model

Markus Scheb, R. M. Noack

Published Apr 7, 2023• 16 citations
arXivHTMLPDF

Abstract

We adapt and optimize the projected-pair-entangled-state (PEPS) algorithm on finite lattices (fPEPS) for two-dimensional Hubbard models and apply the algorithm to the Hubbard model with nearest-neighbor hopping on a square lattice. In particular, we formulate the PEPS algorithm using projected entangled pair operators, incorporate SU(2) symmetry in all tensor indices, and optimize the PEPS using both iterative-diagonalization-based local bond optimization and gradient-based optimization of the PEPS. We discuss the performance and convergence of the algorithm for the Hubbard model on lattice sizes of up to $8\ifmmode\times\else\texttimes\fi{}8$ for PEPS states with U(1) symmetric bond dimensions of up to $D=8$ and SU(2) symmetric bond dimensions of up to $D=6$. Finally, we comment on the relative and overall efficiency of schemes for optimizing fPEPS.

DOI
10.1103/physrevb.107.165112

Related papers

Improved contraction of finite projected entangled pair states

Markus Scheb

We present an improved version of the algorithm contracting and optimizing finite projected entangled pair states (fPEPS) in conjunction with projected entangled pair operators (PEPOs). Our work has two components to it. First, we explain in detail the characteristic contraction patterns that occur in fPEPS calculations and how to slice them such that peak memory occupation remains minimal while ensuring efficient parallel computation. Second, we combine controlled bond expansion [A. Gleis, J.-W. Li, and J. von Delft, ] with randomized singular value decomposition [V. Rokhlin, A. Szlam, and M. Tygert, ] and apply it throughout the fPEPS algorithm. We present benchmark results for the Hubbard model for system sizes up to 8 × 8 and SU(2) symmetric bond dimension of up to D = 6 for PEPS bonds and χ = 500 for the environment bonds. Finally, we comment on the state and future of the fPEPS-PEPO framework.

arXiv:2511.01039•Physical review. B./Physical review. B•Apr 14, 2026•0 citations

Accurate Simulation of the Hubbard Model with Finite Fermionic Projected Entangled Pair States

Wen-Yuan Liu, Huanchen Zhai, Ruojing Peng +2 more

We demonstrate the use of finite-size fermionic projected entangled pair states, in conjunction with variational Monte Carlo, to perform accurate simulations of the ground state of the 2D Hubbard model. Using bond dimensions of up to D=28, we show that we can surpass state-of-the-art density matrix renormalization group energies that use up to m=32 000 SU(2) multiplets on eight-leg ladders. We further apply our methodology to 10×16, 12×16, and 16×16 lattices at 1/8 hole doping and observe the dimensional crossover between stripe orientations. Our Letter shows the power of finite-size fermionic tensor networks to resolve the physics of the 2D Hubbard model and related problems.

arXiv:2502.13454•Physical Review Letters•Jun 3, 2025•41 citations

Gradient optimization of fermionic projected entangled pair states on directed lattices

Shaojun Dong, Chao Wang, Yong‐Jian Han +2 more

The recently developed stochastic gradient method combined with Monte Carlo sampling techniques [W. Y. Liu et al., Phys. Rev. B 95, 195154 (2017)] offers a low scaling and accurate method to optimize the projected entangled pair states (PEPS). We extended this method to the fermionic PEPS (fPEPS). To simplify the implementation, we introduce a Fermi arrow notation to specify the order of the fermion operators in the virtual entangled EPR pairs. By defining some local operation rules associated with the Fermi arrows, one can implement fPEPS algorithms very similar to that of standard PEPS. We benchmark the method for the interacting spinless fermion models and the $t\text{\ensuremath{-}}J$ models. The numerical calculations show that the gradient optimization greatly improves the results of simple update method. Furthermore, very large virtual bond dimensions ($D$) and truncation dimensions (${D}_{c}$) are necessary to converge the results of these models. The method therefore offers a powerful tool to simulate fermion systems because it has much lower scaling than the direct contraction methods.

arXiv:1812.03657•Physical review. B./Physical review. B•May 30, 2019•19 citations

Gradient optimization of finite projected entangled pair states

Wen-Yuan Liu, Shaojun Dong, Yong‐Jian Han +2 more

Projected entangled pair states (PEPS) methods have been proven to be powerful tools to solve strongly correlated quantum many-body problems in two dimensions. However, due to the high computational scaling with the virtual bond dimension $D$, in a practical application, PEPS are often limited to rather small bond dimensions, which may not be large enough for some highly entangled systems, for instance, frustrated systems. Optimization of the ground state using the imaginary time evolution method with a simple update scheme may go to a larger bond dimension. However, the accuracy of the rough approximation to the environment of the local tensors is questionable. Here, we demonstrate that by combining the imaginary time evolution method with a simple update, Monte Carlo sampling techniques and gradient optimization will offer an efficient method to calculate the PEPS ground state. By taking advantage of massive parallel computing, we can study quantum systems with larger bond dimensions up to $D=10$ without resorting to any symmetry. Benchmark tests of the method on the ${J}_{1}\ensuremath{-}{J}_{2}$ model give impressive accuracy compared with exact results.

arXiv:1611.09467•Physical review. B./Physical review. B•May 24, 2017•67 citations

Universal tensor-network algorithm for any infinite lattice

Saeed S. Jahromi, Román Orús

We present a general graph-based projected entangled-pair state (gPEPS) algorithm to approximate ground states of nearest-neighbor local Hamiltonians on any lattice or graph of infinite size. By introducing the structural matrix, which codifies the details of tensor networks on any graphs in any dimension $d$, we are able to produce a code that can be essentially launched to simulate any lattice. We further introduce an optimized algorithm to compute simple tensor updates as well as expectation values and correlators with a mean-field-like effective environments. Though not being variational, this strategy allows to cope with PEPS of very large bond dimension (e.g., $D=100$) and produces remarkably accurate results in the thermodynamic limit in many situations, and specially when the correlation length is small and the connectivity of the lattice is large. We prove the validity of our approach by benchmarking the algorithm against known results for several models, i.e., the antiferromagnetic Heisenberg model on a chain, star and cubic lattices, the hardcore Bose-Hubbard model on square lattice, the ferromagnetic Heisenberg model in a field on the pyrochlore lattice, as well as the three-state quantum Potts model in field on the kagome lattice and the spin-1 bilinear-biquadratic Heisenberg model on the triangular lattice. We further demonstrate the performance of gPEPS by studying the quantum phase transition of the $2d$ quantum Ising model in transverse magnetic field on the square lattice, and the phase diagram of the Kitaev-Heisenberg model on the hyperhoneycomb lattice. Our results are in excellent agreement with previous studies.

arXiv:1808.00680•Physical review. B./Physical review. B•May 3, 2019•46 citations

Optimization of the projected entangled pair state algorithm for quantum systems

李生好 LI Sheng-hao, Xiaobing Wu, Huang Chong-Fu +1 more

In the numerical calculation, the projected entangled pair state (PEPS) algorithm is the most important tensor network algorithm for two-dimensional strongly correlated electron quantum lattice system. In this paper, the optimization of PEPS for two-dimensional quantum system is discussed. An optimization connection between how to update the PEPS tensor and how to calculate the physical observable is investigated, for the tensor network algorithm based on the PEPS representation, which can greatly improve the utilization of computing resources. In this case, optimized PEPS algorithm, as a powerful tool, can be used to study quantum phase transitions and quantum critical phenomena in the thermodynamic limit of the two-dimensional strongly correlated electron quantum lattice system. Of course, optimization of PEPS algorithm program has many other applications, such as adding U(1) and SO(2) symmetry in PEPS algorithm, etc.

Acta Physica Sinica•Jan 1, 2014•1 citation
We adapt and optimize the projected-pair-entangled-state (PEPS) algorithm on finite lattices (fPEPS) for two-dimensional Hubbard models and apply the algorithm to the Hubbard model with nearest-neighbor hopping on a square lattice. In particular, we formulate the PEPS algorithm using projected entangled pair operators, incorporate SU(2) symmetry in all tensor indices, and optimize the PEPS using both iterative-diagonalization-based local bond optimization and gradient-based optimization of the PEPS. We discuss the performance and convergence of the algorithm for the Hubbard model on lattice sizes of up to 8\ifmmode×\else\texttimes\fi88\ifmmode\times\else\texttimes\fi{}88\ifmmode×\else\texttimes\fi8 for PEPS states with U(1) symmetric bond dimensions of up to D=8D=8D=8 and SU(2) symmetric bond dimensions of up to D=6D=6D=6. Finally, we comment on the relative and overall efficiency of schemes for optimizing fPEPS.
We present an improved version of the algorithm contracting and optimizing finite projected entangled pair states (fPEPS) in conjunction with projected entangled pair operators (PEPOs). Our work has two components to it. First, we explain in detail the characteristic contraction patterns that occur in fPEPS calculations and how to slice them such that peak memory occupation remains minimal while ensuring efficient parallel computation. Second, we combine controlled bond expansion [A. Gleis, J.-W. Li, and J. von Delft, ] with randomized singular value decomposition [V. Rokhlin, A. Szlam, and M. Tygert, ] and apply it throughout the fPEPS algorithm. We present benchmark results for the Hubbard model for system sizes up to 8 × 8 and SU(2) symmetric bond dimension of up to D = 6 for PEPS bonds and χ = 500 for the environment bonds. Finally, we comment on the state and future of the fPEPS-PEPO framework.
We demonstrate the use of finite-size fermionic projected entangled pair states, in conjunction with variational Monte Carlo, to perform accurate simulations of the ground state of the 2D Hubbard model. Using bond dimensions of up to D=28, we show that we can surpass state-of-the-art density matrix renormalization group energies that use up to m=32 000 SU(2) multiplets on eight-leg ladders. We further apply our methodology to 10×16, 12×16, and 16×16 lattices at 1/8 hole doping and observe the dimensional crossover between stripe orientations. Our Letter shows the power of finite-size fermionic tensor networks to resolve the physics of the 2D Hubbard model and related problems.
The recently developed stochastic gradient method combined with Monte Carlo sampling techniques [W. Y. Liu et al., Phys. Rev. B 95, 195154 (2017)] offers a low scaling and accurate method to optimize the projected entangled pair states (PEPS). We extended this method to the fermionic PEPS (fPEPS). To simplify the implementation, we introduce a Fermi arrow notation to specify the order of the fermion operators in the virtual entangled EPR pairs. By defining some local operation rules associated with the Fermi arrows, one can implement fPEPS algorithms very similar to that of standard PEPS. We benchmark the method for the interacting spinless fermion models and the $t\text{\ensuremath{-}}J$ models. The numerical calculations show that the gradient optimization greatly improves the results of simple update method. Furthermore, very large virtual bond dimensions (DDD) and truncation dimensions (Dc{D}_{c}Dc​) are necessary to converge the results of these models. The method therefore offers a powerful tool to simulate fermion systems because it has much lower scaling than the direct contraction methods.
Projected entangled pair states (PEPS) methods have been proven to be powerful tools to solve strongly correlated quantum many-body problems in two dimensions. However, due to the high computational scaling with the virtual bond dimension DDD, in a practical application, PEPS are often limited to rather small bond dimensions, which may not be large enough for some highly entangled systems, for instance, frustrated systems. Optimization of the ground state using the imaginary time evolution method with a simple update scheme may go to a larger bond dimension. However, the accuracy of the rough approximation to the environment of the local tensors is questionable. Here, we demonstrate that by combining the imaginary time evolution method with a simple update, Monte Carlo sampling techniques and gradient optimization will offer an efficient method to calculate the PEPS ground state. By taking advantage of massive parallel computing, we can study quantum systems with larger bond dimensions up to D=10D=10D=10 without resorting to any symmetry. Benchmark tests of the method on the ${J}_{1}\ensuremath{-}{J}_{2}$ model give impressive accuracy compared with exact results.
We present a general graph-based projected entangled-pair state (gPEPS) algorithm to approximate ground states of nearest-neighbor local Hamiltonians on any lattice or graph of infinite size. By introducing the structural matrix, which codifies the details of tensor networks on any graphs in any dimension ddd, we are able to produce a code that can be essentially launched to simulate any lattice. We further introduce an optimized algorithm to compute simple tensor updates as well as expectation values and correlators with a mean-field-like effective environments. Though not being variational, this strategy allows to cope with PEPS of very large bond dimension (e.g., D=100D=100D=100) and produces remarkably accurate results in the thermodynamic limit in many situations, and specially when the correlation length is small and the connectivity of the lattice is large. We prove the validity of our approach by benchmarking the algorithm against known results for several models, i.e., the antiferromagnetic Heisenberg model on a chain, star and cubic lattices, the hardcore Bose-Hubbard model on square lattice, the ferromagnetic Heisenberg model in a field on the pyrochlore lattice, as well as the three-state quantum Potts model in field on the kagome lattice and the spin-1 bilinear-biquadratic Heisenberg model on the triangular lattice. We further demonstrate the performance of gPEPS by studying the quantum phase transition of the 2d2d2d quantum Ising model in transverse magnetic field on the square lattice, and the phase diagram of the Kitaev-Heisenberg model on the hyperhoneycomb lattice. Our results are in excellent agreement with previous studies.
In the numerical calculation, the projected entangled pair state (PEPS) algorithm is the most important tensor network algorithm for two-dimensional strongly correlated electron quantum lattice system. In this paper, the optimization of PEPS for two-dimensional quantum system is discussed. An optimization connection between how to update the PEPS tensor and how to calculate the physical observable is investigated, for the tensor network algorithm based on the PEPS representation, which can greatly improve the utilization of computing resources. In this case, optimized PEPS algorithm, as a powerful tool, can be used to study quantum phase transitions and quantum critical phenomena in the thermodynamic limit of the two-dimensional strongly correlated electron quantum lattice system. Of course, optimization of PEPS algorithm program has many other applications, such as adding U(1) and SO(2) symmetry in PEPS algorithm, etc.