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

Improvements of the local bosonic algorithm

Beat Jegerlehner

Published Jan 1, 1996• 2 citations
OpenAlex

Abstract

We report on several improvements of the local bosonic algorithm proposed by M. Luescher. We find that preconditioning and over-relaxation works very well. A detailed comparison between the bosonic and the Kramers-algorithms shows comparable performance for the physical situation examined.

Related papers

Numerical ansatz for solving integro-differential equations with increasingly smooth memory kernels: spin-boson model and beyond

Michael P. Zwolak

We present an efficient and stable numerical ansatz for solving a class of integro-differential equations. We define the class as integro-differential equations with increasingly smooth memory kernels. The resulting algorithm reduces the computational cost from the usual T^2 to T*C(T), where T is the total simulation time and C(T) is some function. For instance, C(T) is equal to lnT for polynomially decaying memory kernels. Due to the common occurrence of increasingly smooth memory kernels in physical, chemical, and biological systems, the algorithm can be applied in quite a wide variety of situations. We demonstrate the performance of the algorithm by examining two cases. First, we compare the algorithm to a typical numerical procedure for a simple integro-differential equation. Second, we solve the NIBA equations for the spin-boson model in real time.

arXiv:cond-mat/0611412•Nov 15, 2006•0 citations

Exact reformulation of the bosonic many-body problem in terms of stochastic wavefunctions : convergences issues

Iacopo Carusotto, Yvan Castin

•Jan 1, 2003•0 citations

Numerical ansatz for solving integro-differential equations with increasingly smooth memory kernels: spin-boson model and beyond

Michael P. Zwolak

We present an efficient and stable numerical ansatz for solving a class of integro-differential equations. We define the class as integro-differential equations with increasingly smooth memory kernels. The resulting algorithm reduces the computational cost from the usual T 2 to T C ( T ), where T is the total simulation time and C ( T ) is some function. For instance, C ( T ) is equal to ln T for polynomially decaying memory kernels. Due to the common occurrence of increasingly smooth memory kernels in physical, chemical and biological systems, the algorithm can be applied in quite a wide variety of situations. We demonstrate the performance of the algorithm by examining two cases. Firstly, we compare the algorithm to a typical numerical procedure for a simple integro-differential equation. Secondly, we solve the non-interacting blip approximation equations for the spin-boson model in real time.

Computational Science & Discovery•Nov 20, 2008•9 citations

Discretization of Bosonic System

Masahito Hayashi

Springer eBooks•Nov 18, 2016•0 citations

Engineering local optimality in quantum Monte Carlo algorithms

Lode Pollet, Kris Van Houcke, Stefan Rombouts

arXiv:cond-mat/0508462•Journal of Computational Physics•Mar 29, 2007•65 citations

Quantum-Based Constraint Relaxation for Optimization Problems

Jincheng Zhang

Quantum-based constraint relaxation is a novel approach to solving optimization problems, offering the potential for significantly faster and more accurate solutions compared to classical methods. This paper explores the application of quantum annealing and quantum simulation to iteratively refine constraints, thereby accelerating the optimization process. We detail the underlying principles of these quantum algorithms, present a framework for implementing them, and discuss the potential benefits and challenges of this approach. The core claim is that quantum-based constraint relaxation can dramatically improve the performance of optimization algorithms.

•Sep 7, 2026•0 citations
We present an efficient and stable numerical ansatz for solving a class of integro-differential equations. We define the class as integro-differential equations with increasingly smooth memory kernels. The resulting algorithm reduces the computational cost from the usual T^2 to T*C(T), where T is the total simulation time and C(T) is some function. For instance, C(T) is equal to lnT for polynomially decaying memory kernels. Due to the common occurrence of increasingly smooth memory kernels in physical, chemical, and biological systems, the algorithm can be applied in quite a wide variety of situations. We demonstrate the performance of the algorithm by examining two cases. First, we compare the algorithm to a typical numerical procedure for a simple integro-differential equation. Second, we solve the NIBA equations for the spin-boson model in real time.
We present an efficient and stable numerical ansatz for solving a class of integro-differential equations. We define the class as integro-differential equations with increasingly smooth memory kernels. The resulting algorithm reduces the computational cost from the usual T 2 to T C ( T ), where T is the total simulation time and C ( T ) is some function. For instance, C ( T ) is equal to ln T for polynomially decaying memory kernels. Due to the common occurrence of increasingly smooth memory kernels in physical, chemical and biological systems, the algorithm can be applied in quite a wide variety of situations. We demonstrate the performance of the algorithm by examining two cases. Firstly, we compare the algorithm to a typical numerical procedure for a simple integro-differential equation. Secondly, we solve the non-interacting blip approximation equations for the spin-boson model in real time.
Quantum-based constraint relaxation is a novel approach to solving optimization problems, offering the potential for significantly faster and more accurate solutions compared to classical methods. This paper explores the application of quantum annealing and quantum simulation to iteratively refine constraints, thereby accelerating the optimization process. We detail the underlying principles of these quantum algorithms, present a framework for implementing them, and discuss the potential benefits and challenges of this approach. The core claim is that quantum-based constraint relaxation can dramatically improve the performance of optimization algorithms.