Stochastic modeling of superfluorescence in compact systems

• URL: http://arxiv.org/abs/2312.06537v2
• Date: Wed, 4 Sep 2024 14:19:26 GMT
• Title: Stochastic modeling of superfluorescence in compact systems
• Authors: Stasis Chuchurka, Vladislav Sukharnikov, Andrei Benediktovitch, Nina Rohringer,
• Abstract summary: We propose an approach to describe superfluorescence in compact ensembles of multi-level emitters in the presence of various incoherent processes. We present a series of numerical examples, comparing our solution to exact calculations and discussing the limits of applicability.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose an approach based on stochastic differential equations to describe superfluorescence in compact ensembles of multi-level emitters in the presence of various incoherent processes. This approach has a numerical complexity that does not depend on the number of emitters. The stochastic differential equations are derived directly from the quantum master equation. In this study, we present a series of numerical examples, comparing our solution to exact calculations and discussing the limits of applicability. For many relevant cases, the proposed stochastic differential equations provide accurate results and correctly capture quantum many-body correlation effects.

Related papers

• Solving Fractional Differential Equations on a Quantum Computer: A Variational Approach [0.1492582382799606]
  We introduce an efficient variational hybrid quantum-classical algorithm designed for solving Caputo time-fractional partial differential equations. Our results indicate that solution fidelity is insensitive to the fractional index and that gradient evaluation cost scales economically with the number of time steps.
  arXiv  Detail & Related papers  (2024-06-13T02:27:16Z)
• Understanding Diffusion Models by Feynman's Path Integral [2.4373900721120285]
  We introduce a novel formulation of diffusion models using Feynman's integral path. We find this formulation providing comprehensive descriptions of score-based generative models. We also demonstrate the derivation of backward differential equations and loss functions.
  arXiv  Detail & Related papers  (2024-03-17T16:24:29Z)
• Gaussian Mixture Solvers for Diffusion Models [84.83349474361204]
  We introduce a novel class of SDE-based solvers called GMS for diffusion models. Our solver outperforms numerous SDE-based solvers in terms of sample quality in image generation and stroke-based synthesis.
  arXiv  Detail & Related papers  (2023-11-02T02:05:38Z)
• 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)
• Efficient Quantum Algorithms for Nonlinear Stochastic Dynamical Systems [2.707154152696381]
  We propose efficient quantum algorithms for solving nonlinear differential equations (SDE) via the associated Fokker-Planck equation (FPE) We discretize the FPE in space and time using two well-known numerical schemes, namely Chang-Cooper and implicit finite difference. We then compute the solution of the resulting system of linear equations using the quantum linear systems.
  arXiv  Detail & Related papers  (2023-03-04T17:40:23Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Symbolic Recovery of Differential Equations: The Identifiability Problem [52.158782751264205]
  Symbolic recovery of differential equations is the ambitious attempt at automating the derivation of governing equations. We provide both necessary and sufficient conditions for a function to uniquely determine the corresponding differential equation. We then use our results to devise numerical algorithms aiming to determine whether a function solves a differential equation uniquely.
  arXiv  Detail & Related papers  (2022-10-15T17:32:49Z)
• Decimation technique for open quantum systems: a case study with driven-dissipative bosonic chains [62.997667081978825]
  Unavoidable coupling of quantum systems to external degrees of freedom leads to dissipative (non-unitary) dynamics. We introduce a method to deal with these systems based on the calculation of (dissipative) lattice Green's function. We illustrate the power of this method with several examples of driven-dissipative bosonic chains of increasing complexity.
  arXiv  Detail & Related papers  (2022-02-15T19:00:09Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Solving non-linear Kolmogorov equations in large dimensions by using deep learning: a numerical comparison of discretization schemes [16.067228939231047]
  Non-linear partial differential Kolmogorov equations are successfully used to describe a wide range of time dependent phenomena. Deep learning has been introduced to solve these equations in high-dimensional regimes. We show that, for some discretization schemes, improvements in the accuracy are possible without affecting the observed computational complexity.
  arXiv  Detail & Related papers  (2020-12-09T07:17:26Z)
• Scalable Gradients for Stochastic Differential Equations [40.70998833051251]
  adjoint sensitivity method scalably computes gradients of ordinary differential equations. We generalize this method to differential equations, allowing time-efficient and constant-memory computation. We use our method to fit neural dynamics defined by networks, achieving competitive performance on a 50-dimensional motion capture dataset.
  arXiv  Detail & Related papers  (2020-01-05T23:05:55Z)

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.