The emergence of typical entanglement in two-party random processes
From MaRDI portal
(Redirected from Publication:5296087)
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 previous work we proved that the maximal entanglement is reached to a fixed arbitrary accuracy within steps, where 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 cut-off moment, when the entanglement probability distribution is practically stationary, and (iii) the moment block entanglement scales exhibits volume scaling. We furthermore investigate the mixed state and multipartite setting. Numerically we find that classical and quantum correlations appear to behave similarly 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.
Recommendations
Cited in
(18)- Random quantum circuits are approximate 2-designs
- Note on entropy dynamics in the Brownian SYK model
- Invariant measures on multimode quantum Gaussian states
- Entanglement formation under random interactions
- Entanglement generation of nearly random operators
- Local random quantum circuits are approximate polynomial-designs
- Propagation of correlations in local random quantum circuits
- Decoupling with unitary approximate two-designs
- Generating a state t-design by diagonal quantum circuits
- Comment on ``Random quantum circuits are approximate 2-designs by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257-302 (2009))
- Diagonal-unitary 2-design and their implementations by quantum circuits
- Average capacity of quantum entanglement
- Approximate unitary t-designs by short random quantum circuits using nearest-neighbor and long-range gates
- Random quantum circuits transform local noise into global white noise
- Fidelity decay and error accumulation in random quantum circuits
- Unifying typical entanglement and coin tossing: on randomization in probabilistic theories
- A random unitary circuit model for black hole evaporation
- On EPR-type entanglement in the experiments of Scully et al. II: Insight in the real random delayed-choice erasure experiment
This page was built for publication: The emergence of typical entanglement in two-party random processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5296087)