A simple tensor network algorithm for two-dimensional steady states
Open accessThe DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
Understanding dissipation in 2D quantum many-body systems is an open challenge which has proven remarkably difficult. Here we show how numerical simulations for this problem are possible by means of a tensor network algorithm that approximates steady states of 2D quantum lattice dissipative systems in the thermodynamic limit. Our method is based on the intuition that strong dissipation kills quantum entanglement before it gets too large to handle. We test its validity by simulating a dissipative quantum Ising model, relevant for dissipative systems of interacting Rydberg atoms, and benchmark our simulations with a variational algorithm based on product and correlated states. Our results support the existence of a first order transition in this model, with no bistable region. We also simulate a dissipative spin 1/2 XYZ model, showing that there is no re-entrance of the ferromagnetic phase. Our method enables the computation of steady states in 2D quantum lattice systems.
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 formulation for quantum renormalization groups
White, S. R. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2863 · Cited by 7,702
The density-matrix renormalization group in the age of matrix product states
Schollwöck, U. (2011) · Annals of Physics · doi:10.1016/j.aop.2010.09.012 · Cited by 4,818
The density-matrix renormalization group
Schollwöck, U. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.259 · Cited by 3,323
Density-matrix algorithms for quantum renormalization groups
White, S. R. (1993) · Physical Review B · doi:10.1103/physrevb.48.10345 · Cited by 3,244
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 · cited 2×
“8 Supplementary Note 1: Projected Entangled-Pair Operators Projected Entangled-Pair Operators (PEPO) are simply the operator version of Projected Entangled-Pair States (PEPS), in the same way that Matrix Product Operator (MPO) are the operator version of Matrix Product States (MPS) for the 1D case [1–5].”
Decoherence, the measurement problem, and interpretations of quantum mechanics
Schlosshauer, M. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.76.1267 · Cited by 1,443
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-citationOrús, R., & Vidal, G. (2009) · Physical Review B · doi:10.1103/physrevb.80.094403 · Cited by 387
Self-citationVariational optimization with infinite projected entangled-pair states
Corboz, P. (2016) · Physical Review B · doi:10.1103/physrevb.94.035133 · Cited by 234
Cited by
Spectral theory of Liouvillians for dissipative phase transitions
Minganti, F., Biella, A., Bartolo, N., & Ciuti, C. (2018) · Physical Review A · doi:10.1103/physreva.98.042118 · Cited by 408
Neural-Network Approach to Dissipative Quantum Many-Body Dynamics
Hartmann, M. J., & Carleo, G. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.250502 · Cited by 263
Begušić, T., Gray, J., & Chan, G. K.-L. (2024) · Science Advances · doi:10.1126/sciadv.adk4321 · Cited by 89
“The first is equivalent to methods already demonstrated for wavefunctions (27, 31, 32) and operators (41) but with an efficient ‘lazy’ implementation that allows us to globally compress large and complex tensor networks.”
Variational quantum algorithm for nonequilibrium steady states
Yoshioka, N., Nakagawa, Y. O., Mitarai, K., & Fujii, K. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043289 · Cited by 54
“[29] Augustine Kshetrimayum, Hendrik Weimer, and Román Orús, “A simple tensor network algorithm for twodimensional steady states,” Nat.”
BackgroundTime evolution of an infinite projected entangled pair state: Neighborhood tensor update
Dziarmaga, J. (2021) · Physical Review B · doi:10.1103/physrevb.104.094411 · Cited by 38
Metadata
- Authors
- Kshetrimayum, A., Weimer, H., & Orús, R.
- Venue
- Nature Communications
- Published
- 2017-11-03
- Volume
- 8
- Issue
- 1
- Pages
- 1291-1291
- ISSN
- 2041-1723 (ISSN-L)
- OpenAlex
- W2752675930
- Cited by
- 133
- References
- 13
- FWCI
- 6.61
- Type
- journal article
- Language
- en
- Open access
- gold
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: A simple tensor network algorithm for two-dimensional steady states. https://app.cochat.ai/papers/10.1038/s41467-017-01511-6
- The paper
- Kshetrimayum, A., Weimer, H., & Orús, R. (2017). A simple tensor network algorithm for two-dimensional steady states. Nature Communications. https://doi.org/10.1038/s41467-017-01511-6
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.