Emergence of typical entanglement in two-party random processes

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 $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 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