Real-time Spin Systems from Lattice Field Theory

• URL: http://arxiv.org/abs/2310.19761v1
• Date: Mon, 30 Oct 2023 17:29:54 GMT
• Title: Real-time Spin Systems from Lattice Field Theory
• Authors: Neill C. Warrington
• Abstract summary: We construct a lattice field theory method for computing the real-time dynamics of spin systems in a thermal bath. We derive a Schwinger-Keldysh path integral for generic spin Hamiltonians, then demonstrate the method on a simple system.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We construct a lattice field theory method for computing the real-time dynamics of spin systems in a thermal bath. This is done by building on previous work of Takano with Schwinger-Keldysh and functional differentiation techniques. We derive a Schwinger-Keldysh path integral for generic spin Hamiltonians, then demonstrate the method on a simple system. Our path integral has a sign problem, which generally requires exponential run time in the system size, but requires only linear storage. The latter may place this method at an advantage over exact diagonalization, which is exponential in both. Our path integral is amenable to contour deformations, a technique for reducing sign problems.

Related papers

• Quantum decoherence in the Caldeira-Leggett model by the real-time path integral on a computer [0.0]
  We propose first-principle calculations of an open system based on the real-time path integral formalism treating the environment as well as the system of our interest together on a computer. We focus on the Caldeira-Leggett model, which is well known, in particular, as a model of quantum decoherence.
  arXiv  Detail & Related papers  (2025-03-26T16:29:38Z)
• Quasi-potential and drift decomposition in stochastic systems by sparse identification [0.0]
  The quasi-potential is a key concept in systems as it accounts for the long-term behavior of the dynamics of such systems. This paper combines a sparse learning technique with action minimization methods in order to determine the quasi-potential. We implement the proposed approach in 2- and 3-D systems, covering various types of potential landscapes and attractors.
  arXiv  Detail & Related papers  (2024-09-10T22:02:15Z)
• A High Order Solver for Signature Kernels [5.899263357689845]
  Signature kernels are at the core of several machine learning algorithms for analysing time series. We introduce new algorithms for the numerical approximation of signature kernels.
  arXiv  Detail & Related papers  (2024-04-01T23:09:52Z)
• Machine learning in and out of equilibrium [58.88325379746631]
  Our study uses a Fokker-Planck approach, adapted from statistical physics, to explore these parallels. We focus in particular on the stationary state of the system in the long-time limit, which in conventional SGD is out of equilibrium. We propose a new variation of Langevin dynamics (SGLD) that harnesses without replacement minibatching.
  arXiv  Detail & Related papers  (2023-06-06T09:12:49Z)
• Third quantization of open quantum systems: new dissipative symmetries and connections to phase-space and Keldysh field theory formulations [77.34726150561087]
  We reformulate the technique of third quantization in a way that explicitly connects all three methods. We first show that our formulation reveals a fundamental dissipative symmetry present in all quadratic bosonic or fermionic Lindbladians. For bosons, we then show that the Wigner function and the characteristic function can be thought of as ''wavefunctions'' of the density matrix.
  arXiv  Detail & Related papers  (2023-02-27T18:56:40Z)
• Simulating scalar field theories on quantum computers with limited resources [62.997667081978825]
  We present a quantum algorithm for implementing $phi4$ lattice scalar field theory on qubit computers. The algorithm allows efficient $phi4$ state preparation for a large range of input parameters in both the normal and broken symmetry phases.
  arXiv  Detail & Related papers  (2022-10-14T17:28:15Z)
• Trajectory Inference via Mean-field Langevin in Path Space [0.17205106391379024]
  Trajectory inference aims at recovering the dynamics of a population from snapshots of its temporal marginals. A min-entropy estimator relative to the Wiener measure in path space was introduced by Lavenant et al.
  arXiv  Detail & Related papers  (2022-05-14T23:13:00Z)
• Adjoint-aided inference of Gaussian process driven differential equations [0.8257490175399691]
  We show how the adjoint of a linear system can be used to efficiently infer forcing functions modelled as GPs. We demonstrate the approach on systems of both ordinary and partial differential equations.
  arXiv  Detail & Related papers  (2022-02-09T17:35:14Z)
• Message Passing Neural PDE Solvers [60.77761603258397]
  We build a neural message passing solver, replacing allally designed components in the graph with backprop-optimized neural function approximators. We show that neural message passing solvers representationally contain some classical methods, such as finite differences, finite volumes, and WENO schemes. We validate our method on various fluid-like flow problems, demonstrating fast, stable, and accurate performance across different domain topologies, equation parameters, discretizations, etc., in 1D and 2D.
  arXiv  Detail & Related papers  (2022-02-07T17:47:46Z)
• A machine learning pipeline for autonomous numerical analytic continuation of Dyson-Schwinger equations [0.0]
  Dyson-Schwinger equations (DSEs) are a non-perturbative way to express n-point functions in quantum field theory. One has to deform the integration contour of the radial component in the complex plane of the loop momentum expressed in hyper-spherical coordinates. Since the nature of Dyson-Schwinger equations is such, that they have to be solved in a self-consistent way, one cannot analyze the analytic properties of the integrand after every step.
  arXiv  Detail & Related papers  (2021-12-24T09:56:42Z)
• Learning Linearized Assignment Flows for Image Labeling [70.540936204654]
  We introduce a novel algorithm for estimating optimal parameters of linearized assignment flows for image labeling. We show how to efficiently evaluate this formula using a Krylov subspace and a low-rank approximation.
  arXiv  Detail & Related papers  (2021-08-02T13:38:09Z)
• On dissipative symplectic integration with applications to gradient-based optimization [77.34726150561087]
  We propose a geometric framework in which discretizations can be realized systematically. We show that a generalization of symplectic to nonconservative and in particular dissipative Hamiltonian systems is able to preserve rates of convergence up to a controlled error.
  arXiv  Detail & Related papers  (2020-04-15T00:36:49Z)

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.