Finite Projected Entangled Pair States for the Hubbard model

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 8x8 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.

References in corpus (14)

• Matrix Product Density Operators: Simulation of finite-T and dissipative systems
• Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
• Area laws in quantum systems: mutual information and correlations
• Criticality, the area law, and the computational power of PEPS
• Accurate determination of tensor network state of quantum lattice models in two dimensions
• Tensor network states and algorithms in the presence of a global U(1) symmetry
• Algorithms for finite Projected Entangled Pair States
• Applying matrix product operators to model systems with long-range interactions
• Finite automata for caching in matrix product algorithms
• Implementing global Abelian symmetries in projected entangled-pair state algorithms
• Simulation of fermionic lattice models in two dimensions with Projected Entangled-Pair States: Next-nearest neighbor Hamiltonians
• Hybrid-space density matrix renormalization group study of the doped two-dimensional Hubbard model
• Time evolution of projected entangled pair states in the single layer picture
• Automated construction of $U(1)$-invariant matrix-product operators from graph representations