Entanglement growth and simulation efficiency in one-dimensional quantum lattice systems
Open accessAbstract
We study the evolution of one-dimensional quantum lattice systems when the ground state is perturbed by altering one site in the middle of the chain. For a large class of models, we observe a similar pattern of entanglement growth during the evolution, characterized by a moderate increase of significant Schmidt coefficients in all relevant bipartite decompositions of the state. As a result, the evolution can be accurately described by a matrix product state and efficiently simulated using the time-evolving block decimation algorithm.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
At criticality, the von Neumann entropy of a subregion of size l scales as c/6 log(L/π sin(lπ/L)) + A.
“At criticality, this entropy scales as c/ 6 log( L/π sin( lπ/L ))+ A [188-190].”
From Can one trust quantum simulators? (2012) · cites this paper as [188]
For systems with open boundary conditions, a fit to c/6 log(L/π sin(lπ/L))+A (excluding small l) yields the effective central charge c.
“For systems with open boundary conditions, a fit to c/ 6 log( L/π sin( lπ/L ))+ A (excluding small values of l ) yields the effective central charge c [188-190].”
From Can one trust quantum simulators? (2012) · cites this paper as [188]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 22 · Cited by 49
- Authors
- Perales, Á., & Vidal, G.
- Affiliations
- The University of Queensland (AU)
- ORCID
- Vidal, Guifré
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2008-10-31
- Volume
- 78
- Issue
- 4
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1973670987
- Cited by
- 49
- References
- 22
- Citations by year
- 2025: 2 · 2023: 4 · 2022: 2 · 2021: 3 · 2020: 1 · 2019: 9 · 2018: 10 · 2014: 4 · 2013: 1 · 2012: 1
- FWCI
- 2.32
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- University of Queensland
- Ministerio de Economía y Competitividad
- Universidad de Alcalá
- Australian Research Council
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Keywords
- entanglement growth, Schmidt coefficients, bipartite entanglement, matrix product states, time-evolving block decimation, quantum dynamics
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
