2026-10-22 · arXiv Quantum Physics
arXiv:2604.14277v2 Announce Type: replace
Abstract: We study the growth of entanglement and circuit complexity in random passive linear optical networks as a function of the circuit depth. For entanglement dynamics, we start with an initial Gaussian state with all $n$ modes equally squeezed. For random brickwork circuits, we show that entanglement, as measured by the R\'enyi-2 entropy, grows diffusively as a function of the depth, in contrast to the linear growth for random qubit brickwork circuits. In the other direction, for arbitrary circuit geometries we prove bounds on depths which ensure the average-case subsystem entanglement reaches within a constant factor of the maximum value in all subsystems, and bounds which ensure closeness of the random linear optical unitary to a Haar random unitary in $L^2$ Wasserstein distance. We also consider robust circuit complexity for random one-dimensional brickwall circuits, as measured by the minimum number of gates required in any circuit that approximately implements the linear optical unitary. Viewing this as a function of the number of modes and the circuit depth, we show the robust circuit complexity for random one-dimensional brickwall circuits scales at most diffusively in the depth with high probability, again in contrast to the linear scaling for certain random qubit circuits. The corresponding Gaussian unitary $\tilde{\mathcal U}$ for the approximate implementation retains high output fidelity $|\langle\psi|\mathcal U^\dagger \tilde{\mathcal U}|\psi\rangle|^2$ for pure states $|\psi\rangle$ with constrained expected photon-number.
原文链接：https://arxiv.org/abs/2604.14277
查看更多资讯请见 AI 行业资讯。