Abstract

Characterizing how entanglement grows with time in a many-body system, for example after a quantum quench, is a key problem in non-equilibrium quantum physics. We study this problem for the case of random unitary dynamics, representing either Hamiltonian evolution with time--dependent noise or evolution by a random quantum circuit. Our results reveal a universal structure behind noisy entanglement growth, and also provide simple new heuristics for the `entanglement tsunami' in Hamiltonian systems without noise. In 1D, we show that noise causes the entanglement entropy across a cut to grow according to the celebrated Kardar--Parisi--Zhang (KPZ) equation. The mean entanglement grows linearly in time, while fluctuations grow like $(\text{time})^{1/3}$ and are spatially correlated over a distance $\propto (\text{time})^{2/3}$. We derive KPZ universal behaviour in three complementary ways, by mapping random entanglement growth to: (i) a stochastic model of a growing surface; (ii) a `minimal cut' picture, reminiscent of the Ryu--Takayanagi formula in holography; and (iii) a hydrodynamic problem involving the dynamical spreading of operators. We demonstrate KPZ universality in 1D numerically using simulations of random unitary circuits. Importantly, the leading order time dependence of the entropy is deterministic even in the presence of noise, allowing us to propose a simple `minimal cut' picture for the entanglement growth of generic Hamiltonians, even without noise, in arbitrary dimensionality. We clarify the meaning of the `velocity' of entanglement growth in the 1D `entanglement tsunami'. We show that in higher dimensions, noisy entanglement evolution maps to the well-studied problem of pinning of a membrane or domain wall by disorder.

Highlights

  • The language of quantum entanglement ties together condensed matter physics, quantum information, and highenergy theory

  • In 1D, we show that noise causes the entanglement entropy across a cut to grow according to the celebrated KardarParisi-Zhang (KPZ) equation

  • We argue that generically there is a well-defined “entanglement speed” vE, but this is generically smaller than the “butterfly speed” vB governing operator growth, and we give a physical explanation for this phenomenon

Read more

Summary

INTRODUCTION

The language of quantum entanglement ties together condensed matter physics, quantum information, and highenergy theory. We propose new heuristic pictures for entanglement growth in generic, nonintegrable systems, both in 1D and in higher dimensions We arrive at these pictures by studying “minimally structured” models for quantum dynamics: dynamics that are spatially local, and unitary, but random both in time and space (“noisy”). The class of noisy dynamics includes closed, many-body systems whose Hamiltonian HðtÞ contains fluctuating noise terms, and quantum circuits in which qubits are acted on by randomly chosen unitary gates In this setting, we pin down both the leading-order deterministic behavior of the entanglement and the subleading fluctuations associated with noise. The directed polymer is related to the “minimal cut,” a curve in space-time that bisects the unitary circuit representing the time evolution This picture is more general than the surface growth picture, as it allows one to consider the entropy for any bipartition of the system. Picture generalizes to higher dimensions, the KPZ and hydrodynamic pictures are special to 1D

Organization of the paper
SURFACE GROWTH IN 1D
Solvable 1D model
Dynamics of Hartley entropy
Limit of large Hilbert space dimension
Properties of the solvable model
Entanglement speed in the solvable model
Scaling form for entanglement saturation
HYDRODYNAMICS OF OPERATOR SPREADING
Stabilizer operators
Coarse-grained operator dynamics
ENTANGLEMENT TSUNAMI
Scaling forms for the entanglement tsunami
NUMERICAL EVIDENCE FOR KPZ GROWTH
Clifford evolution
Universal and phase evolution
FREE FERMIONS ARE NONGENERIC
Universal fluctuations of SðtÞ in noisy systems
Minimal membrane picture for dynamics without noise
OUTLOOK
Counterexample to the stronger conjecture
Parameter-counting argument
TrBðgÞ: ðC6Þ
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.