We study the level-spacing statistics in the entanglement spectrum of output states of random universal quantum circuits where qubits are subject to a finite probability of projection to the computational basis at each time step. We encounter two phase transitions with increasing projection rate. The first is the volume-to-area law transition observed in quantum circuits with projective measurements. We identify a second transition within the area law phase by repartioning the system randomly into two subsystems and probing the entanglement level statistics. This second transition separates a pure Poisson level statistics phase at large projective measurement rates from a regime of residual level repulsion in the entanglement spectrum, characterized by nonuniversal level spacing statistics that interpolates between the Wigner-Dyson and Poisson distributions. By applying a tensor network contraction algorithm introduced in [Z.-C. Yang et al., Phys. Rev. E 97, 033303 (2018)] to the circuit spacetime, we identify this second projective-measurement-driven transition as a percolation transition of entangled bonds. The same behavior is observed in both circuits of random two-qubit unitaries and circuits of universal gate sets, including the set implemented by Google in its Sycamore circuits.
We study the level-spacing statistics in the entanglement spectrum of output states of random universal quantum circuits where qubits are subject to a finite probability of projection to the computational basis at each time step. We encounter two phase transitions with increasing projection rate. The first is the volume-to-area law transition observed in quantum circuits with projective measurements. We identify a second transition within the area law phase by repartioning the system randomly into two subsystems and probing the entanglement level statistics. This second transition separates a pure Poisson level statistics phase at large projective measurement rates from a regime of residual level repulsion in the entanglement spectrum, characterized by nonuniversal level spacing statistics that interpolates between the Wigner-Dyson and Poisson distributions. By applying a tensor network contraction algorithm introduced in [Z.-C. Yang et al., Phys. Rev. E 97, 033303 (2018)] to the circuit spacetime, we identify this second projective-measurement-driven transition as a percolation transition of entangled bonds. The same behavior is observed in both circuits of random two-qubit unitaries and circuits of universal gate sets, including the set implemented by Google in its Sycamore circuits.
In this thesis, I describe research results on three topics : (i) a phase transition in the area-law regime of quantum circuits driven by projection measurements; (ii) ultra slow dynamics in two dimensional spin circuits; and (iii) tensor network methods applied to boolean satisfiability problems. (i) Nonuniversal entanglement level statistics in projection-driven quantum circuits; Non-thermalized closed quantum many-body systems have drawn considerable attention, due to their relevance to experimentally controllable quantum systems. In the first part of the thesis, we study the level-spacing statistics in the entanglement spectrum of output states of random universal quantum circuits where, at each time step, qubits are subject to a finite probability of projection onto states of the computational basis. We encounter two phase transitions with increasing projection rate: The first is the volume-to-area law transition observed in quantum circuits with projective measurements; The second separates the pure Poisson level statistics phase at large projective measurement rates from a regime of residual level repulsion in the entanglement spectrum within the area-law phase, characterized by non-universal level spacing statistics that interpolates between the Wigner-Dyson and Poisson distributions. The same behavior is observed in both circuits of random two-qubit unitaries and circuits of universal gates, including the set implemented by Google in its Sycamore circuits. (ii) Ultra-slow dynamics in a translationally invariant spin model for multiplication and factorization; Slow relaxation of glassy systems in the absence of disorder remains one of the most intriguing problems in condensed matter physics. In the second part of the thesis we investigate slow relaxation in a classical model of short-range interacting Ising spins on a translationally invariant two-dimensional lattice that mimics a reversible circuit that, depending on the choice of boundary conditions, either multiplies or factorizes integers. We prove that, for open boundary conditions, the model exhibits no finite-temperature phase transition. Yet we find that it displays glassy dynamics with astronomically slow relaxation times, numerically consistent with a double exponential dependence on the inverse temperature. The slowness of the dynamics arises due to errors that occur during thermal annealing that cost little energy but flip an extensive number of spins. We argue that the energy barrier that needs to be overcome in order to heal such defects scales linearly with the correlation length, which diverges exponentially with inverse temperature, thus yielding the double exponential behavior of the relaxation time. (iii) Reversible circuit embedding on tensor networks for Boolean satisfiability; Finally, in the third part of the thesis we present an embedding of Boolean satisfiability (SAT) problems on a two-dimensional tensor network. The embedding uses reversible circuits encoded into the tensor network whose trace counts the number of solutions of the satisfiability problem. We specifically present the formulation of #2SAT, #3SAT, and #3XORSAT formulas into planar tensor networks. We use a compression-decimation algorithm introduced by us to propagate constraints in the network before coarse-graining the boundary tensors. Iterations of these two steps gradually collapse the network while slowing down the growth of bond dimensions. For the case of #3XORSAT, we show numerically that this procedure recognizes, at least partially, the simplicity of XOR constraints for which it achieves subexponential time to solution. For a #P-complete subset of #2SAT we find that our algorithm scales with size in the same way as state-of-the-art #SAT counters, albeit with a larger prefactor. We find that the compression step performs less efficiently for #3SAT than for #2SAT.
The entanglement level statistics of a quantum state have recently been proposed to be a signature of universality in the underlying quantum circuit. This is a consequence of level repulsion in the entanglement spectra being tied to the integrability of entanglement generated. However, such studies of the level-spacing statistics in the entanglement spectrum have thus far been limited to the output states of Clifford and Haar random circuits on product state inputs. In this work, we provide the first example of a circuit which is composed of a simulable gate set, yet has a Wigner-Dyson distributed entanglement level spectrum without any perturbing universal element. We first show that, for matchgate circuits acting on random product states, Wigner-Dyson statistics emerge by virtue of a single SWAP gate, in direct analog to previous studies on Clifford circuits. We then examine the entanglement spectrum of matchgate circuits with varied input states, and find a sharp jump in the complexity of entanglement as we go from two- to three-qubit entangled inputs. Studying Clifford and matchgate hybrid circuits, we find examples of classically simulable circuits whose output states exhibit Wigner-Dyson entanglement level statistics in the absence of universal quantum gate elements. Our study thus provides strong evidence that entanglement spectrum is not strongly connected to notions of simulability in any given quantum circuit.
Repeated projective measurements in unitary circuits can lead to an entanglement phase transition as the measurement rate is tuned. In this work, we consider a different setting in which the projective measurements are replaced by dynamically chosen unitary gates that minimize the entanglement. This can be seen as a one-dimensional unitary circuit game in which two players get to place unitary gates on randomly assigned bonds at different rates: the “entangler” applies a random local unitary gate with the aim of generating extensive (volume-law) entanglement. The “disentangler,” based on limited knowledge about the state, chooses a unitary gate to reduce the entanglement entropy on the assigned bond with the goal of limiting to only finite (area-law) entanglement. In order to elucidate the resulting entanglement dynamics, we consider three different scenarios: (i) a classical discrete height model, (ii) a Clifford circuit, and (iii) a general U(4) unitary circuit. We find that both the classical and Clifford circuit models exhibit phase transitions as a function of the rate that the disentangler places a gate, which have similar properties that can be understood through a connection to the stochastic Fredkin chain. In contrast, the entangler always wins when using Haar random unitary gates and we observe extensive, volume-law entanglement for all nonzero rates of entangling. Published by the American Physical Society 2024
Monitored random circuits, consisting of alternating layers of entangling two-qubit gates and projective single-qubit measurements applied to some fraction p of the qubits, have been a topic of recent interest. In particular, the resulting steady state exhibits a phase transition from highly correlated states with "volume-law" entanglement at p<p_{c} to localized states with "area-law" entanglement at p>p_{c}. It is hard to access this transition experimentally, as it cannot be seen at the ensemble level. Naively, to observe it one must repeat the experiment until the set of measurement results repeats itself, with likelihood that is exponentially small in the number of measurements. To overcome this issue, we present a hybrid quantum-classical algorithm which creates a matrix product state (MPS) based "unitary mirror" of the projected circuit. Polynomial-sized tensor networks can represent quantum states with area-law entanglement, and so the unitary mirror can well approximate the experimental state above p_{c} but fails exponentially below it. The breaking of this mirror can thus pinpoint the critical point. We outline the algorithm and how such results would be obtained. We present a bound on the maximum entanglement entropy of any given state that is well represented by an MPS, and from the bound suggest how the volume-law phase can be bounded. We consider whether the entanglement could similarly be bounded from below where the MPS fails. Finally, we present numerical results for small qubit numbers and for monitored circuits with random Clifford gates.
We introduce and explore a one-dimensional ``hybrid'' quantum circuit model consisting of both unitary gates and projective measurements. While the unitary gates are drawn from a random distribution and act uniformly in the circuit, the measurements are made at random positions and times throughout the system. By varying the measurement rate we can tune between the volume law entangled phase for the random unitary circuit model (no measurements) and a ``quantum Zeno phase'' where strong measurements suppress the entanglement growth to saturate in an area law. Extensive numerical simulations of the quantum trajectories of the many-particle wave functions (exploiting Clifford circuitry to access systems up to 512 qubits) provide evidence for a stable ``weak measurement phase'' that exhibits volume-law entanglement entropy, with a coefficient decreasing with increasing measurement rate. We also present evidence for a continuous quantum dynamical phase transition between the ``weak measurement phase'' and the ``quantum Zeno phase,'' driven by a competition between the entangling tendencies of unitary evolution and the disentangling tendencies of projective measurements. Detailed steady-state and dynamic critical properties of this quantum entanglement transition are accessed.
When subject to a nonlocal unitary evolution, qubits in a quantum circuit become increasingly entangled. Conversely, measurements applied to individual qubits lead to their disentanglement from the collective system. The extent of entanglement reduction depends on the frequency of local projective measurements. A delicate balance emerges between unitary evolution, which enhances entanglement, and measurements which diminish it. In the thermodynamic limit, there is a phase transition from volume law entanglement to area law entanglement at a critical value of measurement frequency. This phenomenon, occurring in hybrid quantum circuits with both unitary gates and measurements, is termed as measurement-induced phase transition (MIPT). We study the behavior of MIPT in circuits comprising of two-qubit unitary gates parameterized by Cartan decomposition. We show that the entangling power and gate typicality of the two-qubit local unitaries employed in the circuit can be used to explain the behavior of global bipartite entanglement the circuit can sustain. When the two-qubit gate throughout the circuit is the identity and measurements are the sole driver of the entanglement behavior, we obtain an analytical estimate for the entanglement entropy that shows remarkable agreement with numerical simulations. We also find that the entangling power and gate typicality enable the classification of the two-qubit unitaries by different universality classes of phase transitions that can occur in the hybrid circuit. For all unitaries in a particular universality class, the transition from volume to area law of entanglement occurs with the same exponent that characterizes the phase transition.