Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Tensor network approaches to open quantum systems, higher dimensional lattices and random quantum circuits

James Allen

Published Aug 27, 2024• 0 citations
OpenAlex

Abstract

In this thesis, we will start by introducing some tensor network methods used to simulate complex physical system. First, we will simulate a neutral atom open quantum system, to develop a relationship between the noise, system size, and performance of a quantum approximate optimization algorithm (QAOA) iteration on this system. In order to help maintain the physicality of the density matrix representing the system, we develop a purity-preserving truncation technique that performs better than a naïve matrix product operator representation while being far more efficient than approaches based on matrix product density operators. We find that for most noise sources, the effect of noise on a QAOA iteration does not scale with system size, although the failure rate of the circuit increases. Next, we will find the ground state of Kagome lattices over different spin values, and identify different properties of the phases found there. In particular, we look at the Jz-J2 phase diagram of the XXZ model on a Kagome lattice for spins 1/2 to 2. For each spin value above 1, we identify a narrow intermediate phase between the q=0 and root(3)-by-root(3) phases that has nematic ordering in their next-nearest neighbour bonds. For spin 1, we also find a wide intermediate phase around the Heisenberg point that has no consistent order parameter. In addition, we will develop a new method of time evolving two-dimensional tensor networks in the form of projected entangled pair states (PEPS), based on converting the PEPS to an isometric tensor network state for each update. This method may be more efficient than a full update based on the boundary MPS method, but the numerical data is inconclusive on whether it has advantages over a simple update. In addition, we will also demonstrate some theoretical and numerical results on random quantum circuits (RQC). We first develop a scheme for numerically computing the anticoncentration of two-dimensional brickwork circuits for a large system size limit and depths up to 15. This approach is based on taking the statistical mechanics model of RQCs and interpreting a depth-wise slice of the system as the matrix product operator in an infinite DMRG algorithm. We find that for these depths, the two-dimensional brickwork maintains the log-depth anticoncentration relation found in one-dimensional brickworks by previous works. We also find that the statistical mechanics model of two-dimensional brickworks naturally hosts a quasiparticle model at very low local Hilbert space dimensions. Next, we show a generalization of results on the epsilon-approximate t-design depths of RQCs to a much wider class of architectures. Previous results were successful at proving that the approximate t-design depth is linear in system size for one-dimensional brickwork architectures, but were unable to generalize these results to arbitrary architectures. We develop an approach based on bounding subleading singular values for each layer in a particular connected block of gates, which naturally translates to a "cluster-merging picture" in which a hierarchy of graphs is connected over time. With this, we were able to translate established one-dimensional brickwork bounds to any possible architecture, preserving system size linearity in the vast majority of them. Finally, we will develop results on bounding the spectral gap of these circuits, which helps lower the t dependence of the approximate t-design depths. In particular, we show that the spectral gap of a one-dimensional brickwork is independent of t for all t <= q, where q is the local Hilbert space dimension of the original circuit. Thus, the epsilon-approximate t-design depth in the small epsilon limit has no t dependence at all. We accomplish this by reducing the spectral gap of a one-dimensional brickwork of any size to a spectral gap of an operator on an effective three-site system. Then, we bound this operator by simplifying its domain according to irreducible representations of the symmetric group, and obtain bounds on the resulting matrix product.

Related papers

Tensor networks for the simulation of strongly correlated systems

Stefan Depenbrock

This thesis treats the classical simulation of strongly-interacting many-body quantum-mechanical systems in more than one dimension using matrix product states and the more general tensor product states. Contrary to classical systems, quantum many-body systems possess an exponentially larger number of degrees of freedom, thereby significantly complicating their numerical treatment on a classical computer. For this thesis two different representations of quantum many-body states were employed. The first, the so-called matrix product states (MPS) form the basis for the extremely successful density matrix renormalization group (DMRG) algorithm. While originally conceived for one-dimensional systems, MPS are in principle capable of describing arbitrary quantum many-body states. Using concepts from quantum information theory it is possible to show that MPS provide a representation of one-dimensional quantum systems that scales polynomially in the number of particles, therefore allowing an efficient simulation of one-dimensional systems on a classical computer. One of the key results of this thesis is that MPS representations are indeed efficient enough to describe even large systems in two dimensions, thereby enabling the simulation of such systems using DMRG. As a demonstration of the power of the DMRG algorithm, it is applied to the Heisenberg antiferromagnet with spin $S = 1/2$ on the kagome lattice. This model's ground state has long been under debate, with proposals ranging from static spin configurations to so-called quantum spin liquids, states where quantum fluctuations destroy conventional order and give rise to exotic quantum orders. Using a fully $SU(2)$-symmetric implementation allowed us to handle the exponential growth of entanglement and to perform a large-scale study of this system, finding the ground state for cylinders of up to 700 sites. Despite employing a one-dimensional algorithm for a two-dimensional system, we were able to compute the spin gap (i.e. the energy gap to the first spinful excitation) and study the ground state properties, such as the decay of correlation functions, the static spin structure factors, and the structure and distribution of the nearest-neighbor spin-spin correlations. Additionally, by applying a new tool from quantum information theory, the topological entanglement entropy, we could also with high confidence demonstrate the ground state of this model to be the elusive gapped $Z_2$ quantum spin liquid with topological order. To complement this study, we also considered the extension of MPS to higher dimensions, known as tensor product states (TPS). We implemented an optimization algorithm exploiting symmetries for this class of states and applied it to the bilinear-biquadratic-bicubic Heisenberg model with spin $S=3/2$ on the $z=3$ Bethe lattice. By carefully analyzing the simulation data we were able to determine the presence of both conventional and symmetry-protected topological order in this model, thereby demonstrating the analytically predicted existence of the Haldane phase in higher dimensions within an extended region of the phase diagram. Key properties of this symmetry-protected topological order include a doubling of the levels in the entanglement spectrum and the presence of edge spins, both of which were confirmed in our simulations. This finding simultaneously validated the applicability of the novel TPS algorithms to the search for exotic order.

•Jan 1, 2013•2 citations

Tensor network approaches: Ground states and dynamics in quantum many-body systems

Ho N. Phien

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.

•Jan 1, 2013•0 citations

Application of Tensor Network State Method to 1D Quantum Systems

蕭仲評

In this thesis, we use the new numerical method multiscale entanglement renormalization ansatz (MERA) to study the one dimensional spin system. This method, MERA, utilizes a network of tensors to represent quantum many-body systems on a lattice. Other examples of tensor network state are matrix product states (MPSs) for 1D systems, tree tensor networks (TTNs) for systems with a tree shape, and projected entangled-pair states (PEPSs) for 2D systems and be- yond. The three structures dier in the graph that denes how the tensors are interconnected into a network: The graphs for MPSs, TTNs, and 2D PEPSs are, respectively, a chain, a tree, and a 2D lattice. Importantly, from these tensor networks the expectation value of local observables can be computed eciently. Developing algorithms to simulate quantum many-body systems is important for understanding and studying the physical principles. And these may become powerful tools for the analysis of quantum computation and quantum information theory. But in general ecient simulation is dicult, due to the fundamental quantum physical laws. The main method we have studied and worked on is multiscale entangle- ment renormalization ansatz (MERA) which is a variational ansatz for many- body states. MERA is a tree tensor network for 1D, 2D systems and beyond. We have developed code of ternary-MERA to compute the ground state energy, expected values of local observables, and correlators for 1D lattice systems. In a nutshell, MERA is an algorithm for entanglement renormalization which is a numerical technique based on locally reorganizing the Hilbert space of a quantum many-body system with the aim to reduce the amount of entanglement in its wave function. We use this method to study 1D Ising model, XXZ model, and J1 - J2 model, and then comparing the numerical results with exact diagonalization (ED) and density matrix renormalization group (DMRG).

•Jan 1, 2010•0 citations

Complexity of tensor network simulation for noisy quantum circuits

Yuguo Shao, Zishuo Zhao, Song Cheng +1 more

We aim to rigorously address how local noise affects classical simulability of quantum dynamics benchmarked by tensor-network methods. Using operator entanglement entropy (OEE), we prove the following: (1) For single-qubit depolarizing noise on arbitrary circuits, tensor networks with $\mathrm{poly}(n)$ bond dimension suffice for fixed absolute Hilbert-Schmidt error after $\order{1}$ depth, while relative error demands $\order{\log n}$ depth; and this bound is optimal. (2) For single-qubit depolarizing noise on 1D local circuits, the existence of whole-trajectory error-bounded matrix product operator (MPO) of $\mathrm{poly}(n)$ bond dimension at all depths. (3) For general single-qubit noise in 1D brickwall circuits, random two-design gates with contraction coefficient $c<1/3$ yield an $\order{1}$ OEE plateau with probability $1-Te^{-Ω(n)}$, while arbitrary gates with $c<1/48$ give $\order{\log n}$ OEE in the worst case. (4) In higher dimensions, these bounds yield uniform-in-depth $\mathrm{poly}(n)$ average boundary-bond dimensions for projected entangled pair operators~(PEPO) across every cut -- under depolarizing noise at either absolute or relative accuracy, and under general noise with strong contraction at absolute accuracy. Our results establish a rigorous connection between certain noise models, circuit types, and their classical simulability.

cond-mat.str-elCross-listedarXiv:2606.00474•Jun 2, 2026•2 citations

Studies of Infinite Two-Dimensional Quantum Lattice Systems with Projected Entangled Pair States

Jacob Jordan

Determining the properties of quantum many-body systems is a central challenge in modern physics. Being able to determine the macroscopic properties of a system from its microscopic description would hasten progress in many fields of science and technology. However, we currently lack the tools to solve such problems generally, or even to develop a theoretical intuition about how many systems might behave. From a simple Hamiltonian description of the system, one may obtain complex, highly correlated collective behaviour. Computational techniques have played a major part in the effort to determine properties of quantum many-body systems. However, as the total degrees of freedom in the system scales exponentially in the system size, numerical diagonalization of the Hamiltonian quickly becomes computationally intractable and one must develop more efficient approximate techniques to explore the system. Present numerical methods such as quantum Monte Carlo and series expansion have provided insight into many systems of interest, but are also held back by fundamental difficulties. In this thesis, we focus on tensor networks, a relatively new ansatz for representing quantum many-body states. Tensor networks are motivated by two ideas from quantum information: firstly, that quantum entanglement is the source of the immense difficulty of simulating quantum systems classically, and secondly that the ground states of certain Hamiltonians exist in a low-entanglement region of the entire Hilbert space. The strength of tensor networks is that they provide a systematic way of representing this class of low-entanglement quantum states. In particular, this thesis describes the iPEPS algorithm for computing the ground states of infinite, two-dimensional quantum lattice systems based on the Projected Entangled Pair States (PEPS) ansatz. We then benchmark the algorithm by computing the phase diagrams of several systems that have been studied with other techniques. Lastly, we apply our algorithm to problems that are not well solved by current approaches, such as frustrated spin systems.

•Jan 1, 2011•7 citations

Numerical studies of quantum lattice systems

Alexios A. Michailidis

The research work in this thesis is based on strongly interacting quantum lattice systems. The biggest part of research was conducted using state-of-the-art tensor network simulations. Tensor networks provide efficient and highly accurate representations of quantum states when any simply connected patch of the quantum state is slightly entangled. Matrix Product States (MPS) is a tensor network representation for quantum states which is quasi-exact for one-dimensional systems when entanglement entropy of any bipartition of the state follows ``area-law". Projected Entangled Pair States (PEPS) is the extension of MPS for higher dimensional systems, where entanglement entropy area-law is non-trivial. These formalisms and their relevant ground state optimization techniques, Density Matrix Renormalization Group (DMRG) for MPS and Simple Update (SU) with Tensor Renormalization Group (TRG) for PEPS are thoroughly analysed. Entanglement entropy area-law is usually obeyed by the ground state of local Hamiltonians, while generic highly excited states follow a volume-law (they span a finite part of the Hilbert space). Recently, a class of interacting system was shown to undergo a dynamical phase transition (Many Body Localization) where the entropy of every eigenstate follows an area-law. This transition is achieved when the system is highly disordered and the quantum many body state becomes localized similarly to the free particle Anderson localization. The area-law property makes highly excited eigenstates of Many Body Localized (MBL) systems efficiently represented by the MPS ansatz. We develop a highly optimized algorithm (eDMRG) which goes beyond ground state optimization and successfully target eigenstates in any part of the spectrum. This algorithm is used together with analytical calculations, based on local integrability of MBL systems, to identify the universal behaviour of the entanglement spectrum of highly excited eigenstates in MBL systems. In the second part we study interacting bosons in 2D optical lattices. Strongly interacting bosons are simulated using the Bose-Hubbard (BH) model when the interactions are strictly local and the Extended Bose-Hubbard (EBH) model, when additional dipolar interactions are present. The ground states of BH/EBH Hamiltonians in a hexagonal lattice are studied. The phase spectrum includes various insulating and critical phases which are studied in detail using infinite-PEPS ansatz. Additional results on entanglement entropy scaling with respect to the filling of the lattice are presented. Finally, a strongly interacting Harper-Hofstadter Hamiltonian is realized by combining synthetic fields with the BH model. The homogeneity of the system is then broken by a parabolic trapping potential, similar to the ones used in cold atom experiments. Using time-dependent Gutzwiller ansatz (GA) the expansion dynamics of the cloud in large square lattices are studied. In contrast to the expansion dynamics of the BH model, it is found that the synthetic fields generate a self-trapping effect. Using phenomenology and simulations the dynamics are studied in the hard-core and soft-core limit.

•Jul 12, 2017•0 citations
In this thesis, we will start by introducing some tensor network methods used to simulate complex physical system. First, we will simulate a neutral atom open quantum system, to develop a relationship between the noise, system size, and performance of a quantum approximate optimization algorithm (QAOA) iteration on this system. In order to help maintain the physicality of the density matrix representing the system, we develop a purity-preserving truncation technique that performs better than a naïve matrix product operator representation while being far more efficient than approaches based on matrix product density operators. We find that for most noise sources, the effect of noise on a QAOA iteration does not scale with system size, although the failure rate of the circuit increases. Next, we will find the ground state of Kagome lattices over different spin values, and identify different properties of the phases found there. In particular, we look at the Jz-J2 phase diagram of the XXZ model on a Kagome lattice for spins 1/2 to 2. For each spin value above 1, we identify a narrow intermediate phase between the q=0 and root(3)-by-root(3) phases that has nematic ordering in their next-nearest neighbour bonds. For spin 1, we also find a wide intermediate phase around the Heisenberg point that has no consistent order parameter. In addition, we will develop a new method of time evolving two-dimensional tensor networks in the form of projected entangled pair states (PEPS), based on converting the PEPS to an isometric tensor network state for each update. This method may be more efficient than a full update based on the boundary MPS method, but the numerical data is inconclusive on whether it has advantages over a simple update. In addition, we will also demonstrate some theoretical and numerical results on random quantum circuits (RQC). We first develop a scheme for numerically computing the anticoncentration of two-dimensional brickwork circuits for a large system size limit and depths up to 15. This approach is based on taking the statistical mechanics model of RQCs and interpreting a depth-wise slice of the system as the matrix product operator in an infinite DMRG algorithm. We find that for these depths, the two-dimensional brickwork maintains the log-depth anticoncentration relation found in one-dimensional brickworks by previous works. We also find that the statistical mechanics model of two-dimensional brickworks naturally hosts a quasiparticle model at very low local Hilbert space dimensions. Next, we show a generalization of results on the epsilon-approximate t-design depths of RQCs to a much wider class of architectures. Previous results were successful at proving that the approximate t-design depth is linear in system size for one-dimensional brickwork architectures, but were unable to generalize these results to arbitrary architectures. We develop an approach based on bounding subleading singular values for each layer in a particular connected block of gates, which naturally translates to a "cluster-merging picture" in which a hierarchy of graphs is connected over time. With this, we were able to translate established one-dimensional brickwork bounds to any possible architecture, preserving system size linearity in the vast majority of them. Finally, we will develop results on bounding the spectral gap of these circuits, which helps lower the t dependence of the approximate t-design depths. In particular, we show that the spectral gap of a one-dimensional brickwork is independent of t for all t <= q, where q is the local Hilbert space dimension of the original circuit. Thus, the epsilon-approximate t-design depth in the small epsilon limit has no t dependence at all. We accomplish this by reducing the spectral gap of a one-dimensional brickwork of any size to a spectral gap of an operator on an effective three-site system. Then, we bound this operator by simplifying its domain according to irreducible representations of the symmetric group, and obtain bounds on the resulting matrix product.
This thesis treats the classical simulation of strongly-interacting many-body quantum-mechanical systems in more than one dimension using matrix product states and the more general tensor product states. Contrary to classical systems, quantum many-body systems possess an exponentially larger number of degrees of freedom, thereby significantly complicating their numerical treatment on a classical computer. For this thesis two different representations of quantum many-body states were employed. The first, the so-called matrix product states (MPS) form the basis for the extremely successful density matrix renormalization group (DMRG) algorithm. While originally conceived for one-dimensional systems, MPS are in principle capable of describing arbitrary quantum many-body states. Using concepts from quantum information theory it is possible to show that MPS provide a representation of one-dimensional quantum systems that scales polynomially in the number of particles, therefore allowing an efficient simulation of one-dimensional systems on a classical computer. One of the key results of this thesis is that MPS representations are indeed efficient enough to describe even large systems in two dimensions, thereby enabling the simulation of such systems using DMRG. As a demonstration of the power of the DMRG algorithm, it is applied to the Heisenberg antiferromagnet with spin S=1/2S = 1/2S=1/2 on the kagome lattice. This model's ground state has long been under debate, with proposals ranging from static spin configurations to so-called quantum spin liquids, states where quantum fluctuations destroy conventional order and give rise to exotic quantum orders. Using a fully SU(2)SU(2)SU(2)-symmetric implementation allowed us to handle the exponential growth of entanglement and to perform a large-scale study of this system, finding the ground state for cylinders of up to 700 sites. Despite employing a one-dimensional algorithm for a two-dimensional system, we were able to compute the spin gap (i.e. the energy gap to the first spinful excitation) and study the ground state properties, such as the decay of correlation functions, the static spin structure factors, and the structure and distribution of the nearest-neighbor spin-spin correlations. Additionally, by applying a new tool from quantum information theory, the topological entanglement entropy, we could also with high confidence demonstrate the ground state of this model to be the elusive gapped Z2Z_2Z2​ quantum spin liquid with topological order. To complement this study, we also considered the extension of MPS to higher dimensions, known as tensor product states (TPS). We implemented an optimization algorithm exploiting symmetries for this class of states and applied it to the bilinear-biquadratic-bicubic Heisenberg model with spin S=3/2S=3/2S=3/2 on the z=3z=3z=3 Bethe lattice. By carefully analyzing the simulation data we were able to determine the presence of both conventional and symmetry-protected topological order in this model, thereby demonstrating the analytically predicted existence of the Haldane phase in higher dimensions within an extended region of the phase diagram. Key properties of this symmetry-protected topological order include a doubling of the levels in the entanglement spectrum and the presence of edge spins, both of which were confirmed in our simulations. This finding simultaneously validated the applicability of the novel TPS algorithms to the search for exotic order.
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.
In this thesis, we use the new numerical method multiscale entanglement renormalization ansatz (MERA) to study the one dimensional spin system. This method, MERA, utilizes a network of tensors to represent quantum many-body systems on a lattice. Other examples of tensor network state are matrix product states (MPSs) for 1D systems, tree tensor networks (TTNs) for systems with a tree shape, and projected entangled-pair states (PEPSs) for 2D systems and be- yond. The three structures dier in the graph that denes how the tensors are interconnected into a network: The graphs for MPSs, TTNs, and 2D PEPSs are, respectively, a chain, a tree, and a 2D lattice. Importantly, from these tensor networks the expectation value of local observables can be computed eciently. Developing algorithms to simulate quantum many-body systems is important for understanding and studying the physical principles. And these may become powerful tools for the analysis of quantum computation and quantum information theory. But in general ecient simulation is dicult, due to the fundamental quantum physical laws. The main method we have studied and worked on is multiscale entangle- ment renormalization ansatz (MERA) which is a variational ansatz for many- body states. MERA is a tree tensor network for 1D, 2D systems and beyond. We have developed code of ternary-MERA to compute the ground state energy, expected values of local observables, and correlators for 1D lattice systems. In a nutshell, MERA is an algorithm for entanglement renormalization which is a numerical technique based on locally reorganizing the Hilbert space of a quantum many-body system with the aim to reduce the amount of entanglement in its wave function. We use this method to study 1D Ising model, XXZ model, and J1 - J2 model, and then comparing the numerical results with exact diagonalization (ED) and density matrix renormalization group (DMRG).
We aim to rigorously address how local noise affects classical simulability of quantum dynamics benchmarked by tensor-network methods. Using operator entanglement entropy (OEE), we prove the following: (1) For single-qubit depolarizing noise on arbitrary circuits, tensor networks with poly(n)\mathrm{poly}(n)poly(n) bond dimension suffice for fixed absolute Hilbert-Schmidt error after $\order{1}$ depth, while relative error demands $\order{\log n}$ depth; and this bound is optimal. (2) For single-qubit depolarizing noise on 1D local circuits, the existence of whole-trajectory error-bounded matrix product operator (MPO) of poly(n)\mathrm{poly}(n)poly(n) bond dimension at all depths. (3) For general single-qubit noise in 1D brickwall circuits, random two-design gates with contraction coefficient c<1/3c<1/3c<1/3 yield an $\order{1}$ OEE plateau with probability 1−Te−Ω(n)1-Te^{-Ω(n)}1−Te−Ω(n), while arbitrary gates with c<1/48c<1/48c<1/48 give $\order{\log n}$ OEE in the worst case. (4) In higher dimensions, these bounds yield uniform-in-depth poly(n)\mathrm{poly}(n)poly(n) average boundary-bond dimensions for projected entangled pair operators~(PEPO) across every cut -- under depolarizing noise at either absolute or relative accuracy, and under general noise with strong contraction at absolute accuracy. Our results establish a rigorous connection between certain noise models, circuit types, and their classical simulability.
Determining the properties of quantum many-body systems is a central challenge in modern physics. Being able to determine the macroscopic properties of a system from its microscopic description would hasten progress in many fields of science and technology. However, we currently lack the tools to solve such problems generally, or even to develop a theoretical intuition about how many systems might behave. From a simple Hamiltonian description of the system, one may obtain complex, highly correlated collective behaviour. Computational techniques have played a major part in the effort to determine properties of quantum many-body systems. However, as the total degrees of freedom in the system scales exponentially in the system size, numerical diagonalization of the Hamiltonian quickly becomes computationally intractable and one must develop more efficient approximate techniques to explore the system. Present numerical methods such as quantum Monte Carlo and series expansion have provided insight into many systems of interest, but are also held back by fundamental difficulties. In this thesis, we focus on tensor networks, a relatively new ansatz for representing quantum many-body states. Tensor networks are motivated by two ideas from quantum information: firstly, that quantum entanglement is the source of the immense difficulty of simulating quantum systems classically, and secondly that the ground states of certain Hamiltonians exist in a low-entanglement region of the entire Hilbert space. The strength of tensor networks is that they provide a systematic way of representing this class of low-entanglement quantum states. In particular, this thesis describes the iPEPS algorithm for computing the ground states of infinite, two-dimensional quantum lattice systems based on the Projected Entangled Pair States (PEPS) ansatz. We then benchmark the algorithm by computing the phase diagrams of several systems that have been studied with other techniques. Lastly, we apply our algorithm to problems that are not well solved by current approaches, such as frustrated spin systems.
The research work in this thesis is based on strongly interacting quantum lattice systems. The biggest part of research was conducted using state-of-the-art tensor network simulations. Tensor networks provide efficient and highly accurate representations of quantum states when any simply connected patch of the quantum state is slightly entangled. Matrix Product States (MPS) is a tensor network representation for quantum states which is quasi-exact for one-dimensional systems when entanglement entropy of any bipartition of the state follows ``area-law". Projected Entangled Pair States (PEPS) is the extension of MPS for higher dimensional systems, where entanglement entropy area-law is non-trivial. These formalisms and their relevant ground state optimization techniques, Density Matrix Renormalization Group (DMRG) for MPS and Simple Update (SU) with Tensor Renormalization Group (TRG) for PEPS are thoroughly analysed. Entanglement entropy area-law is usually obeyed by the ground state of local Hamiltonians, while generic highly excited states follow a volume-law (they span a finite part of the Hilbert space). Recently, a class of interacting system was shown to undergo a dynamical phase transition (Many Body Localization) where the entropy of every eigenstate follows an area-law. This transition is achieved when the system is highly disordered and the quantum many body state becomes localized similarly to the free particle Anderson localization. The area-law property makes highly excited eigenstates of Many Body Localized (MBL) systems efficiently represented by the MPS ansatz. We develop a highly optimized algorithm (eDMRG) which goes beyond ground state optimization and successfully target eigenstates in any part of the spectrum. This algorithm is used together with analytical calculations, based on local integrability of MBL systems, to identify the universal behaviour of the entanglement spectrum of highly excited eigenstates in MBL systems. In the second part we study interacting bosons in 2D optical lattices. Strongly interacting bosons are simulated using the Bose-Hubbard (BH) model when the interactions are strictly local and the Extended Bose-Hubbard (EBH) model, when additional dipolar interactions are present. The ground states of BH/EBH Hamiltonians in a hexagonal lattice are studied. The phase spectrum includes various insulating and critical phases which are studied in detail using infinite-PEPS ansatz. Additional results on entanglement entropy scaling with respect to the filling of the lattice are presented. Finally, a strongly interacting Harper-Hofstadter Hamiltonian is realized by combining synthetic fields with the BH model. The homogeneity of the system is then broken by a parabolic trapping potential, similar to the ones used in cold atom experiments. Using time-dependent Gutzwiller ansatz (GA) the expansion dynamics of the cloud in large square lattices are studied. In contrast to the expansion dynamics of the BH model, it is found that the synthetic fields generate a self-trapping effect. Using phenomenology and simulations the dynamics are studied in the hard-core and soft-core limit.