Simulation of Spin Chains with off-diagonal Coupling Using Inchworm Method
- URL: http://arxiv.org/abs/2407.04365v1
- Date: Fri, 5 Jul 2024 09:07:39 GMT
- Title: Simulation of Spin Chains with off-diagonal Coupling Using Inchworm Method
- Authors: Yixiao Sun, Geshuo Wang, Zhenning Cai,
- Abstract summary: We study the dynamical simulation of open quantum spin chain with nearest neighboring coupling, where each spin in the chain is associated with a harmonic bath.
To reduce computational and memory cost in long time simulation, we apply tensor-train representation to efficiently represent the reduced density matrix of the spin chains.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We study the dynamical simulation of open quantum spin chain with nearest neighboring coupling, where each spin in the chain is associated with a harmonic bath. This is an extension of our previous work [G. Wang and Z. Cai, J. Chem. Theory Comput., 19, 8523--8540, 2023] by generalizing the application of the inchworm method and the technique of modular path integrals from diagonally coupled cases to off-diagonally coupled cases. Additionally, to reduce computational and memory cost in long time simulation, we apply tensor-train representation to efficiently represent the reduced density matrix of the spin chains, and employ the transfer tensor method (TTM) to avoid exponential growth of computational cost with respect to time. Abundant numerical experiments are performed to validate our method.
Related papers
- Path integral Monte Carlo in a discrete variable representation with Gibbs sampling: dipolar planar rotor chain [0.0]
We propose a Path Integral Monte Carlo (PIMC) approach based on discretized continuous degrees of freedom and rejection-free Gibbs sampling.
We show that using Gibbs sampling is advantageous compared to traditional Metroplolis-Hastings rejection importance sampling.
arXiv Detail & Related papers (2024-10-17T15:04:39Z) - von Mises Quasi-Processes for Bayesian Circular Regression [57.88921637944379]
We explore a family of expressive and interpretable distributions over circle-valued random functions.
The resulting probability model has connections with continuous spin models in statistical physics.
For posterior inference, we introduce a new Stratonovich-like augmentation that lends itself to fast Markov Chain Monte Carlo sampling.
arXiv Detail & Related papers (2024-06-19T01:57:21Z) - Real-Time Simulation of Open Quantum Spin Chains with Inchworm Method [0.0]
We study the real-time simulation of open quantum systems, where the system is modeled by a spin chain, with each spin associated with its own harmonic bath.
Our method couples the inchworm method for the spin-boson model and the modular path integral methodology for spin systems.
arXiv Detail & Related papers (2023-07-08T07:46:39Z) - Non-Parametric Learning of Stochastic Differential Equations with Non-asymptotic Fast Rates of Convergence [65.63201894457404]
We propose a novel non-parametric learning paradigm for the identification of drift and diffusion coefficients of non-linear differential equations.
The key idea essentially consists of fitting a RKHS-based approximation of the corresponding Fokker-Planck equation to such observations.
arXiv Detail & Related papers (2023-05-24T20:43:47Z) - 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) - Sampling with Mollified Interaction Energy Descent [57.00583139477843]
We present a new optimization-based method for sampling called mollified interaction energy descent (MIED)
MIED minimizes a new class of energies on probability measures called mollified interaction energies (MIEs)
We show experimentally that for unconstrained sampling problems our algorithm performs on par with existing particle-based algorithms like SVGD.
arXiv Detail & Related papers (2022-10-24T16:54:18Z) - Solving the time-independent Schr\"odinger equation for chains of
coupled excitons and phonons using tensor trains [0.0]
We demonstrate how to apply the tensor-train format to solve the time-independent Schr"odinger equation.
We also investigate uncoupled problems for which (semi-)analytical results exist.
arXiv Detail & Related papers (2021-09-30T13:08:19Z) - Sampling in Combinatorial Spaces with SurVAE Flow Augmented MCMC [83.48593305367523]
Hybrid Monte Carlo is a powerful Markov Chain Monte Carlo method for sampling from complex continuous distributions.
We introduce a new approach based on augmenting Monte Carlo methods with SurVAE Flows to sample from discrete distributions.
We demonstrate the efficacy of our algorithm on a range of examples from statistics, computational physics and machine learning, and observe improvements compared to alternative algorithms.
arXiv Detail & Related papers (2021-02-04T02:21:08Z) - Phase-Space Methods for Simulating the Dissipative Many-Body Dynamics of
Collective Spin Systems [0.0]
We describe an efficient numerical method for simulating the dynamics and steady states of collective spin systems in the presence of dephasing and decay.
We benchmark this numerical technique for known superradiant decay and spin-squeezing processes and illustrate its application for the simulation of non-equilibrium phase transitions in dissipative spin lattice models.
arXiv Detail & Related papers (2020-11-19T19:00:00Z) - Tensor lattice field theory with applications to the renormalization
group and quantum computing [0.0]
We discuss the successes and limitations of statistical sampling for a sequence of models studied in the context of lattice QCD.
We show that these lattice models can be reformulated using tensorial methods where the field integrations in the path-integral formalism are replaced by discrete sums.
We derive Hamiltonians suitable to perform quantum simulation experiments, for instance using cold atoms, or to be programmed on existing quantum computers.
arXiv Detail & Related papers (2020-10-13T16:46:34Z) - Controllable Orthogonalization in Training DNNs [96.1365404059924]
Orthogonality is widely used for training deep neural networks (DNNs) due to its ability to maintain all singular values of the Jacobian close to 1.
This paper proposes a computationally efficient and numerically stable orthogonalization method using Newton's iteration (ONI)
We show that our method improves the performance of image classification networks by effectively controlling the orthogonality to provide an optimal tradeoff between optimization benefits and representational capacity reduction.
We also show that ONI stabilizes the training of generative adversarial networks (GANs) by maintaining the Lipschitz continuity of a network, similar to spectral normalization (
arXiv Detail & Related papers (2020-04-02T10:14:27Z)
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.