Inclusion-Exclusion Principle for Open Quantum Systems with Bosonic Bath

• URL: http://arxiv.org/abs/2103.01423v2
• Date: Fri, 7 May 2021 03:36:34 GMT
• Title: Inclusion-Exclusion Principle for Open Quantum Systems with Bosonic Bath
• Authors: Siyao Yang, Zhenning Cai, Jianfeng Lu
• Abstract summary: We present two fast algorithms which apply inclusion-exclusion principle to sum over bosonic diagrams in bare diagrammatic quantum Monte Carlo (dQMC) and inchworm Monte Carlo method, respectively. In the case of inchworm Monte Carlo, the proposed fast algorithm gives an extension to the work ["Inclusion-exclusion principle for many-body diagrammatics", Phys. Rev. B, 98:115152, 2018] from fermionic to bosonic systems.
• Score: 5.989041429080286
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present two fast algorithms which apply inclusion-exclusion principle to sum over the bosonic diagrams in bare diagrammatic quantum Monte Carlo (dQMC) and inchworm Monte Carlo method, respectively. In the case of inchworm Monte Carlo, the proposed fast algorithm gives an extension to the work ["Inclusion-exclusion principle for many-body diagrammatics", Phys. Rev. B, 98:115152, 2018] from fermionic to bosonic systems. We prove that the proposed fast algorithms reduce the computational complexity from double factorial to exponential. Numerical experiments are carried out to verify the theoretical results and to compare the efficiency of the methods.

Related papers

• Bregman-divergence-based Arimoto-Blahut algorithm [53.64687146666141]
  We generalize the Arimoto-Blahut algorithm to a general function defined over Bregman-divergence system. We propose a convex-optimization-free algorithm that can be applied to classical and quantum rate-distortion theory.
  arXiv  Detail & Related papers  (2024-08-10T06:16:24Z)
• 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)
• Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
  Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications. This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
  arXiv  Detail & Related papers  (2023-01-30T15:46:39Z)
• The Bold-Thin-Bold Diagrammatic Monte Carlo Method for Open Quantum Systems [0.0]
  We present two diagrammatic Monte Carlo methods for quantum systems coupled with harmonic baths. The underlying mechanism of the governing equations associated with the two methods lies in the recurrence relation of the path integrals. Compared with the algorithms therein, our methods show better performance in terms of computational efficiency and memory cost.
  arXiv  Detail & Related papers  (2022-05-22T18:17:23Z)
• First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems [88.58409977434269]
  We consider the problem of computing an equilibrium in a class of nonlinear generalized Nash equilibrium problems (NGNEPs) Our contribution is to provide two simple first-order algorithmic frameworks based on the quadratic penalty method and the augmented Lagrangian method. We provide nonasymptotic theoretical guarantees for these algorithms.
  arXiv  Detail & Related papers  (2022-04-07T00:11:05Z)
• Fast Algorithms of Bath Calculations in Simulations of Quantum System-Bath Dynamics [5.989041429080286]
  We present fast algorithms for the summation of Dyson series and the inchworm Monte Carlo method for quantum systems. The algorithms are based on evolving the integro-differential equations where the most expensive part comes from the computation of bath influence functionals. It is proven that the proposed fast algorithms reduce the number of such calculations by a factor of $O(N)$, where $N$ is the total number of time steps.
  arXiv  Detail & Related papers  (2022-02-13T03:00:46Z)
• Quantum algorithm for stochastic optimal stopping problems with applications in finance [60.54699116238087]
  The famous least squares Monte Carlo (LSM) algorithm combines linear least square regression with Monte Carlo simulation to approximately solve problems in optimal stopping theory. We propose a quantum LSM based on quantum access to a process, on quantum circuits for computing the optimal stopping times, and on quantum techniques for Monte Carlo.
  arXiv  Detail & Related papers  (2021-11-30T12:21:41Z)
• Quantum Monte Carlo Integration: The Full Advantage in Minimal Circuit Depth [0.8122270502556371]
  The heart of the proposed method is a series decomposition of the sum that approximates the expectation in Monte Carlo integration. No previous proposal for quantum Monte Carlo integration has achieved all of these at once.
  arXiv  Detail & Related papers  (2021-05-19T12:47:14Z)
• Demystifying Orthogonal Monte Carlo and Beyond [20.745014324028386]
  Orthogonal Monte Carlo (OMC) is a very effective sampling algorithm imposing structural geometric conditions (orthogonality) on samples for variance reduction. We shed new light on the theoretical principles behind OMC, applying theory of negatively dependent random variables to obtain several new concentration results. We propose a novel extensions of the method leveraging number theory techniques and particle algorithms, called Near-Orthogonal Monte Carlo (NOMC)
  arXiv  Detail & Related papers  (2020-05-27T18:44:38Z)

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.