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

arXiv:2201.00806

Tensor-Network Approach to Work Statistics for 1D Quantum Lattice Systems

Jiayin Gu, Fan Zhang, H. T. Quan

Published Jan 3, 2022• 0 citations
arXivHTMLPDF

Abstract

We introduce a numerical approach to calculate the statistics of work done on 1D quantum lattice systems initially prepared in thermal equilibrium states. This approach is based on two tensor-network techniques: Time Evolving Block Decimation (TEBD) and Minimally Entangled Typical Thermal States (METTS). The former is an efficient algorithm used to simulate the dynamics of 1D quantum lattice systems, while the latter a finite-temperature algorithm for generating a set of typical states representing the Gibbs canonical ensemble. As an illustrative example, we apply this approach to the Ising chain in mixed transverse and longitudinal fields. Under an arbitrary protocol, the moment generating function of the work can be obtained, from which the work moments are numerically calculated and the quantum Jarzynski equality can be tested. Moreover, the numerical approach is also adapted to test the universal quantum work relation involving a functional of an arbitrary observable.

DOI
10.48550/arxiv.2201.00806

Related papers

Tensor-network approach to work statistics for one-dimensional quantum lattice systems

Jiayin Gu, Fan Zhang, H. T. Quan

We introduce a tensor-network approach to calculate the statistics of work done on one-dimensional quantum lattice systems initially prepared in thermal equilibrium states. In this approach, the dynamics is simulated with time-evolving block decimation (TEBD), and the initial thermal equilibrium state is prepared either directly with TEBD or with minimally entangled typical thermal states, which generates a set of typical states representing the Gibbs canonical ensemble. As an illustrative example, we apply this approach to the Ising chain in mixed transverse and longitudinal fields. Under a prescribed protocol, the moment generating function for work distribution can be calculated, from which the quantum Jarzynski equality and the generalized quantum work relation involving a functional of an arbitrary observable are tested.

Physical Review Research•Sep 12, 2022•3 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

Infinite time-evolving block decimation algorithm beyond unitary evolution

Román Orús, Guifré Vidal

The infinite time-evolving block decimation algorithm [G. Vidal, Phys. Rev. Lett. 98, 070201 (2007)] allows to simulate unitary evolution and to compute the ground state of one-dimensional (1D) quantum lattice systems in the thermodynamic limit. Here we extend the algorithm to tackle a much broader class of problems, namely, the simulation of arbitrary one-dimensional evolution operators that can be expressed as a (translationally invariant) tensor network. Relatedly, we also address the problem of finding the dominant eigenvalue and eigenvector of a one-dimensional transfer matrix that can be expressed in the same way. New applications include the simulation, in the thermodynamic limit, of open (i.e., master equation) dynamics and thermal states in 1D quantum systems, as well as calculations with partition functions in two-dimensional (2D) classical systems, on which we elaborate. The present extension of the algorithm also plays a prominent role in the infinite projected entangled-pair states approach to infinite 2D quantum lattice systems.

arXiv:0711.3960•Physical Review B•Oct 14, 2008•466 citations

Minimally entangled typical thermal state algorithms for finite temperature Matsubara Green functions

Daniel Bauernfeind, Xiaodong Cao, Edwin Miles Stoudenmire +1 more

We extend finite temperature tensor network methods to compute Matsubara imaginary time correlation functions, building on the minimally entangled typical thermal states (METTS) and purification algorithms. While imaginary time correlation functions are straightforward to formulate with these methods, care is needed to avoid convergence issues that would result from naive estimators. As a benchmark, we study the single-band Anderson impurity model, even though the algorithm is quite general and applies to lattice models. The special structure of the impurity model benchmark system and our choice of basis enable techniques such as the reuse of high-probability METTS for increasing algorithm efficiency. The results are competitive with state-of-the-art continuous-time Monte Carlo. We discuss the behavior of computation time and error as a function of the number of purified sites in the Hamiltonian.

arXiv:2107.13941•Physical review. B./Physical review. B•May 6, 2022•3 citations

Minimally entangled typical thermal states with auxiliary matrix-product-state bases

Chia-Min Chung, Ulrich Schollwöck

Finite temperature problems in the strong correlated systems are important but challenging tasks. Minimally entangled typical thermal states (METTS) are a powerful method in the framework of tensor network methods to simulate finite temperature systems, including Fermions and frustrated spins which introduce a sign problem in the typical Monte Carlo methods. In this work, we introduce an extension of the METTS algorithm by using a new basis, the auxiliary matrix product state. This new basis achieves the pre-summation process in the partition function, and thus improve the convergence in the Monte Carlo samplings. The method also has the advantage of simulating the grand canonical ensemble in a computationally efficient way by employing good quantum numbers. We benchmark our method on the spin-$1/2$ XXZ model on the triangular lattice, and show that the new method outperforms the original METTS as well as the purification methods at sufficiently low temperature, the usual range of applications of METTS. The new method also naturally connects the METTS method to the purification method.

arXiv:1910.03329•Oct 8, 2019•2 citations

Simulation of Matrix Product States For Dissipation and Thermalization Dynamics of Open Quantum Systems

Souvik Agasti

Abstract We transform the system/reservoir coupling model into a one-dimensional semi-infinite discrete chain through unitary transformation to simulate the open quantum system numerically with the help of time evolving block decimation (TEBD) algorithm. We apply the method to study the dynamics of dissipative systems. We also generate the thermal state of a multimode bath using minimally entangled typical thermal state (METTS) algorithm, and investigate the impact of the thermal bath on an empty system. For both cases, we give an extensive analysis of the impact of the modeling and simulation parameters, and compare the numerics with the analytics.

Journal of Physics Communications•Dec 12, 2019•8 citations
We introduce a numerical approach to calculate the statistics of work done on 1D quantum lattice systems initially prepared in thermal equilibrium states. This approach is based on two tensor-network techniques: Time Evolving Block Decimation (TEBD) and Minimally Entangled Typical Thermal States (METTS). The former is an efficient algorithm used to simulate the dynamics of 1D quantum lattice systems, while the latter a finite-temperature algorithm for generating a set of typical states representing the Gibbs canonical ensemble. As an illustrative example, we apply this approach to the Ising chain in mixed transverse and longitudinal fields. Under an arbitrary protocol, the moment generating function of the work can be obtained, from which the work moments are numerically calculated and the quantum Jarzynski equality can be tested. Moreover, the numerical approach is also adapted to test the universal quantum work relation involving a functional of an arbitrary observable.
We introduce a tensor-network approach to calculate the statistics of work done on one-dimensional quantum lattice systems initially prepared in thermal equilibrium states. In this approach, the dynamics is simulated with time-evolving block decimation (TEBD), and the initial thermal equilibrium state is prepared either directly with TEBD or with minimally entangled typical thermal states, which generates a set of typical states representing the Gibbs canonical ensemble. As an illustrative example, we apply this approach to the Ising chain in mixed transverse and longitudinal fields. Under a prescribed protocol, the moment generating function for work distribution can be calculated, from which the quantum Jarzynski equality and the generalized quantum work relation involving a functional of an arbitrary observable are tested.
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.
The infinite time-evolving block decimation algorithm [G. Vidal, Phys. Rev. Lett. 98, 070201 (2007)] allows to simulate unitary evolution and to compute the ground state of one-dimensional (1D) quantum lattice systems in the thermodynamic limit. Here we extend the algorithm to tackle a much broader class of problems, namely, the simulation of arbitrary one-dimensional evolution operators that can be expressed as a (translationally invariant) tensor network. Relatedly, we also address the problem of finding the dominant eigenvalue and eigenvector of a one-dimensional transfer matrix that can be expressed in the same way. New applications include the simulation, in the thermodynamic limit, of open (i.e., master equation) dynamics and thermal states in 1D quantum systems, as well as calculations with partition functions in two-dimensional (2D) classical systems, on which we elaborate. The present extension of the algorithm also plays a prominent role in the infinite projected entangled-pair states approach to infinite 2D quantum lattice systems.
We extend finite temperature tensor network methods to compute Matsubara imaginary time correlation functions, building on the minimally entangled typical thermal states (METTS) and purification algorithms. While imaginary time correlation functions are straightforward to formulate with these methods, care is needed to avoid convergence issues that would result from naive estimators. As a benchmark, we study the single-band Anderson impurity model, even though the algorithm is quite general and applies to lattice models. The special structure of the impurity model benchmark system and our choice of basis enable techniques such as the reuse of high-probability METTS for increasing algorithm efficiency. The results are competitive with state-of-the-art continuous-time Monte Carlo. We discuss the behavior of computation time and error as a function of the number of purified sites in the Hamiltonian.
Finite temperature problems in the strong correlated systems are important but challenging tasks. Minimally entangled typical thermal states (METTS) are a powerful method in the framework of tensor network methods to simulate finite temperature systems, including Fermions and frustrated spins which introduce a sign problem in the typical Monte Carlo methods. In this work, we introduce an extension of the METTS algorithm by using a new basis, the auxiliary matrix product state. This new basis achieves the pre-summation process in the partition function, and thus improve the convergence in the Monte Carlo samplings. The method also has the advantage of simulating the grand canonical ensemble in a computationally efficient way by employing good quantum numbers. We benchmark our method on the spin-1/21/21/2 XXZ model on the triangular lattice, and show that the new method outperforms the original METTS as well as the purification methods at sufficiently low temperature, the usual range of applications of METTS. The new method also naturally connects the METTS method to the purification method.
Abstract We transform the system/reservoir coupling model into a one-dimensional semi-infinite discrete chain through unitary transformation to simulate the open quantum system numerically with the help of time evolving block decimation (TEBD) algorithm. We apply the method to study the dynamics of dissipative systems. We also generate the thermal state of a multimode bath using minimally entangled typical thermal state (METTS) algorithm, and investigate the impact of the thermal bath on an empty system. For both cases, we give an extensive analysis of the impact of the modeling and simulation parameters, and compare the numerics with the analytics.