Gauge fixing, canonical forms, and optimal truncations in tensor networks with closed loops
Open accessThe DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
We describe an approach to fix the gauge degrees of freedom in tensor networks, including those with closed loops, which allows a canonical form for arbitrary tensor networks to be realized. Additionally, a measure for the internal correlations present in a tensor network is proposed, which quantifies the extent of resonances around closed loops in the network. Finally we describe an algorithm for the optimal truncation of an internal index from a tensor network, based upon proper removal of the redundant internal correlations. These results, which offer a unified theoretical framework for the manipulation of tensor networks with closed loops, can be applied to improve existing tensor network methods for the study of many-body systems and may also constitute key algorithmic components of sophisticated new tensor methods.
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
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
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
Entanglement renormalization and holography
Swingle, B. (2012) · Physical Review D · doi:10.1103/physrevd.86.065007 · Cited by 915
The Density Matrix Renormalization Group in Quantum Chemistry
Chan, G. K.-L., & Sharma, S. (2011) · Annual Review of Physical Chemistry · doi:10.1146/annurev-physchem-032210-103338 · Cited by 822 · cited 1×
“Tensor network methods 1–3 have proven to be exceptionally useful in the study of quantum many-body sys-tem and, more recently, have also found a diverse range of applications in areas such as quantum chemistry 4,5 , machine learning 6–8 , and holography 9–12 .”
BackgroundTensor decompositions for learning latent variable models
(2012) · arXiv (Cornell University) · doi:10.5555/2627435.2697055 · Cited by 779
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
Holographic duality from random tensor networks
Hayden, P., Nezami, S., Qi, X.-L., Thomas, N., Walter, M., & Yang, Z. (2016) · Journal of High Energy Physics · doi:10.1007/jhep11(2016)009 · Cited by 599
Classical simulation of quantum many-body systems with a tree tensor network
Shi, Y.-Y., Duan, L.-M., & Vidal, G. (2006) · Physical Review A · doi:10.1103/physreva.74.022320 · Cited by 577
Tensor product methods and entanglement optimization for ab initio quantum chemistry
Szalay, S., Pfeffer, M., Murg, V., Barcza, G., Verstraete, F., Schneider, R., & Legeza, Ö. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24898 · Cited by 314
Tagliacozzo, L., Evenbly, G., & Vidal, G. (2009) · Physical Review B · doi:10.1103/physrevb.80.235127 · Cited by 261
Self-citationSimulating strongly correlated quantum systems with tree tensor networks
Murg, V., Verstraete, F., Legeza, Ö., & Noack, R. M. (2010) · Physical Review B · doi:10.1103/physrevb.82.205105 · Cited by 245
Nakatani, N., & Chan, G. K.-L. (2013) · The Journal of Chemical Physics · doi:10.1063/1.4798639 · Cited by 184
Constructing holographic spacetimes using entanglement renormalization
Swingle, B. (2012) · arXiv · doi:10.48550/arxiv.1209.3304 · Cited by 102
T3NS: Three-Legged Tree Tensor Network States
Gunst, K., Verstraete, F., Wouters, S., Legeza, O., & Van Neck, D. (2018) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.8b00098 · Cited by 64
Hyperinvariant Tensor Networks and Holography
Evenbly, G. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.141602 · Cited by 57
Self-citation
Cited by
Efficient numerical simulations with Tensor Networks: Tensor Network Python (TeNPy)
Hauschild, J., & Pollmann, F. (2018) · SciPost Physics Lecture Notes · doi:10.21468/scipostphyslectnotes.5 · Cited by 438
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
Beyond-classical computation in quantum simulation
King, A. D., Nocera, A., Rams, M. M., Dziarmaga, J., Wiersema, R., Bernoudy, W., Raymond, J., Kaushal, N., Heinsdorf, N., Harris, R., et al. (2025) · Science · doi:10.1126/science.ado6285 · Cited by 138
Parallel time-dependent variational principle algorithm for matrix product states
Secular, P., Gourianov, N., Lubasch, M., Dolgov, S., Clark, S. R., & Jaksch, D. (2020) · Physical Review B · doi:10.1103/physrevb.101.235123 · Cited by 40
Time 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
- Evenbly, G.
- Venue
- Physical Review B
- Publisher
- American Physical Society (APS)
- Published
- 2018-08-31
- Volume
- 98
- Issue
- 8
- ISSN
- 2469-9950 (ISSN-L)
- 2469-9969
- OpenAlex
- W2783751034
- Cited by
- 74
- References
- 17
- FWCI
- 4.56
- 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
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.