Projected Entangled Pair States with flexible geometry
arXiv:2407.21140 · doi:10.1103/PhysRevResearch.7.L012002
Abstract
Projected Entangled Pair States (PEPS) are a class of quantum many-body states that generalize Matrix Product States for one-dimensional systems to higher dimensions. In recent years, PEPS have advanced understanding of strongly correlated systems, especially in two dimensions, e.g., quantum spin liquids. Typically described by tensor networks on regular lattices (e.g., square, cubic), PEPS have also been adapted for irregular graphs, however, the computational cost becomes prohibitive for dense graphs with large vertex degrees. In this paper, we present a PEPS algorithm to simulate low-energy states and dynamics defined on arbitrary, fluctuating, and densely connected graphs. We introduce a cut-off, , to constrain the vertex degree of the PEPS to a set but tunable value, which is enforced in the optimization by applying a simple edge-deletion rule, allowing the geometry of the PEPS to change and adapt dynamically to the system's correlation structure. We benchmark our flexible PEPS algorithm with simulations of classical spin glasses and quantum annealing on densely connected graphs with hundreds of spins, and also study the impact of tuning when simulating a uniform quantum spin model on a regular (square) lattice. Our work opens the way to apply tensor network algorithms to arbitrary, even fluctuating, background geometries.
4 pages (main text), 7 pages (appendix), 15 figures
References in corpus (16)
- Ising formulations of many NP problems
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
- Classifying quantum phases using Matrix Product States and PEPS
- Accurate determination of tensor network state of quantum lattice models in two dimensions
- Minimally Entangled Typical Thermal State Algorithms
- Tensor product methods and entanglement optimization for ab initio quantum chemistry
- Algorithms for finite Projected Entangled Pair States
- Topological and Entanglement Properties of Resonating Valence Bond wavefunctions
- Perfect Sampling with Unitary Tensor Networks
- Topological order in PEPS: Transfer operator and boundary Hamiltonians
- Unifying Projected Entangled Pair States contractions
- Strong Disorder RG approach - a short review of recent developments
- Efficient tensor network simulation of IBM's largest quantum processors
- A universal tensor network algorithm for any infinite lattice
- Strong disorder renormalization group primer and the superfluid-insulator transition
Cited by in corpus (5)
- Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization
- Fermionic tensor network contraction for arbitrary geometries
- Schwinger-Keldysh non-perturbative field theory of open quantum systems beyond the Markovian regime: Application to spin-boson and spin-chain-boson models
- Improving accuracy of tree-tensor network approach by optimization of network structure
- Variational matrix product states for combinatorial optimization