相关论文: A comparison of extremal optimization with flat-hi…
We study the low temperature properties of p-spin glass models with finite connectivity and of some optimization problems. Using a one-step functional replica symmetry breaking Ansatz we can solve exactly the saddle-point equations for…
We consider optimal planning in a large-scale system formalised as a hierarchical finite state machine (HFSM). A planning algorithm is proposed computing an optimal plan between any two states in the HFSM, consisting of two steps: A…
Recently, several platforms were proposed and demonstrated a proof-of-principle for finding the global minimum of the spin Hamiltonians such as the Ising and XY models using gain-dissipative quantum and classical systems. The implementation…
The frustrated Ising model in two dimensions is revisited. The frustration is quantified in terms of the number of non-trivial plaquettes which is invariant under the Nishimori gauge symmetry. The exact ground state energy is calculated…
An Equivalent Circuit Programming (ECP) approach that expresses the optimality conditions of an optimization problem in terms of an equivalent circuit model and uses circuit simulation techniques to solve for an optimal solution, is applied…
In this work, we reveal a rich combinatorial structure underlying exact minimax optimal algorithms for classical nonexpansive fixed-point problems. This viewpoint unifies all extremal optimal methods and provides a systematic and practical…
We perform exact diagonalization and time evolution of the Lechner-Hauke-Zoller (LHZ) annealing architecture [Science Advances 1(9), e1500838 (2015)] for ten physical qubits. Thereby, on a training set consisting of $2400$ problem…
We study the problem of finding a near-stationary point for smooth minimax optimization. The recently proposed extra anchored gradient (EAG) methods achieve the optimal convergence rate for the convex-concave minimax problem in the…
The average ground state energy and entropy for +/- J spin glasses on Bethe lattices of connectivities k+1=3...,26 at T=0 are approximated numerically. To obtain sufficient accuracy for large system sizes (up to n=2048), the Extremal…
We consider the following task: how for a given quantum state $\rho$ to find a grounded Hamiltonian $H$ satisfying the condition $\mathrm{Tr} H\rho\leq E_0<+\infty$ in such a way that the von Neumann entropy of the Gibbs state $\gamma_H(E)$…
A well known problem with Earth Orientation Parameters (EOP) prediction is that a prediction strategy proved to be the best for some testing time span and prediction length may not remain the same for other time intervals. In this paper, we…
Ego-pose estimation and dynamic object tracking are two critical problems for autonomous driving systems. The solutions to these problems are generally based on their respective assumptions, \ie{the static world assumption for simultaneous…
Chimera graphs define the topology of one of the first commercially available quantum computers. A variety of optimization problems have been mapped to this topology to evaluate the behavior of quantum enhanced optimization heuristics in…
We present a unified exact tensor network approach to compute the ground state energy, identify the optimal configuration, and count the number of solutions for spin glasses. The method is based on tensor networks with the Tropical Algebra…
We show several calculations to identify the critical point in the ground state in random spin systems including spin glasses on the basis of the duality analysis. The duality analysis is a profound method to obtain the precise location of…
In multi-objective optimization, minimizing the worst objective can be preferable to minimizing the average objective, as this ensures improved fairness across objectives. Due to the non-smooth nature of the resultant min-max optimization…
In this work, we introduce a new iterative quantum algorithm, called Iterative Symphonic Tunneling for Satisfiability problems (IST-SAT), which solves quantum spin glass optimization problems using high-frequency oscillating transverse…
The central object of this PhD thesis is known under different names in the fields of computer science and statistical mechanics. In computer science, it is called the Maximum Cut problem, one of the famous twenty-one Karp's original…
Ground states of three-dimensional EA Ising spin glasses are calculated for sizes up to 14^3 using a combination of a genetic algorithm and cluster-exact approximation. For each realization several independent ground states are obtained.…
We propose a hybrid quantum-classical algorithm for approximating the ground state and ground state energy of a Hamiltonian. Once the Ansatz has been decided, the quantum part of the algorithm involves the calculation of two overlap…