Universal tensor-network algorithm for any infinite lattice
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Density-matrix algorithms for quantum renormalization groups
White, S. R. (1993) · Physical Review B · doi:10.1103/physrevb.48.10345 · Cited by 3,244
Efficient Classical Simulation of Slightly Entangled Quantum Computations
Vidal, G. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.147902 · Cited by 2,368
Orús, R. (2014) · Annals of Physics · doi:10.1016/j.aop.2014.06.013 · Cited by 2,255
Self-citationEfficient Simulation of One-Dimensional Quantum Many-Body Systems
Vidal, G. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040502 · Cited by 1,779
Finitely correlated states on quantum spin chains
Fannes, M., Nachtergaele, B., & Werner, R. F. (1992) · Communications in Mathematical Physics · doi:10.1007/bf02099178 · Cited by 1,422
Thermodynamic limit of density matrix renormalization.
Östlund, S., & Rommer, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.3537 · Cited by 1,077
Classical Simulation of Infinite-Size Quantum Lattice Systems in Two Spatial Dimensions
Jordan, J., Orús, R., Vidal, G., Verstraete, F., & Cirac, J. I. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.250602 · Cited by 710
Self-citationCriticality, the Area Law, and the Computational Power of Projected Entangled Pair States
Verstraete, F., Wolf, M. M., Perez-Garcia, D., & Cirac, J. I. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.220601 · Cited by 580
Orús, R., & Vidal, G. (2009) · Physical Review B · doi:10.1103/physrevb.80.094403 · Cited by 387
Self-citationInfinite projected entangled pair states algorithm improved: Fast full update and gauge fixing
Phien, H. N., Bengua, J. A., Tuan, H. D., Corboz, P., & Orús, R. (2015) · Physical Review B · doi:10.1103/physrevb.92.035142 · Cited by 227
Self-citation
Cited by
Tensor networks for complex quantum systems
Orús, R. (2019) · Nature Reviews Physics · doi:10.1038/s42254-019-0086-7 · Cited by 569
Self-citationTensor Network Contractions: Methods and Applications to Quantum Many-Body Systems
Ran, S.-J., Tirrito, E., Peng, C., Chen, X., Tagliacozzo, L., Su, G., & Lewenstein, M. (2020) · Lecture Notes in Physics · doi:10.1007/978-3-030-34489-4 · Cited by 176
Efficient Tensor Network Simulation of IBM’s Eagle Kicked Ising Experiment
Tindall, J., Fishman, M., Stoudenmire, E. M., & Sels, D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010308 · Cited by 152
Efficient tensor network simulation of IBM's largest quantum processors
Patra, S., Jahromi, S. S., Singh, S., & Orús, R. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013326 · Cited by 63
Self-citationSimulation of three-dimensional quantum systems with projected entangled-pair states
Vlaar, P. C. G., & Corboz, P. (2021) · Physical Review B · doi:10.1103/physrevb.103.205137 · Cited by 38
Metadata
- Authors
- Jahromi, S. S., & Orús, R.
- Venue
- Physical Review B
- Publisher
- American Physical Society (APS)
- Published
- 2019-05-03
- Volume
- 99
- Issue
- 19
- ISSN
- 2469-9950 (ISSN-L)
- 2469-9969
- OpenAlex
- W2886542049
- Cited by
- 38
- References
- 10
- FWCI
- 1.89
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Universal tensor-network algorithm for any infinite lattice. https://app.cochat.ai/papers/10.1103/physrevb.99.195105
- The paper
- Jahromi, S. S., & Orús, R. (2019). Universal tensor-network algorithm for any infinite lattice. Physical Review B. https://doi.org/10.1103/physrevb.99.195105
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.