Connecting entanglement in time and space: Improving the folding algorithm
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
The ``folding algorithm'' [M. C. Ba\~nuls, M. B. Hastings, F. Verstraete, and J. I. Cirac, Phys. Rev. Lett. 102, 240603 (2009)] is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the temporal entanglement. We show that this temporal entanglement is, in many cases, equal to the spatial entanglement of a modified Hamiltonian. This inspires a modification to the folding algorithm, which we call the ``hybrid algorithm.'' We find that this leads to improved accuracy for the same numerical effort. We then use these algorithms to study relaxation in a transverse plus parallel field Ising model, finding persistent quasiperiodic oscillations for certain choices of initial conditions.
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 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
Entanglement Entropy and Quantum Field Theory
Calabrese, P., & Cardy, J. (2004) · arXiv · doi:10.48550/arxiv.hep-th/0405152 · Cited by 3,275
Entanglement entropy and quantum field theory
Calabrese, P., & Cardy, J. (2004) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2004/06/p06002 · Cited by 3,275
Density-matrix algorithms for quantum renormalization groups
White, S. R. (1993) · Physical Review B · doi:10.1103/physrevb.48.10345 · Cited by 3,244
Chaos and quantum thermalization
Srednicki, M. (1994) · Physical Review E · doi:10.1103/physreve.50.888 · Cited by 3,175
Quantum statistical mechanics in a closed system
Deutsch, J. M. (1991) · Physical Review A · doi:10.1103/physreva.43.2046 · Cited by 2,860
Efficient Classical Simulation of Slightly Entangled Quantum Computations
Vidal, G. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.147902 · Cited by 2,368
Efficient Simulation of One-Dimensional Quantum Many-Body Systems
Vidal, G. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040502 · Cited by 1,779
Time Dependence of Correlation Functions Following a Quantum Quench
Calabrese, P., & Cardy, J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.136801 · Cited by 1,190
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
Cited by
Tensor 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
Particle-time duality in the kicked Ising spin chain
Akila, M., Waltner, D., Gutkin, B., & Guhr, T. (2016) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/49/37/375101 · Cited by 124
Osborne, J. J., & McCulloch, I. P. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.023018 · Cited by 3
Metadata
- Authors
- Hastings, M. B., & Mahajan, R.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2015-03-12
- Volume
- 91
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2081113208
- Cited by
- 61
- References
- 10
- FWCI
- 0.51
- 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.