Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Letter
  • Open Access

Projected entangled pair states with flexible geometry

Siddhartha Patra1,2, Sukhbinder Singh3, and Román Orús1,2,4

Phys. Rev. Research 7, L012002 – Published 6 January, 2025

DOI: https://doi.org/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, κ∈N, 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 paper opens the way to apply tensor network algorithms to arbitrary, even fluctuating, background geometries.

View figure in article

Physics Subject Headings (PhySH)

Article Text

Supplemental Material

References (30)

  1. R. Orús, A practical introduction to tensor networks: Matrix product states and projected entangled pair states, Ann. Phys. (NY) 349, 117 (2014).
  2. J. I. Cirac, D. Pérez-García, N. Schuch, and F. Verstraete, Matrix product states and projected entangled pair states: Concepts, symmetries, theorems, Rev. Mod. Phys. 93, 045003 (2021).
  3. M. Fannes, B. Nachtergaele, and R. F. Werner, Finitely correlated states on quantum spin chains, Commun. Math. Phys. 144, 443 (1992).
  4. F. Verstraete and J. I. Cirac, Renormalization algorithms for quantum-many body systems in two and higher dimensions, arXiv:cond-mat/0407066.
  5. S. S. Jahromi and R. Orús, Universal tensor-network algorithm for any infinite lattice, Phys. Rev. B 99, 195105 (2019).
  6. N. Schuch, D. Pérez-García, and I. Cirac, Classifying quantum phases using matrix product states and projected entangled pair states, Phys. Rev. B 84, 165139 (2011).
  7. N. Schuch, D. Poilblanc, J. I. Cirac, and D. Pérez-García, Topological order in the projected entangled-pair states formalism: Transfer operator and boundary Hamiltonians, Phys. Rev. Lett. 111, 090501 (2013).
  8. D. Poilblanc, N. Schuch, D. Pérez-García, and J. I. Cirac, Topological and entanglement properties of resonating valence bond wave functions, Phys. Rev. B 86, 014404 (2012).
  9. J. L. van Hemmen, Classical spin-glass model, Phys. Rev. Lett. 49, 409 (1982).
  10. K. Binder and A. P. Young, Spin glasses: Experimental facts, theoretical concepts, and open questions, Rev. Mod. Phys. 58, 801 (1986).
  11. M. Mezard, G. Parisi, and M. Virasoro, Spin Glass Theory And Beyond: An Introduction To The Replica Method And Its Applications, World Scientific Lecture Notes in Physics (World Scientific, Singapore, 1987).
  12. A. Lucas, Ising formulations of many np problems, Front. Phys. 2, 5 (2014).
  13. S. Sachdev and J. Ye, Gapless spin-fluid ground state in a random quantum Heisenberg magnet, Phys. Rev. Lett. 70, 3339 (1993).
  14. A. Kitaev, A simple model of quantum holography, Talks at KITP, April 7, 2015 and May 27, 2015; available at https://online.kitp.ucsb.edu/online/entangled15/kitaev/.
  15. G. K.-L. Chan, Quantum chemistry, classical heuristics, and quantum advantage, Faraday Discuss. 254, 11 (2024).
  16. S. Szalay, M. Pfeffer, V. Murg, G. Barcza, F. Verstraete, R. Schneider, and O. Legeza, Tensor product methods and entanglement optimization for ab initio quantum chemistry, Int. J. Quantum Chem. 115, 1342 (2015),.
  17. S. Patra, S. S. Jahromi, S. Singh, and R. Orús, Efficient tensor network simulation of IBM's largest quantum processors, Phys. Rev. Res. 6, 013326 (2024).
  18. H. C. Jiang, Z. Y. Weng, and T. Xiang, Accurate determination of tensor network state of quantum lattice models in two dimensions, Phys. Rev. Lett. 101, 090603 (2008).
  19. M. Lubasch, J. I. Cirac, and M.-C. Bañuls, Algorithms for finite projected entangled pair states, Phys. Rev. B 90, 064425 (2014).
  20. M. Lubasch, J. I. Cirac, and M.-C. Bañuls, Unifying projected entangled pair state contractions, New J. Phys. 16, 033014 (2014).
  21. See Supplemental Material at http://link.aps.org/supplemental/10.1103/PhysRevResearch.7.L012002 for (i) brief review of peps algorithms (simple, cluster, and full updates and computing expectation values), (ii) sampling from the flexible peps, (iii) details of the peps simulations for qubo problems, and (iv) critical peps geometries from the simulation of the uniform 2D quantum Ising model (v) flexible mps.
  22. For concreteness, we focus on PEPS time-evolution algorithms to approximate the low-energy states and dynamics of the system, but our flexible PEPS updates can also be incorporated in PEPS-based variational algorithms.
  23. Consider a graph with six nodes numbered 0,1,...,5, and edges: [(0,1), (1,2), (2,3), (3,4), (4,5), (0,3), (2,4), (3,5)]. We can group these edges into four layers of nonintersecting edges: Layer1 = [(0,1), (2,3), (4,5)], Layer2 = [(1,2), (3,4)], Layer3 = [(0,3), (2,4)], Layer4 = [(3,5)]. Note that for several problems studied in this paper we also tested the straightforward gate sequence (0,1),(0,2)...(1,2),(1,3)... with with a small trotter step =0.01. Surprisingly, we obtained comparable results despite incurring an uncontrolled trotter error.
  24. We also tried a slightly different edge-deletion strategy. If the new bond resulting from the current gate update has bond entanglement in the lowest 30% then we remove that bond. Otherwise, we remove the bond with the least bond entanglement entropy. This strategy worked better for some models.
  25. F. Barahona, On the computational complexity of Ising spin glass models, J. Phys. A: Math. Gen. 15, 3241 (1982).
  26. E. M. Stoudenmire and S. R. White, Minimally entangled typical thermal state algorithms, New J. Phys. 12, 055026 (2010).
  27. A. J. Ferris and G. Vidal, Perfect sampling with unitary tensor networks, Phys. Rev. B 85, 165146 (2012).
  28. F. Furini, E. Traversi, P. Belotti, A. Frangioni, A. M. Gleixner, N. Gould, L. Liberti, A. Lodi, R. Misener, H. D. Mittelmann et al., QPLIB: A library of quadratic programming instances, Math. Prog. Comp. 11, 237 (2019).
  29. G. Refael and E. Altman, Strong disorder renormalization group primer and the superfluid–insulator transition, C. R. Phys. 14, 725 (2013).
  30. F. Iglói and C. Monthus, Strong disorder RG approach—A short review of recent developments, Eur. Phys. J. B 91, 290 (2018).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation