Tree tensor network state approach for solving hierarchical equations of
motion
- URL: http://arxiv.org/abs/2304.05151v2
- Date: Sat, 3 Jun 2023 07:00:57 GMT
- Title: Tree tensor network state approach for solving hierarchical equations of
motion
- Authors: Yaling Ke
- Abstract summary: The hierarchical equations of motion (HEOM) method is a numerically exact open quantum system dynamics approach.
We show that, the proposed HEOM+TTNS approach yields consistent results with that of the conventional HEOM method.
Besides, the simulation with a genuine TTNS is four times faster than a one-dimensional matrix product state decomposition scheme.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The hierarchical equations of motion (HEOM) method is a numerically exact
open quantum system dynamics approach. The method is rooted in an exponential
expansion of the bath correlation function, which in essence strategically
reshapes a continuous environment into a set of effective bath modes that allow
for more efficient cutoff at finite temperatures. Based on this understanding,
one can map the HEOM method into a Schr\"odinger-like equation with a
non-Hermitian super Hamiltonian for an extended wavefunction being the tensor
product of the central system wave function and the Fock state of these
effective bath modes. Recognizing that the system and these effective bath
modes form a star-shaped entanglement structure, in this work, we explore the
possibility of representing the extended wave function as an efficient tree
tensor network state (TTNS), the super Hamiltonian as a tree tensor network
operator of the same structure, as well as the application of a time
propagation algorithm using the time-dependent variational principle. Our
benchmark calculations based on the spin-boson model with a slow-relaxing bath
show that, the proposed HEOM+TTNS approach yields consistent results with that
of the conventional HEOM method, while the computation is considerably sped up
by a factor of a few orders of magnitude. Besides, the simulation with a
genuine TTNS is four times faster than a one-dimensional matrix product state
decomposition scheme.
Related papers
- Optimal Tree Tensor Network Operators for Tensor Network Simulations: Applications to Open Quantum Systems [0.0]
Tree tensor network states (TTNS) decompose the system wavefunction to the product of low-rank tensors.
We present an algorithm that automatically constructs the optimal and exact tree tensor network operators (TTNO) for any sum-of-product symbolic quantum operator.
arXiv Detail & Related papers (2024-07-18T02:15:52Z) - An Optimization-based Deep Equilibrium Model for Hyperspectral Image
Deconvolution with Convergence Guarantees [71.57324258813675]
We propose a novel methodology for addressing the hyperspectral image deconvolution problem.
A new optimization problem is formulated, leveraging a learnable regularizer in the form of a neural network.
The derived iterative solver is then expressed as a fixed-point calculation problem within the Deep Equilibrium framework.
arXiv Detail & Related papers (2023-06-10T08:25:16Z) - D4FT: A Deep Learning Approach to Kohn-Sham Density Functional Theory [79.50644650795012]
We propose a deep learning approach to solve Kohn-Sham Density Functional Theory (KS-DFT)
We prove that such an approach has the same expressivity as the SCF method, yet reduces the computational complexity.
In addition, we show that our approach enables us to explore more complex neural-based wave functions.
arXiv Detail & Related papers (2023-03-01T10:38:10Z) - Efficient low temperature simulations for fermionic reservoirs with the
hierarchical equations of motion method: Application to the Anderson impurity
model [0.0]
In this work, we employ the barycentric representation to approximate the Fermi function and hybridization functions in the frequency domain.
The new method, by approxing these functions with optimized rational decomposition, greatly reduces the number of basis functions in decomposing the reservoir correlation functions.
We demonstrate the efficiency, accuracy, and long-time stability of the new decomposition scheme by applying it to the Anderson impurity model (AIM) in the low-temperature regime.
arXiv Detail & Related papers (2022-11-08T08:46:23Z) - Neural Basis Functions for Accelerating Solutions to High Mach Euler
Equations [63.8376359764052]
We propose an approach to solving partial differential equations (PDEs) using a set of neural networks.
We regress a set of neural networks onto a reduced order Proper Orthogonal Decomposition (POD) basis.
These networks are then used in combination with a branch network that ingests the parameters of the prescribed PDE to compute a reduced order approximation to the PDE.
arXiv Detail & Related papers (2022-08-02T18:27:13Z) - An application of the splitting-up method for the computation of a
neural network representation for the solution for the filtering equations [68.8204255655161]
Filtering equations play a central role in many real-life applications, including numerical weather prediction, finance and engineering.
One of the classical approaches to approximate the solution of the filtering equations is to use a PDE inspired method, called the splitting-up method.
We combine this method with a neural network representation to produce an approximation of the unnormalised conditional distribution of the signal process.
arXiv Detail & Related papers (2022-01-10T11:01:36Z) - A Multisite Decomposition of the Tensor Network Path Integrals [0.0]
We extend the tensor network path integral (TNPI) framework to efficiently simulate quantum systems with local dissipative environments.
The MS-TNPI method is useful for studying a variety of extended quantum systems coupled with solvents.
arXiv Detail & Related papers (2021-09-20T17:55:53Z) - Constructing Tensor Network Influence Functionals for General Quantum
Dynamics [0.0]
We use a space-time tensor network representation of the influence functional and investigate its approximability in terms of the bond dimensions and time-like entanglement.
We find that the influence functional and the intermediates involved in its construction can be efficiently approximated by low bond dimension tensor networks in certain dynamical regimes.
As one iteratively integrates out the bath, the correlations in the influence functional can first increase before decreasing, indicating that the final compressibility of the influence functional is achieved via non-trivial cancellation.
arXiv Detail & Related papers (2021-01-14T05:42:25Z) - Fast and differentiable simulation of driven quantum systems [58.720142291102135]
We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods.
We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
arXiv Detail & Related papers (2020-12-16T21:43:38Z) - Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with
an artificial neural-network correlator ansatz [62.997667081978825]
We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei.
We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
arXiv Detail & Related papers (2020-07-28T14:52:28Z) - Efficient variational contraction of two-dimensional tensor networks
with a non-trivial unit cell [0.0]
tensor network states provide an efficient class of states that faithfully capture strongly correlated quantum models and systems.
We generalize a recently proposed variational uniform matrix product state algorithm for capturing one-dimensional quantum lattices.
A key property of the algorithm is a computational effort that scales linearly rather than exponentially in the size of the unit cell.
arXiv Detail & Related papers (2020-03-02T19:01:06Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.