Measurement-Induced Entanglement and Complexity in Random Constant-Depth 2D Quantum Circuits

We analyze the entanglement structure of states generated by random constant-depth two-dimensional quantum circuits, followed by projective measurements of a subset of sites. By deriving a rigorous lower bound on the average entanglement entropy of such postmeasurement states, we prove that macroscopic long-ranged entanglement is generated above some constant critical depth in several natural classes of circuit architectures, which include brickwork circuits and random holographic tensor networks. This behavior had been conjectured based on previous works, which utilize nonrigorous methods such as replica theory calculations, or work in regimes where the local Hilbert space dimension grows with system size. To establish our lower bound, we develop new replica-free theoretical techniques that leverage tools from multiuser quantum information theory, which are of independent interest, allowing us to map the problem onto a statistical mechanics model of self-avoiding walks without requiring large local Hilbert space dimension. Our findings have consequences for the complexity of classically simulating sampling from random shallow circuits and of contracting tensor networks. First, we show that standard algorithms based on matrix product states which are used for both these tasks will fail above some constant depth and bond dimension, respectively. In addition, we also prove that these random constant-depth quantum circuits cannot be simulated by any classical circuit of sublogarithmic depth.