Related papers: Complex matter field universal models with optimal…
Matrix field theory is a combinatorially non-local field theory which has recently been found to be a non-trivial but solvable QFT example. To generalize such non-perturbative structures to other models, a more combinatorial understanding…
In this work we revisit the problem of solving multi-matrix systems through numerical large $N$ methods. The framework is a collective, loop space representation which provides a constrained optimization problem, addressed through…
We present a modular cosmology scenario where the difficulties encountered in conventional modular cosmology are solved in a self-consistent manner, with definite predictions to be tested by observation. Notably, the difficulty of the…
A lattice of locally bistable driven-dissipative cavity polaritons is found theoretically to effectively simulate the Ising model, also enabling an effective transverse field. We benchmark the system performance for spin glass problems, and…
We present an alternative procedure to eliminate irregular contributions in the perturbation expansion of c=0-matrix models representing the sum over triangulations of random surfaces, thereby reproducing the results of Tutte [1] and Brezin…
The intrinsic energy minimization in dynamical systems offers a valuable tool for minimizing the objective functions of computationally challenging problems in combinatorial optimization. However, most prior works have focused on mapping…
We solve a long-standing puzzle in Statistical Mechanics of disordered systems. By performing a high-statistics simulation of the D=3 random-field Ising model at zero temperature for different shapes of the random-field distribution, we…
We uncover a combinatorial structure governing the differential equations satisfied by wavefunction coefficients of scalar fields with generic masses in de Sitter space. Using an integral representation of the massive mode functions, we…
Using an enhanced Self-Organizing Map method, we provided suboptimal solutions to the Traveling Salesman Problem. Besides, we employed hyperparameter tuning to identify the most critical features in the algorithm. All improvements in the…
Constructive neural combinatorial optimization (NCO) has attracted growing research attention due to its ability to solve complex routing problems without relying on handcrafted rules. However, existing NCO methods face significant…
We analyze two classic variants of the Traveling Salesman Problem using the toolkit of fine-grained complexity. Our first set of results is motivated by the Bitonic TSP problem: given a set of $n$ points in the plane, compute a shortest…
In practice, optimization tasks have some structure that allows developing new algorithms for every problem with faster convergence rates. Using the structure of optimization tasks, we can propose algorithms with more optimistic convergence…
An important area of combinatorial optimization is the study of packing and covering problems, such as Bin Packing, Multiple Knapsack, and Bin Covering. Those problems have been studied extensively from the viewpoint of approximation…
We propose a model-based, automated, bottom-up approach for design, which is applicable to various physical domains, but in this work we focus on the electrical domain. This bottom-up approach is based on a meta-topology in which each link…
We solve exactly the general one-dimensional $O(N)$-invariant spin model taking values in the sphere $S^{N-1}$, with nearest-neighbor interactions, in finite volume with periodic boundary conditions, by an expansion in hyperspherical…
We give a quantum algorithm to exactly solve certain problems in combinatorial optimization, including weighted MAX-2-SAT as well as problems where the objective function is a weighted sum of products of Ising variables, all terms of the…
The power method (or iteration) is a well-known classical technique that can be used to find the dominant eigenpair of a matrix. Here, we present a variational quantum circuit method for the power iteration, which can be used to find the…
We investigate unitarity within the Complex-Mass Scheme, a convenient universal scheme for perturbative calculations involving unstable particles in Quantum Field Theory which guarantees exact gauge invariance. Since this scheme requires to…
Using the notion of contiguity of simplicial maps, we adapt Farber's topological complexity to the realm of simplicial complexes. We show that, for a finite simplicial complex $K$, our discretized concept recovers the topological complexity…
The traveling salesman problem (TSP) and the graph partitioning problem (GPP) are two important combinatorial optimization problems with many applications. Due to the NP-hardness of these problems, heuristic algorithms are commonly used to…