Related papers: Path optimization in 0+1 dimensional QCD at finite…

We estimate the potential size of the weak annihilation amplitudes in QCD factorization as allowed by experimental data. To achieve this goal, we establish a connection between the amplitudes in the QCD factorization and the so-called…

We propose a novel approach toward the general solution of the sign problem in real-time path-integral simulations. Using a recursive multilevel blocking strategy, this method circumvents the sign problem by synthesizing the phase…

The average phase factor of the QCD fermion determinant signals the strength of the QCD sign problem. We compute the average phase factor as a function of temperature and baryon chemical potential using a two-flavor NJL model. This allows…

Many fascinating systems suffer from a severe (complex action) sign problem preventing us from calculating them with Markov Chain Monte Carlo simulations. One promising method to alleviate the sign problem is the transformation of the…

This paper focuses on the design of sequential quadratic optimization (commonly known as SQP) methods for solving large-scale nonlinear optimization problems. The most computationally demanding aspect of such an approach is the computation…

The concept of Lefschetz thimble decomposition is one of the most promising possible modifications of Quantum Monte Carlo (QMC) algorithms aimed at alleviating the sign problem which appears in many interesting physical situations, e.g. in…

If the fermion mass is large enough, the phase of the fermion determinant of QCD at finite density is strongly correlated with the imaginary part of the Polyakov loop. This fact can be exploited to reduce the fluctuations of the phase…

Motion planning can be cast as a trajectory optimisation problem where a cost is minimised as a function of the trajectory being generated. In complex environments with several obstacles and complicated geometry, this optimisation problem…

We review recent progress in lattice QCD at finite density. The phase diagram of QCD and the equation of state at finite temperature and density are discussed. In particular, we focus on the critical point terminating a first order phase…

We present an implementation and experimental analysis of the deterministic algorithm proposed by Duan et al. (2025) for the Single-Source Shortest Path (SSSP) problem, which achieves the best-known asymptotic upper bound of $O(m \log^{2/3}…

We propose a novel method to optimize the structure of factor graphs for graph-based inference. As an example inference task, we consider symbol detection on linear inter-symbol interference channels. The factor graph framework has the…

Sample complexity bounds are a common performance metric in the Reinforcement Learning literature. In the discounted cost, infinite horizon setting, all of the known bounds have a factor that is a polynomial in $1/(1-\gamma)$, where $\gamma…

Gauge theories are of paramount importance in our understanding of fundamental constituents of matter and their interactions. However, the complete characterization of their phase diagrams and the full understanding of non-perturbative…

In this work we develop an alternative approach for solution of Quantum Trajectories using the Path Integral method. The state-of-the-art technique in the field is to solve a set of non-linear, coupled partial differential equations (PDEs)…

We extend our previous study of the QCD phase structure in the heavy quark region to non-zero chemical potentials. To identify the critical point where the first order deconfining transition terminates, we study an effective potential…

In two-stage robust optimization the solution to a problem is built in two stages: In the first stage a partial, not necessarily feasible, solution is exhibited. Then the adversary chooses the "worst" scenario from a predefined set of…

Long-range interactions in finite density QCD necessitate a non-perturbative approach in order to reliably map out the key features and spectrum of the QCD phase diagram. However, the complex nature of the fermion determinant in this sector…

For linearly constrained least-squares problems that depend on a vector of parameters, this paper proposes techniques for reducing the number of involved optimization variables. After first eliminating equality constraints in a numerically…

We comment on the Lee-Yang zero analysis for the study of the phase structure of QCD at high temperature and baryon number density by Monte-Carlo simulations. We find that the sign problem for non-zero density QCD induces a serious problem…

In this paper the computational challenges of time-optimal path following are addressed. The standard approach is to minimize the travel time, which inevitably leads to singularities at zero path speed, when reformulating the optimization…