Related papers: Optimisation based algorithm for finding the actio…
We present an algorithm to analyze numerically the bounce solution of first-order phase transitions. Our approach is well suited to treat phase transitions with several fields. The algorithm consists of two parts. In the first part the…
We are launching FindBounce, a Mathematica package for the evaluation of the Euclidean bounce action that enters the decay rate of metastable states in quantum and thermal field theories. It is based on the idea of polygonal bounces, which…
The computation of bounce action in a phase transition involves solving partial differential equations, inherently introducing non-negligible numerical uncertainty. Deriving characteristic temperatures and properties of this transition…
We present SimpleBounce, a C++ package for finding the bounce solution for the false vacuum decay. This package is based on a flow equation which is proposed by the author and solves Coleman-Glaser-Martin's reduced problem: the minimization…
We provide several quantum algorithms for continuous optimization that do not require gradient estimation. Instead, we encode the optimization problem into the dynamics of a physical system and coherently simulate the time evolution. We…
A recent reformulation [1] of the problem of Coulomb gases in the presence of a dynamical dielectric medium showed that finite temperature simulations of such systems can be accomplished on the basis of completely local Hamiltonians on a…
We show that adaptive time stepping in particle accelerator simulation is an enhancement for certain problems. The new algorithm has been implemented in the OPAL (Object Oriented Parallel Accelerator Library) framework, and is compared to…
Impactful applications such as materials discovery, hardware design, neural architecture search, or portfolio optimization require optimizing high-dimensional black-box functions with mixed and combinatorial input spaces. While Bayesian…
In this study, we describe a procedure of topology optimization in the framework of the linear Boltzmann equation, implemented using a reference Monte-Carlo particle transport code. This procedure can design complex structures that optimize…
Discrete combinatorial optimization consists in finding the optimal configuration that minimizes a given discrete objective function. An interpretation of such a function as the energy of a classical system allows us to reduce the…
This paper proposes a highly efficient quantum algorithm for portfolio optimisation targeted at near-term noisy intermediate-scale quantum computers. Recent work by Hodson et al. (2019) explored potential application of hybrid…
We explore the possibility of avoiding cosmological singularity with a bounce solution in the early Universe. The main finding is that simple and well-known semiclassical correction, which describes the mixing of radiation and gravity in…
The replica exchange method is a powerful tool for overcoming slow relaxation in molecular simulations, but its efficiency depends strongly on the choice of the number and interval of replicas and their exchange probabilities. Here, we…
The nature of the transition from quantum tunneling at low temperatures to thermal hopping at high temperatures is investigated in a scalar field theory with cubic symmetry breaking. The bounce solution which interpolates between the…
The precise description of quantum nuclear fluctuations in atomistic modelling is possible by employing path integral techniques, which involve a considerable computational overhead due to the need of simulating multiple replicas of the…
We introduce a novel strategy for cosmological Boltzmann codes leading to an increase in speed by a factor of \sim 30 for small scale Fourier modes. We (re-)investigate the tight coupling approximation and obtain analytic formulae reaching…
Cavity cooling of an atom works best on a cyclic optical transition in the strong coupling regime near resonance, where small cavity photon numbers suffice for trapping and cooling. Due to the absence of closed transitions a straightforward…
The implementation of the orbital minimization method (OMM) for solving the self-consistent Kohn-Sham (KS) problem for electronic structure calculations in a basis of non-orthogonal numerical atomic orbitals of finite-range is reported. We…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
The minimum action method (MAM) is to calculate the most probable transition path in randomly perturbed stochastic dynamics, based on the idea of action minimization in the path space. The accuracy of the numerical path between different…