Finite automata for caching in matrix product algorithms
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
A diagram is introduced for visualizing matrix product states which makes transparent a connection between matrix product factorizations of states and operators, and complex weighted finite state automata. It is then shown how one can proceed in the opposite direction: writing an automaton that ``generates'' an operator gives one an immediate matrix product factorization of it. Matrix product factorizations have the advantage of reducing the cost of computing expectation values by facilitating caching of intermediate calculations. Thus our connection to complex weighted finite state automata yields insight into what allows for efficient caching in matrix product algorithms. Finally, these techniques are generalized to the case of multiple dimensions.
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 · cited 1×
“ly duplicate the properties of the original system, and it needs to allow one to compute expectation values without returning to the expensive representation. Matrix product states [10] [9] [15] [13] [11] have been popular in the last couple of decades because they exhibit all three properties: they grow linearly with…”
BackgroundFinitely 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
Matrix Product Density Operators: Simulation of Finite-Temperature and Dissipative Systems
Verstraete, F., García-Ripoll, J. J., & Cirac, J. I. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.207204 · Cited by 1,098
Thermodynamic limit of density matrix renormalization.
Östlund, S., & Rommer, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.3537 · Cited by 1,077
Matrix product states represent ground states faithfully
Verstraete, F., & Cirac, J. I. (2006) · Physical Review B · doi:10.1103/physrevb.73.094423 · Cited by 730
The Complexity of the Local Hamiltonian Problem
Kempe, J., Kitaev, A., & Regev, O. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704445226 · Cited by 648
Criticality, 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
Matrix product operator representations
Pirvu, B., Murg, V, Cirac, J. I., & Verstraete, F. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/2/025012 · Cited by 374
Computational complexity of projected entangled pair states
Schuch, N., Wolf, M. M., Verstraete, F., & Cirac, J. I. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.140506 · Cited by 313
Cited by
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
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
Time-evolution methods for matrix-product states
Paeckel, S., Köhler, T., Swoboda, A., Manmana, S. R., Schollwöck, U., & Hubig, C. (2019) · Annals of Physics · doi:10.1016/j.aop.2019.167998 · Cited by 768
“This picture directly leads to a construction of MPOs based on finite-state machines (FSM) [43, 45].”
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
Quantum many-body scars and Hilbert space fragmentation: a review of exact results
Moudgalya, S., Bernevig, B. A., & Regnault, N. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac73a0 · Cited by 431
Metadata
- Authors
- Crosswhite, G. M., & Bacon, D.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2008-07-29
- Volume
- 78
- Issue
- 1
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2028187716
- Cited by
- 145
- References
- 9
- FWCI
- 1.16
- 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: Finite automata for caching in matrix product algorithms. https://app.cochat.ai/papers/10.1103/physreva.78.012356
- The paper
- Crosswhite, G. M., & Bacon, D. (2008). Finite automata for caching in matrix product algorithms. Physical Review A. https://doi.org/10.1103/physreva.78.012356
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.