Tensor product states have proved extremely powerful for simulating the area-law entangled states of many-body systems, such as the ground states of gapped Hamiltonians in one dimension. The applicability of such methods to the dynamics of many-body systems is less clear: The memory required grows exponentially in time in most cases, quickly becoming unmanageable. New methods reduce the memory required by selectively discarding/dissipating parts of the many-body wave function which are expected to have little effect on the hydrodynamic observables typically of interest: For example, some methods discard fine-grained correlations associated with $n$-point functions, with $n$ exceeding some cutoff ${\ensuremath{\ell}}_{*}$. In this paper, we present a theory for the sizes of backflow corrections, i.e., systematic errors due to discarding this fine-grained information. In particular, we focus on their effect on transport coefficients. Our results suggest that backflow corrections are exponentially suppressed in the size of the cutoff ${\ensuremath{\ell}}_{*}$. Moreover, the backflow errors themselves have a hydrodynamical expansion, which we elucidate. We test our predictions against numerical simulations run on random unitary circuits and ergodic spin chains. These results lead to the conjecture that transport coefficients in ergodic diffusive systems can be captured to a given precision $\ensuremath{\epsilon}$ with an amount of memory scaling as $exp[\mathcal{O}(log{(\ensuremath{\epsilon})}^{2})]$, significantly better than the naive estimate of memory $exp[\mathcal{O}(\mathrm{poly}({\ensuremath{\epsilon}}^{\ensuremath{-}1}))]$ required by more brute-force methods.
Tensor product states have proved extremely powerful for simulating the area-law entangled states of many-body systems, such as the ground states of gapped Hamiltonians in one dimension. The applicability of such methods to the dynamics of many-body systems is less clear: The memory required grows exponentially in time in most cases, quickly becoming unmanageable. New methods reduce the memory required by selectively discarding/dissipating parts of the many-body wave function which are expected to have little effect on the hydrodynamic observables typically of interest: For example, some methods discard fine-grained correlations associated with n-point functions, with n exceeding some cutoff \ensuremathℓ∗. In this paper, we present a theory for the sizes of backflow corrections, i.e., systematic errors due to discarding this fine-grained information. In particular, we focus on their effect on transport coefficients. Our results suggest that backflow corrections are exponentially suppressed in the size of the cutoff \ensuremathℓ∗. Moreover, the backflow errors themselves have a hydrodynamical expansion, which we elucidate. We test our predictions against numerical simulations run on random unitary circuits and ergodic spin chains. These results lead to the conjecture that transport coefficients in ergodic diffusive systems can be captured to a given precision \ensuremathϵ with an amount of memory scaling as exp[O(log(\ensuremathϵ)2)], significantly better than the naive estimate of memory exp[O(poly(\ensuremathϵ\ensuremath−1))] required by more brute-force methods.
Classical simulation of quantum many-body systems is in general a challenging problem for the simple reason that the dimension of the Hilbert space grows exponentially with the system size. In particular, merely encoding a generic quantum many-body state requires an exponential number of bits. However, condensed matter physicists are mostly interested in local Hamiltonians and especially their ground states, which are highly non-generic. Thus, we might hope that at least some physical systems allow efficient classical simulation.Starting with one-dimensional (1D) quantum systems (i.e., the simplest nontrivial case), the first basic question is: Which classes of states have efficient classical representations? It turns out that this question is quantitatively related to the amount of entanglement in the state, for states with ``little entanglement'' are well approximated by matrix product states (a data structure that can be manipulated efficiently on a classical computer). At a technical level, the mathematical notion for ``little entanglement'' is area law, which has been proved for unique ground states in 1D gapped systems. We establish an area law for constant-fold degenerate ground states in 1D gapped systems and thus explain the effectiveness of matrix-product-state methods in (e.g.) symmetry breaking phases. This result might not be intuitively trivial as degenerate ground states in gapped systems can be long-range correlated.Suppose an efficient classical representation exists. How can one find it efficiently? The density matrix renormalization group is the leading numerical method for computing ground states in 1D quantum systems. However, it is a heuristic algorithm and the possibility that it may fail in some cases cannot be completely ruled out. Recently, a provably efficient variant of the density matrix renormalization group has been developed for frustration-free 1D gapped systems. We generalize this algorithm to all (i.e., possibly frustrated) 1D gapped systems. Note that the ground-state energy of 1D gapless Hamiltonians is computationally intractable even in the presence of translational invariance.It is tempting to extend methods and tools in 1D to two and higher dimensions (2+D), e.g., matrix product states are generalized to tensor network states. Since an area law for entanglement (if formulated properly) implies efficient matrix product state representations in 1D, an interesting question is whether a similar implication holds in 2+D. Roughly speaking, we show that an area law for entanglement (in any reasonable formulation) does not always imply efficient tensor network representations of the ground states of 2+D local Hamiltonians even in the presence of translational invariance. It should be emphasized that this result does not contradict with the common sense that in practice quantum states with more entanglement usually require more space to be stored classically; rather, it demonstrates that the relationship between entanglement and efficient classical representations is still far from being well understood.Excited eigenstates participate in the dynamics of quantum systems and are particularly relevant to the phenomenon of many-body localization (absence of transport at finite temperature in strongly correlated systems). We study the entanglement of excited eigenstates in random spin chains and expect that its singularities coincide with dynamical quantum phase transitions. This expectation is confirmed in the disordered quantum Ising chain using both analytical and numerical methods.Finally, we study the problem of generating ground states (possibly with topological order) in 1D gapped systems using quantum circuits. This is an interesting problem both in theory and in practice. It not only characterizes the essential difference between the entanglement patterns that give rise to trivial and nontrivial topological order, but also quantifies the difficulty of preparing quantum states with a quantum computer (in experiments).
During time evolution of many-body systems entanglement grows rapidly, limiting exact simulations to small-scale systems or small timescales. Quantum information tends, however, to flow towards larger scales without returning to local scales, such that its detailed large-scale structure does not directly affect local observables. This allows for the removal of large-scale quantum information in a way that preserves all local observables and gives access to large-scale and large-time quantum dynamics. To this end, we use the recently introduced to organize quantum information into different scales, allowing us to define and that we employ to systematically discard long-range quantum correlations in a controlled way. Our approach relies on decomposing the system into subsystems up to a maximum scale and time evolving the subsystem density matrices by solving the subsystem von Neumann equations in parallel. Importantly, the information flow needs to be preserved during the discarding of large-scale information. To achieve this without the need to make assumptions about the microscopic details of the information current, we introduce a second scale at which information is discarded, while using the state at the maximum scale to accurately obtain the information flow. The resulting algorithm, which we call local-information time evolution, is highly versatile and suitable for investigating many-body quantum dynamics in both closed and open quantum systems with diverse hydrodynamic behaviors. We present results for the energy transport in the mixed-field Ising model and the magnetization transport in the X X spin chain with onsite dephasing where we accurately determine the power-law exponent and the diffusion coefficients. Furthermore, the information lattice framework employed here promises to offer insightful results about the spatial and temporal behavior of entanglement in many-body systems.
The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.
[eng] Quantum many-body dynamics is a vast field of physics at the intersection of statistical mechanics, condensed matter, quantum information, and computational physics. Understanding the time evolution of observable correlations—such as those involved in material responses—is both a milestone for technological advancement and a corner-stone for generating fundamental knowledge. At the intersection of emergent collective behavior in many-body systems, quantum physics, and information theory lies the classical simulation of out-of-equilibrium phenomena. Without numerical tools, progress in disciplines that require heavy computations with high-dimensional vectors and matrices would be limited to purely analytical predictions and constrained by the available expertise and resources needed to build benchmarking experiments. The goal of this thesis is to advance the classical simulation of quantum many-body systems using Tensor Networks. This technique has proven fruitful for predicting equilibrium ground states and thermal properties of one-dimensional systems, yet it still faces challenges when applied to out-of-equilibrium scenarios. In brief, the dynamics of experimentally accessible expectation values can be represented as a 2D Tensor Network, which must be contracted using iterative methods such as Time-Evolving Block Decimation. However, the memory and computational time required for these calculations—which reflect the methods’ complexity—are known to grow exponentially with the simulated physical time in generic systems. This limitation is often referred to in the literature as the entanglement barrier. This manuscript tackles the problem through the three inequivalent ways in which the 2D Tensor Network can be contracted. In Chapter 3, we study how Schrödinger-picture contraction from the state edge of the network can be modified to improve the convergence of iterative contraction and reduce truncation errors in small systems. To this end, we explore physical decoherence in optimized bases and artificial generalized decoherence, finding that both alternatives show promise for new protocols that overcome the entanglement barrier. In Chapter 4, we explore Heisenberg-picture contraction from the observable edge, combining the concept of generalized decoherence with Pauli Weight truncation. By thoroughly characterizing the Pauli weight requirements to accurately describe the time evolution of local expectation values from initial product states, we conclude that truncating off-diagonal Pauli Weights is an effective scheme for simulating long-time dynamics—and we successfully implement it. We conclude with a spatial characterization of Pauli Weight spreading, bridging Tensor Network simulations and the field of operator hydrodynamics. Finally, in Chapter 5, we focus on the transverse contraction of the 2D Tensor Net-work using the light-cone algorithm, analyzing its variants in terms of truncation strategies and convergence across different models. This leads to a systematic characterization of the method based on the integrability of the underlying Hamiltonians and single-spin noise models.
Simulating open quantum systems reveals how environmental coupling shapes relaxation, excitation transport, and the dynamics of quantum correlations. On quantum hardware, dissipative channels add operations and might seem to increase cost. However, we show that a broad class of Pauli noise, including depolarization, can ease quantum and classical simulation by exponentially suppressing high-weight components of Heisenberg-evolved observables. For bounded-degree Lindblad dynamics, this permits system-size-independent Trotter steps when estimating local observables. Combining this compression with Richardson extrapolation, we provide classical and quantum error bounds with respect to the 2-norm of the propagated observable. These give high-probability expectation-value guarantees for random input states or random Hamiltonians acting on a fixed state and control (out-of-time-order) correlators. Concretely, we show that expectation values of local observables at time t can be estimated to accuracy ε using circuits of maximum depth O([1+(t/γ)3/2]log2(1/ε)), independent of the system size n. Classically, we show that sparse Pauli propagation runs in time polynomial in n, t and 1/ε for every fixed γ>0, with polynomial degree O(1/γ) in the weak dissipation limit. The gap between our quantum and classical upper bounds leaves room for a substantial polynomial quantum advantage as dissipation weakens, an observation further supported by our numerical results.
Tensor networks are a powerful tool for many-body ground states with limited entanglement. These methods can nonetheless fail for certain time-dependent processes-such as quantum transport or quenches-where entanglement growth is linear in time. Matrix-product-state decompositions of the resulting out-of-equilibrium states require a bond dimension that grows exponentially, imposing a hard limit on simulation timescales. However, in the case of transport, if the reservoir modes of a closed system are arranged according to their scattering structure, the entanglement growth can be made logarithmic. Here, we apply this ansatz to open systems via extended reservoirs that have explicit relaxation. This enables transport calculations that can access steady states, time dynamics and noise, and periodic driving (e.g., Floquet states). We demonstrate the approach by calculating the transport characteristics of an open, interacting system. These results open a path to scalable and numerically systematic many-body transport calculations with tensor networks.