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:2407.04365 · Journal of Chemical Theory and Computation

Simulation of Spin Chains with Off-Diagonal Coupling Using the Inchworm Method

Yixiao Sun, Geshuo Wang, Zhenning Cai

Published Oct 18, 2024• 6 citations
arXivHTMLPDF

Abstract

We study the dynamical simulation of an 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 (Wang, G.; Cai, Z. J. Chem. Theory Comput. 2023, 19, 8523–8540) 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.

DOI
10.1021/acs.jctc.4c00864

Related papers

Real-Time Simulation of Open Quantum Spin Chains with the Inchworm Method

Geshuo Wang, Zhenning Cai

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. In particular, the introduction of the inchworm method can significantly suppress the numerical sign problem. Both methods are tweaked to make them work seamlessly with each other. We represent our approach in the language of diagrammatic methods and analyze the asymptotic behavior of the computational cost. Extensive numerical experiments are performed to validate our method.

arXiv:2307.03924•Journal of Chemical Theory and Computation•Dec 1, 2023•10 citations

Inchworm tensor train hybridization expansion quantum impurity solver

Yang Yu, André Erpenbeck, Dominika Zgid +3 more

The investigation of quantum impurity models plays a crucial role in condensed matter physics because of their wide-ranging applications, such as embedding theories and transport problems. Traditional methods often fall short in producing accurate results for multi-orbital systems with complex interactions and off-diagonal hybridizations. Recently, tensor-train-based integration and summation techniques have shown promise as effective alternatives. In this study, we use tensor train methods to tackle quantum impurity problems formulated within the imaginary-time inchworm hybridization expansion framework. We identify key challenges in the inchworm expansion itself and its interplay with tensor-train-based methods. We demonstrate the accuracy and versatility of our approach by solving general quantum impurity problems. Our results suggest that tensor-train decomposition schemes offer a viable path toward accurate and efficient multi-orbital impurity solvers.

arXiv:2505.16117•Physical review. B./Physical review. B•Jul 28, 2025•2 citations

The Bold-Thin-Bold Diagrammatic Monte Carlo Method for Open Quantum Systems

Zhenning Cai, Geshuo Wang, Siyao Yang

Abstract. We present two diagrammatic Monte Carlo methods for quantum systems coupled with harmonic baths, whose dynamics are described by integro-differential equations. The first approach can be considered as a reformulation of the Dyson series, and the second one, called “bold-thin-bold diagrammatic Monte Carlo,” is based on resummation of the diagrams in the Dyson series to accelerate its convergence. The underlying mechanism of the governing equations associated with the two methods lies in the recurrence relation of the path integrals, which is the most costly part in the numerical methods. The proposed algorithms give an extension to the work of Cai, Lu, and Yang [ Comput. Phys. Commun. 278 (2022), 108417], where the algorithms are designed based on reusing the previous calculations of bath influence functionals. Compared with the algorithms therein, our methods further include the reuse of system-associated functionals and show better performance in terms of computational efficiency and memory cost. We demonstrate the two methods in the framework of spin-boson model, and numerical experiments are carried out to verify the validity of the methods.

arXiv:2205.10896•SIAM Journal on Scientific Computing•Jul 19, 2023•11 citations

Quantum dynamics of coupled excitons and phonons in chain-like systems: tensor train approaches and higher-order propagators

Patrick Gelß, Sebastian Matera, Rupert Klein +1 more

We investigate tensor-train approaches to the solution of the time-dependent Schrödinger equation for chain-like quantum systems with on-site and nearest-neighbor interactions only. Using efficient low-rank tensor train representations, we aim at reducing memory consumption and computational costs. As an example, coupled excitons and phonons modeled in terms of Fröhlich-Holstein type Hamiltonians are studied here. By comparing our tensor-train based results with semi-analytical results, we demonstrate the key role of the ranks of the quantum state vectors. Typically, an excellent quality of the solutions is found only when the maximum number of ranks exceeds a certain value. One class of propagation schemes builds on splitting the Hamiltonian into two groups of interleaved nearest-neighbor interactions commutating within each of the groups. In particular, the 4-th order Yoshida-Neri and the 8-th order Kahan-Li symplectic composition yield results close to machine precision. Similar results are found for 4-th and 8-th order global Krylov scheme. However, the computational effort currently restricts the use of these four propagators to rather short chains which also applies to propagators based on the time-dependent variational principle, typically used for matrix product states. Yet another class of propagators involves explicit, time-symmetrized Euler integrators. Especially the 4-th order variant is recommended for quantum simulations of longer chains, even though the high precision of the splitting schemes cannot be reached. Moreover, the scaling of the computational effort with the dimensions of the local Hilbert spaces is much more favorable for the differencing than for splitting or variational schemes.

arXiv:2302.03568•Feb 7, 2023•1 citation

Communication: Quantum dynamics in classical spin baths

Alessandro Sergi

A formalism for studying the dynamics of quantum systems embedded in classical spin baths is introduced. The theory is based on generalized antisymmetric brackets and predicts the presence of open-path off-diagonal geometric phases in the evolution of the density matrix. The weak coupling limit of the equation can be integrated by standard algorithms and provides a non-Markovian approach to the computer simulation of quantum systems in classical spin environments. It is expected that the theory and numerical schemes presented here have a wide applicability.

arXiv:1306.3299•The Journal of Chemical Physics•Jul 16, 2013•8 citations

Quantum dynamics of coupled excitons and phonons in chain-like systems: Tensor train approaches and higher-order propagators

Patrick Gelß, Sebastian Matera, Rupert Klein +1 more

We investigate tensor-train approaches to the solution of the time-dependent Schrödinger equation for chain-like quantum systems with on-site and nearest-neighbor interactions only. Using efficient low-rank tensor train representations, we aim at reducing memory consumption and computational costs. As an example, coupled excitons and phonons modeled in terms of Fröhlich-Holstein type Hamiltonians are studied here. By comparing our tensor-train-based results with semi-analytical results, we demonstrate the key role of the ranks of the quantum state vectors. Typically, an excellent quality of solutions is found only when the maximum number of ranks exceeds a certain value. One class of propagation schemes builds on splitting the Hamiltonian into two groups of interleaved nearest-neighbor interactions commutating within each of the groups. In particular, the fourth-order Yoshida-Neri and the eighth-order Kahan-Li symplectic composition yield results close to machine precision. Similar results are found for fourth and eighth order global Krylov scheme. However, the computational effort currently restricts the use of these four propagators to rather short chains, which also applies to propagators based on the time-dependent variational principle, typically used for matrix product states. Yet, another class of propagators involves explicit, time-symmetrized Euler integrators. Especially, the fourth-order variant is recommended for quantum simulations of longer chains, even though the high precision of the splitting schemes cannot be reached. Moreover, the scaling of the computational effort with the dimensions of the local Hilbert spaces is much more favorable for the differencing than for splitting or variational schemes.

The Journal of Chemical Physics•Apr 21, 2025•2 citations
We study the dynamical simulation of an 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 (Wang, G.; Cai, Z. J. Chem. Theory Comput. 2023, 19, 8523–8540) 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.
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. In particular, the introduction of the inchworm method can significantly suppress the numerical sign problem. Both methods are tweaked to make them work seamlessly with each other. We represent our approach in the language of diagrammatic methods and analyze the asymptotic behavior of the computational cost. Extensive numerical experiments are performed to validate our method.
The investigation of quantum impurity models plays a crucial role in condensed matter physics because of their wide-ranging applications, such as embedding theories and transport problems. Traditional methods often fall short in producing accurate results for multi-orbital systems with complex interactions and off-diagonal hybridizations. Recently, tensor-train-based integration and summation techniques have shown promise as effective alternatives. In this study, we use tensor train methods to tackle quantum impurity problems formulated within the imaginary-time inchworm hybridization expansion framework. We identify key challenges in the inchworm expansion itself and its interplay with tensor-train-based methods. We demonstrate the accuracy and versatility of our approach by solving general quantum impurity problems. Our results suggest that tensor-train decomposition schemes offer a viable path toward accurate and efficient multi-orbital impurity solvers.
Abstract. We present two diagrammatic Monte Carlo methods for quantum systems coupled with harmonic baths, whose dynamics are described by integro-differential equations. The first approach can be considered as a reformulation of the Dyson series, and the second one, called “bold-thin-bold diagrammatic Monte Carlo,” is based on resummation of the diagrams in the Dyson series to accelerate its convergence. The underlying mechanism of the governing equations associated with the two methods lies in the recurrence relation of the path integrals, which is the most costly part in the numerical methods. The proposed algorithms give an extension to the work of Cai, Lu, and Yang [ Comput. Phys. Commun. 278 (2022), 108417], where the algorithms are designed based on reusing the previous calculations of bath influence functionals. Compared with the algorithms therein, our methods further include the reuse of system-associated functionals and show better performance in terms of computational efficiency and memory cost. We demonstrate the two methods in the framework of spin-boson model, and numerical experiments are carried out to verify the validity of the methods.
We investigate tensor-train approaches to the solution of the time-dependent Schrödinger equation for chain-like quantum systems with on-site and nearest-neighbor interactions only. Using efficient low-rank tensor train representations, we aim at reducing memory consumption and computational costs. As an example, coupled excitons and phonons modeled in terms of Fröhlich-Holstein type Hamiltonians are studied here. By comparing our tensor-train based results with semi-analytical results, we demonstrate the key role of the ranks of the quantum state vectors. Typically, an excellent quality of the solutions is found only when the maximum number of ranks exceeds a certain value. One class of propagation schemes builds on splitting the Hamiltonian into two groups of interleaved nearest-neighbor interactions commutating within each of the groups. In particular, the 4-th order Yoshida-Neri and the 8-th order Kahan-Li symplectic composition yield results close to machine precision. Similar results are found for 4-th and 8-th order global Krylov scheme. However, the computational effort currently restricts the use of these four propagators to rather short chains which also applies to propagators based on the time-dependent variational principle, typically used for matrix product states. Yet another class of propagators involves explicit, time-symmetrized Euler integrators. Especially the 4-th order variant is recommended for quantum simulations of longer chains, even though the high precision of the splitting schemes cannot be reached. Moreover, the scaling of the computational effort with the dimensions of the local Hilbert spaces is much more favorable for the differencing than for splitting or variational schemes.
A formalism for studying the dynamics of quantum systems embedded in classical spin baths is introduced. The theory is based on generalized antisymmetric brackets and predicts the presence of open-path off-diagonal geometric phases in the evolution of the density matrix. The weak coupling limit of the equation can be integrated by standard algorithms and provides a non-Markovian approach to the computer simulation of quantum systems in classical spin environments. It is expected that the theory and numerical schemes presented here have a wide applicability.
We investigate tensor-train approaches to the solution of the time-dependent Schrödinger equation for chain-like quantum systems with on-site and nearest-neighbor interactions only. Using efficient low-rank tensor train representations, we aim at reducing memory consumption and computational costs. As an example, coupled excitons and phonons modeled in terms of Fröhlich-Holstein type Hamiltonians are studied here. By comparing our tensor-train-based results with semi-analytical results, we demonstrate the key role of the ranks of the quantum state vectors. Typically, an excellent quality of solutions is found only when the maximum number of ranks exceeds a certain value. One class of propagation schemes builds on splitting the Hamiltonian into two groups of interleaved nearest-neighbor interactions commutating within each of the groups. In particular, the fourth-order Yoshida-Neri and the eighth-order Kahan-Li symplectic composition yield results close to machine precision. Similar results are found for fourth and eighth order global Krylov scheme. However, the computational effort currently restricts the use of these four propagators to rather short chains, which also applies to propagators based on the time-dependent variational principle, typically used for matrix product states. Yet, another class of propagators involves explicit, time-symmetrized Euler integrators. Especially, the fourth-order variant is recommended for quantum simulations of longer chains, even though the high precision of the splitting schemes cannot be reached. Moreover, the scaling of the computational effort with the dimensions of the local Hilbert spaces is much more favorable for the differencing than for splitting or variational schemes.