Related papers: Provably Efficient Simulation of 1D Long-Range Int…
Long-range quantum systems, in which the interactions decay as $1/r^{\alpha}$, are of increasing interest due to the variety of experimental set-ups in which they naturally appear. Motivated by this, we study fundamental properties of…
By using a different quantum-to-classical mapping from the Trotter-Suzuki decomposition, we identify the entanglement structure of the maximal eigenvectors for the associated quantum transfer matrix. This observation provides a deeper…
In some cases the state of a quantum system with a large number of subsystems can be approximated efficiently by the density matrix renormalization group, which makes use of redundancies in the description of the state. Here we show that…
The computational complexity of simulating quantum many-body systems generally scales exponentially with the number of particles. This enormous computational cost prohibits first principles simulations of many important problems throughout…
This paper discusses a classical simulation to compute the partition function (or free energy) of generic one-dimensional quantum many-body systems. Many numerical methods have previously been developed to approximately solve…
A major advance in density-matrix renormalization group (DMRG) calculations has been achieved by the invention of highly efficient DMRG techniques for the simulation of real-time dynamics of strongly correlated quantum systems in one…
Quantum magnetism in low dimensions has been one of the central areas of theoretical research for many decades now. One of the key reasons for the long standing interest in this field has been the existence of simplified models, which serve…
Experimental realizations of spin models are irremediably prone to errors, which can propagate through the system corrupting experimental signals. We study how such errors affect the measurement of local observables in systems with…
Quantifying multipartite entanglement in quantum many-body systems and hybrid quantum computing architectures is a fundamental yet challenging task. In recent years, thermodynamic quantities such as the maximum extractable work from an…
The study of many-body quantum dynamics in strongly-correlated systems is extremely challenging. To date few numerical methods exist which are capable of simulating the non-equilibrium dynamics of two-dimensional quantum systems, in part…
The development of novel quantum many-body computational algorithms relies on robust benchmarking. However, generating such benchmarks is often hindered by the massive computational resources required for exact diagonalization or quantum…
We present an efficient strategy for controlling a vast range of non-integrable quantum many body one-dimensional systems that can be merged with state-of-the-art tensor network simulation methods like the density Matrix Renormalization…
We develop a quantum algorithm for estimating the free energy as well as the total Gibbs state of interacting quantum Coulomb gases and molecular systems in dimensions $d \in \{2,3\}$ at finite temperature. These systems lie beyond the…
We show how to simulate numerically both the evolution of 1D quantum systems under dissipation as well as in thermal equilibrium. The method applies to both finite and inhomogeneous systems and it is based on two ideas: (a) a representation…
This paper provides a study and discussion of earlier as well as novel more efficient schemes for the precise evaluation of finite-temperature response functions of strongly correlated quantum systems in the framework of the time-dependent…
We present an algorithm for studying quantum systems at finite temperature using continuous matrix product operator representation. The approach handles both short-range and long-range interactions in the thermodynamic limit without…
The rapid development of quantum computers has enabled demonstrations of quantum advantages on various tasks. However, real quantum systems are always dissipative due to their inevitable interaction with the environment, and the resulting…
Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of a NP-Complete…
In this work, we show how Gibbs or thermal states appear dynamically in closed quantum many-body systems, building on the program of dynamical typicality. We introduce a novel perturbation theorem for physically relevant weak system-bath…
We present an algorithm that prepares thermal Gibbs states of one dimensional quantum systems on a quantum computer without any memory overhead, and in a time significantly shorter than other known alternatives. Specifically, the time…