The emergence of typical entanglement in two-party random processes
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
We investigate the entanglement within a system undergoing a random, local process. We find that there is initially a phase of very fast generation and spread of entanglement. At the end of this phase the entanglement is typically maximal. In Oliveira et al (2007 Phys. Rev. Lett. 98 130502) we proved that the maximal entanglement is reached to a fixed arbitrary accuracy within O ( N 3 ) steps, where N is the total number of qubits. Here we provide a detailed and more pedagogical proof. We demonstrate that one can use the so-called stabilizer gates to simulate this process efficiently on a classical computer. Furthermore, we discuss three ways of identifying the transition from the phase of rapid spread of entanglement to the stationary phase: (i) the time when saturation of the maximal entanglement is achieved, (ii) the cutoff moment, when the entanglement probability distribution is practically stationary, and (iii) the moment block entanglement exhibits volume scaling. We furthermore investigate the mixed state and multipartite setting. Numerically, we find that the mutual information appears to behave similarly to the quantum correlations and that there is a well-behaved phase-space flow of entanglement properties towards an equilibrium. We describe how the emergence of typical entanglement can be used to create a much simpler tripartite entanglement description. The results form a bridge between certain abstract results concerning typical (also known as generic) entanglement relative to an unbiased distribution on pure states and the more physical picture of distributions emerging from random local interactions.
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
Average Entropy of a Subsystem
Page, D. N. (1993) · arXiv · doi:10.48550/arxiv.gr-qc/9305007 · Cited by 1,578
Average entropy of a subsystem
Page, D. N. (1993) · Physical Review Letters · doi:10.1103/physrevlett.71.1291 · Cited by 1,578 · cited 1×
“Some of the first studies of this were [17, 18], and the explicit solution for the average entropy of entanglement (Page’s conjecture) was conjectured in [19] and proven in [20].”
BackgroundLogarithmic Negativity: A Full Entanglement Monotone That is not Convex
Plenio, M. B. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.090503 · Cited by 1,530
Self-citationGroup representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
An introduction to entanglement measures
Plenio, M. B., & Virmani, S. (2007) · Quantum Information and Computation · doi:10.26421/qic7.1-2-1 · Cited by 756 · cited 4×
“For entanglement measures based on average purities [2] this is possible with the results established here.”
BackgroundInfluentialSelf-citationStabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
Scalable noise estimation with random unitary operators
Emerson, J., Alicki, R., & Życzkowski, K. (2005) · Journal of Optics B: Quantum and Semiclassical Optics · doi:10.1088/1464-4266/7/10/021 · Cited by 502
Evenly distributed unitaries: On the structure of unitary designs
Gross, D., Audenaert, K., & Eisert, J. (2007) · Journal of Mathematical Physics · doi:10.1063/1.2716992 · Cited by 358 · cited 1×
“6 An alternative manner of explaining why the asymptotic time average of the purity is the same, whether using the stabilizer circuit or the general state circuit, is the concept of 2-designs; see [36, 37].”
Background
Cited by
Operator Spreading in Random Unitary Circuits
Nahum, A., Vijay, S., & Haah, J. (2018) · Physical Review X · doi:10.1103/physrevx.8.021014 · Cited by 738
Measurement-Induced Phase Transitions in the Dynamics of Entanglement
Skinner, B., Ruhman, J., & Nahum, A. (2019) · Physical Review X · doi:10.1103/physrevx.9.031009 · Cited by 736
Quantum Entanglement Growth under Random Unitary Dynamics
Nahum, A., Ruhman, J., Vijay, S., & Haah, J. (2017) · Physical Review X · doi:10.1103/physrevx.7.031016 · Cited by 680
Fisher, M. P. A., Khemani, V., Nahum, A., & Vijay, S. (2023) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-031720-030658 · Cited by 456
Local Random Quantum Circuits are Approximate Polynomial-Designs
Brandão, F. G. S. L., Harrow, A. W., & Horodecki, M. (2016) · Communications in Mathematical Physics · doi:10.1007/s00220-016-2706-8 · Cited by 404
Metadata
- Authors
- Dahlsten, O. C. O., Oliveira, R., & Plenio, M. B.
- Venue
- Journal of Physics A: Mathematical and Theoretical
- Publisher
- IOP Publishing
- Published
- 2007-06-27
- Volume
- 40
- Issue
- 28
- Pages
- 8081-8108
- ISSN
- 1751-8113 (ISSN-L)
- 1751-8121
- OpenAlex
- W1969363245
- Cited by
- 71
- References
- 8
- FWCI
- 3.87
- Type
- journal article
- Language
- en
- Open access
- bronze
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: The emergence of typical entanglement in two-party random processes. https://app.cochat.ai/papers/10.1088/1751-8113/40/28/s16
- The paper
- Dahlsten, O. C. O., Oliveira, R., & Plenio, M. B. (2007). The emergence of typical entanglement in two-party random processes. Journal of Physics A: Mathematical and Theoretical. https://doi.org/10.1088/1751-8113/40/28/s16
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.