Related papers: The path optimization for the sign problem of low …
Simulations of full QCD at nonzero baryon density using light quark masses are presented. The sign problem is evaded by the usage of the complex Langevin equation. The simulations are stabilized by the gauge cooling procedure for small…
The growing demand for drone navigation in urban and restricted airspaces requires real-time path planning that is both safe and scalable. Classical methods often struggle with the computational load of high-dimensional optimization under…
Optimization has been widely used to generate smooth trajectories for motion planning. However, existing trajectory optimization methods show weakness when dealing with large-scale long trajectories. Recent advances in parallel computing…
We investigate the phase diagram and the mechanism for the sign problem to appear in finite density QCD at strong coupling in a combined framework of the auxiliary field Monte-Carlo (AFMC) and the chiral angle fixing (CAF) methods. When…
Empirical force fields employed in molecular dynamics simulations of complex systems can be optimised to reproduce experimentally determined structural and thermodynamic properties. In contrast, experimental knowledge about the rates of…
We propose an optimal algorithm for solving the longest path problem in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster than other state-of-the-art…
In this extended abstract, we report on ongoing work towards an approximate multimodal optimization algorithm with asymptotic guarantees. Multimodal optimization is the problem of finding all local optimal solutions (modes) to a path…
In this paper, a reduced-rank scheme with joint iterative optimization is presented for direction of arrival estimation. A rank-reduction matrix and an auxiliary reduced-rank parameter vector are jointly optimized to calculate the output…
The paper investigates the problem of fitting protein complexes into electron density maps. They are represented by high-resolution cryoEM density maps converted into overlapping matrices and partly show a structure of a complex. The…
In this paper, we consider convex quadratic optimization problems with indicator variables when the matrix $Q$ defining the quadratic term in the objective is sparse. We use a graphical representation of the support of $Q$, and show that if…
Constrained optimization problems are ubiquitous in science and industry. Quantum algorithms have shown promise in solving optimization problems, yet none of the current algorithms can effectively handle arbitrary constraints. We introduce…
We investigate automated in situ optimization of the potential landscape in a quantum point contact device, using a $3 \times 3$ gate array patterned atop the constriction. Optimization is performed using the covariance matrix adaptation…
We discuss $QCD$ in the Hamiltonian frame work. We treat finite density $QCD$ in the strong coupling regime. We present a parton-model inspired regularisation scheme to treat the spectrum ($\theta$-angles) and distribution functions in…
We propose a practical way of circumventing the sign problem in lattice QCD simulations with a theta-vacuum term. This method is the reweighting method for the QCD Lagrangian after the U_A(1) transformation. In the Lagrangian, the P-odd…
Multipath communication not only allows improved throughput but can also be used to leverage different path characteristics to best fulfill each application's objective. In particular, certain delay-sensitive applications, such as real time…
To overcome the bottleneck of classical path planning schemes in solving NP problems and address the predicament faced by current mainstream quantum path planning frameworks in the Noisy Intermediate-Scale Quantum (NISQ) era, this study…
In this paper, we consider the computational protein design (CPD) problem, which is usually modeled as a 0/1 programming and is extremely challenging due to its combinatorial properties. We propose an efficient algorithm for solving it.…
To arrive at some viable product design, product development processes frequently use numerical simulations and mathematical programming techniques. Topology optimization, in particular, is one of the most promising techniques for…
This work concerns a structural topology optimisation problem for 4D printing based on the phase field approach. The concept of 4D printing as a targeted evolution of 3D printed structures can be realised in a two-step process. One first…
Optimal control theory is a powerful tool for solving control problems in quantum mechanics, ranging from the control of chemical reactions to the implementation of gates in a quantum computer. Gradient-based optimization methods are able…