Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOptimization and benchmarking of the thermal cycling algorithm
140
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Optimization plays a significant role in many areas of science and technology. Most of the industrial optimization problems have inordinately complex structures that render finding their global minima a daunting task. Therefore, designing heuristics that can efficiently solve such problems is of utmost importance. In this paper we benchmark and improve the thermal cycling algorithm [Phys. Rev. Lett. 79, 4297 (1997)] that is designed to overcome energy barriers in nonconvex optimization problems by temperature cycling of a pool of candidate solutions. We perform a comprehensive parameter tuning of the algorithm and demonstrate that it competes closely with other state-of-the-art algorithms such as parallel tempering with isoenergetic cluster moves, while overwhelmingly outperforming more simplistic heuristics such as simulated annealing.
rate research
Read More
An optimization algorithm is presented which consists of cyclically heating and quenching by Metropolis and local search procedures, respectively. It works particularly well when it is applied to an archive of samples instead of to a single one. We demonstrate for the traveling salesman problem that this algorithm is far more efficient than usual simulated annealing; our implementation can compete concerning speed with recent, very fast genetic local search algorithms.
The performance of the quantum approximate optimization algorithm is evaluated by using three different measures: the probability of finding the ground state, the energy expectation value, and a ratio closely related to the approximation ratio. The set of problem instances studied consists of weighted MaxCut problems and 2-satisfiability problems. The Ising model representations of the latter possess unique ground states and highly-degenerate first excited states. The quantum approximate optimization algorithm is executed on quantum computer simulators and on the IBM Q Experience. Additionally, data obtained from the D-Wave 2000Q quantum annealer is used for comparison, and it is found that the D-Wave machine outperforms the quantum approximate optimization algorithm executed on a simulator. The overall performance of the quantum approximate optimization algorithm is found to strongly depend on the problem instance.
A quantum-thermal annealing method using a cluster-flip algorithm is studied in the two-dimensional spin-glass model. The temperature (T) and the transverse field (Gamma) are decreased simultaneously with the same rate along a linear path on the T-Gamma plane. We found that the additional pulse of the transverse field to the frozen local spins produces a good approximate solution with a low computational cost.
We prove that all eigenstates of many-body localized symmetry protected topological systems with time reversal symmetry have four-fold degenerate entanglement spectra in the thermodynamic limit. To that end, we employ unitary quantum circuits where the number of sites the gates act on grows linearly with the system size. We find that the corresponding matrix product operator representation has similar local symmetries as matrix product ground states of symmetry protected topological phases. Those local symmetries give rise to a $mathbb{Z}_2$ topological index, which is robust against arbitrary perturbations so long as they do not break time reversal symmetry or drive the system out of the fully many-body localized phase.
We focus on the many-body eigenstates across a localization-delocalization phase transition. To characterize the robustness of the eigenstates, we introduce the eigenstate overlaps $mathcal{O}$ with respect to the different boundary conditions. In the ergodic phase, the average of eigenstate overlaps $bar{mathcal{O}}$ is exponential decay with the increase of the system size indicating the fragility of its eigenstates, and this can be considered as an eigenstate-version butterfly effect of the chaotic systems. For localized systems, $bar{mathcal{O}}$ is almost size-independent showing the strong robustness of the eigenstates and the broken of eigenstate thermalization hypothesis. In addition, we find that the response of eigenstates to the change of boundary conditions in many-body localized systems is identified with the single-particle wave functions in Anderson localized systems. This indicates that the eigenstates of the many-body localized systems, as the many-body wave functions, may be independent of each other. We demonstrate that this is consistent with the existence of a large number of quasilocal integrals of motion in the many-body localized phase. Our results provide a new method to study localized and delocalized systems from the perspective of eigenstates.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
