Related papers: Simulated Annealing with Tsallis Weights - A Numer…
Adiabatic reverse annealing (ARA) has been proposed as an improvement to conventional quantum annealing for solving optimization problems, in which one takes advantage of an initial guess at the solution to suppress problematic phase…
We solve a problem of non-convex stochastic optimisation with help of simulated annealing of Levy flights of a variable stability index. The search of the ground state of an unknown potential is non-local due to big jumps of the Levy…
In this paper we describe NPSA, the first parallel nonparametric global maximum likelihood optimization algorithm using simulated annealing (SA). Unlike the nonparametric adaptive grid search method NPAG, which is not guaranteed to find a…
Total least squares (TLS) methods have been widely used in data fitting. Compared with the least squares method, for TLS problem we takes into account not only the observation errors, but also the errors in the measurement matrix. This is…
We present a technique designed for parallelizing large rigid body simulations, capable of exploiting multiple CPU cores within a computer and across a network. Our approach can be applied to simulate both unilateral and bilateral…
A novel approach to entanglement, based on the Gelfand-Naimark-Segal (GNS) construction, is introduced. It considers states as well as algebras of observables on an equal footing. The conventional approach to the emergence of mixed from…
Population annealing is a variant of the simulated annealing algorithm that improves the quality of the thermalization process in systems with rough free-energy landscapes by introducing a resampling process. We consider the diluted…
We explore the potential application of quantum annealing to address the protein structure problem. To this end, we compare several proposed ab initio protein folding models for quantum computers and analyze their scaling and performance…
Tensor networks (TNs) are one of the best available tools to study many-body quantum systems. TNs are particularly suitable for one-dimensional local Hamiltonians, while their performance for generic geometries is mainly limited by two…
The exact solution of a particular form of the stationary state generalized Fokker-Planck equations, which is given under certain conditions by the classical Tsallis distribution, is compared with the solution of the MAXENT equations…
We present simulations of causal dynamical collapse models of field theories on a 1+1 null lattice. We use our simulations to compare and contrast two possible interpretations of the models, one in which the field values are real and the…
A new method is proposed for analyzing complexity and studying the information in random geometric networks using Tsallis entropy tool. Tsallis entropy of the ensemble of random geometric networks is calculated based on the components of…
We study the simulated annealing algorithm based on the kinetic Langevin dynamics, in order to find the global minimum of a non-convex potential function. For both the continuous time formulation and a discrete time analogue, we obtain the…
In this paper we point out that the generalized statistics of Tsallis-Havrda-Charv\'at can be conveniently used as a conceptual framework for statistical treatment of random chains. In particular, we use the path-integral approach to show…
In the previous paper \cite{FYK}, we mainly studied the mathematical properties of Tsallis relative entropy with respect to the density operators. As an application of it, we adopt a parametrically extended entanglement-measure due to…
Quantum annealing aims to exploit quantum mechanics to speed up the search for the solution to optimization problems. Most problems exhibit complete connectivity between the logical spin variables after they are mapped to the Ising spin…
Given the lack of evidence for new particle discoveries at the Large Hadron Collider (LHC), it is critical to broaden the search program. A variety of model-independent searches have been proposed, adding sensitivity to unexpected signals.…
This paper studies quantum annealing (QA) for clustering, which can be seen as an extension of simulated annealing (SA). We derive a QA algorithm for clustering and propose an annealing schedule, which is crucial in practice. Experiments…
This paper studies quantum annealing (QA) for clustering, which can be seen as an extension of simulated annealing (SA). We derive a QA algorithm for clustering and propose an annealing schedule, which is crucial in practice. Experiments…
Relations of simulated annealing and quantum annealing are studied by a mapping from the transition matrix of classical Markovian dynamics of the Ising model to a quantum Hamiltonian and vice versa. It is shown that these two operators, the…