The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Tensor network decompositions in the presence of a global symmetry
Open accessAbstract
Tensor network decompositions offer an efficient description of certain many-body states of a lattice system and are the basis of a wealth of numerical simulation algorithms. We discuss how to incorporate a global symmetry, given by a compact, completely reducible group $\mathcal{G}$, in tensor network decompositions and algorithms. This is achieved by considering tensors that are invariant under the action of the group $\mathcal{G}$. Each symmetric tensor decomposes into two types of tensors: degeneracy tensors, containing all the degrees of freedom, and structural tensors, which only depend on the symmetry group. In numerical calculations, the use of symmetric tensors ensures the preservation of the symmetry, allows selection of a specific symmetry sector, and significantly reduces computational costs. On the other hand, the resulting tensor network can be interpreted as a superposition of exponentially many spin networks. Spin networks are used extensively in loop quantum gravity, where they represent states of quantum geometry. Our work highlights their importance in the context of tensor network algorithms as well, thus setting the stage for cross-fertilization between these two areas of research.
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
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
Vidal, G. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.220405 · Cited by 1,122
Self-citationThermodynamic limit of density matrix renormalization.
Östlund, S., & Rommer, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.3537 · Cited by 1,077
Class of Quantum Many-Body States That Can Be Efficiently Simulated
Vidal, G. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.110501 · Cited by 847
Self-citationSpin networks and quantum gravity
Rovelli, C., & Smolin, L. (1995) · Physical Review D · doi:10.1103/physrevd.52.5743 · Cited by 629
Cornwell, J. F. (1984) · Cited by 555
From density-matrix renormalization group to matrix product states
McCulloch, I. P. (2007) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2007/10/p10014 · Cited by 460
Rovelli, C. (2017) · The Frontiers Collection · doi:10.1007/978-3-319-55420-4_10 · Cited by 299
String Order and Symmetries in Quantum Spin Lattices
Pérez-García, D., Wolf, M. M., Sanz, M., Verstraete, F., & Cirac, J. I. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.167202 · Cited by 253
The non-Abelian density matrix renormalization group algorithm
McCulloch, I. P., & Gulácsi, M. (2002) · Europhysics Letters (EPL) · doi:10.1209/epl/i2002-00393-0 · Cited by 242
Evenbly, G., & Vidal, G. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.187203 · Cited by 204
Self-citationMatrix product states: Symmetries and two-body Hamiltonians
Sanz, M., Wolf, M. M., Pérez-García, D., & Cirac, J. I. (2009) · Physical Review A · doi:10.1103/physreva.79.042308 · Cited by 97
The density matrix renormalization group method applied to interaction round a face Hamiltonians
Sierra, G., & Nishino, T. (1997) · Nuclear Physics B · doi:10.1016/s0550-3213(97)00217-4 · Cited by 61
Simulation of one-dimensional quantum systems with a global SU(2) symmetry
Singh, S., Zhou, H.-Q., & Vidal, G. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/3/033029 · Cited by 61
Self-citationSimulation of anyons with tensor network algorithms
Pfeifer, R. N. C., Corboz, P., Buerschaper, O., Aguado, M., Troyer, M., & Vidal, G. (2010) · Physical Review B · doi:10.1103/physrevb.82.115126 · Cited by 59
Self-citation
Cited by
Orús, R. (2014) · Annals of Physics · doi:10.1016/j.aop.2014.06.013 · Cited by 2,255
The ITensor Software Library for Tensor Network Calculations
Fishman, M., White, S., & Stoudenmire, E. M. (2022) · SciPost Physics Codebases · doi:10.21468/scipostphyscodeb.4 · Cited by 1,084
Matrix product states and projected entangled pair states: Concepts, symmetries, theorems
Cirac, J. I., Pérez-García, D., Schuch, N., & Verstraete, F. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.045003 · Cited by 769
Simulating lattice gauge theories within quantum technologies
Bañuls, M. C., Blatt, R., Catani, J., Celi, A., Cirac, J. I., Dalmonte, M., Fallani, L., Jansen, K., Lewenstein, M., Montangero, S., et al. (2020) · The European Physical Journal D · doi:10.1140/epjd/e2020-100571-8 · Cited by 500
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
Metadata
- Authors
- Singh, S., Pfeifer, R. N. C., & Vidal, G.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2010-11-08
- Volume
- 82
- Issue
- 5
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2066014866
- Cited by
- 279
- References
- 16
- FWCI
- 6.03
- 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.