Search

We propose efficient classical algorithms which (strongly) simulate the action of bosonic linear optics circuits applied to superpositions of Gaussian states. Our approach relies on an augmented covariance matrix formalism to keep track of relative phases between individual terms in a linear combination. This yields an exact simulation algorithm whose runtime is polynomial in the number of modes and the size of the circuit, and quadratic in the number of terms in the superposition. We also present a faster approximate randomized algorithm whose runtime is linear in this number. Our main building blocks are a formula for the triple overlap of three Gaussian states and a fast algorithm for estimating the norm of a superposition of Gaussian states up to a multiplicative error. Our construction borrows from earlier work on simulating quantum circuits in finite-dimensional settings, including, in particular, fermionic linear optics with non-Gaussian initial states and Clifford computations with non-stabilizer initial states. It provides algorithmic access to a practically relevant family of non-Gaussian bosonic circuits., Comment: 43 pages and 11 figures

We propose efficient algorithms for classically simulating fermionic linear optics operations applied to non-Gaussian initial states. By gadget constructions, this provides algorithms for fermionic linear optics with non-Gaussian operations. We argue that this problem is analogous to that of simulating Clifford circuits with non-stabilizer initial states: Algorithms for the latter problem immediately translate to the fermionic setting. Our construction is based on an extension of the covariance matrix formalism which permits to efficiently track relative phases in superpositions of Gaussian states. It yields simulation algorithms with polynomial complexity in the number of fermions, the desired accuracy, and certain quantities capturing the degree of non-Gaussianity of the initial state. We study one such quantity, the fermionic Gaussian extent, and show that it is multiplicative on tensor products when the so-called fermionic Gaussian fidelity is. We establish this property for the tensor product of two arbitrary pure states of four fermions with positive parity., Comment: 68 pages and 15 figures; updated to match published version

We investigate the effect of quantum noise on the measurement-induced quantum phase transition in monitored random quantum circuits. Using the efficient simulability of random Clifford circuits, we find that the transition is broadened into a crossover and that the phase diagram as a function of projective measurements and noise exhibits several distinct regimes. We show that a mapping to a classical statistical mechanics problem accounts for the main features of the random circuit phase diagram. The bulk noise maps to an explicit permutation symmetry breaking coupling; this symmetry is spontaneously broken when the noise is switched off. These results have implications for the realization of entanglement transitions in noisy quantum circuits., Comment: 4 pages + references + 9 pages

We study a model of free fermions on a chain with dynamics generated by random unitary gates acting on nearest neighbor bonds and present an exact calculation of time-ordered and out-of-time-ordered correlators. We consider three distinct cases: the random circuit with spatio-temporal disorder (i) with and (ii) without particle number conservation and (iii) the particle non-conserving case with purely temporal disorder. In all three cases, temporal disorder causes diffusive operator spreading and $\sim\sqrt{t}$ entanglement growth. This is in sharp contrast to Anderson localization for the case of static disorder and with the ballistic behavior observed in both the clean case of Hamiltonian evolution and in fully random unitary quantum circuits., Comment: main text: 4 pages, 2 figures; supplemental material: 25 pages, 9 figures