Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantum-thermal annealing with cluster-flip algorithm
405
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
This paper presents studies on a deterministic annealing algorithm based on quantum annealing for variational Bayes (QAVB) inference, which can be seen as an extension of the simulated annealing for variational Bayes (SAVB) inference. QAVB is as easy as SAVB to implement. Experiments revealed QAVB finds a better local optimum than SAVB in terms of the variational free energy in latent Dirichlet allocation (LDA).
We study the typical (median) value of the minimum gap in the quantum version of the Exact Cover problem using Quantum Monte Carlo simulations, in order to understand the complexity of the quantum adiabatic algorithm (QAA) for much larger sizes than before. For a range of sizes, N <= 128, where the classical Davis-Putnam algorithm shows exponential median complexity, the QAA shows polynomial median complexity. The bottleneck of the algorithm is an isolated avoided crossing point of a Landau-Zener type (collision between the two lowest energy levels only).
Song, Havlin and Makse (2005) have recently used a version of the box-counting method, called the node-covering method, to quantify the self-similar properties of 43 cellular networks: the minimal number $N_V$ of boxes of size $ell$ needed to cover all the nodes of a cellular network was found to scale as the power law $N_V sim (ell+1)^{-D_V}$ with a fractal dimension $D_V=3.53pm0.26$. We propose a new box-counting method based on edge-covering, which outperforms the node-covering approach when applied to strictly self-similar model networks, such as the Sierpinski network. The minimal number $N_E$ of boxes of size $ell$ in the edge-covering method is obtained with the simulated annealing algorithm. We take into account the possible discrete scale symmetry of networks (artifactual and/or real), which is visualized in terms of log-periodic oscillations in the dependence of the logarithm of $N_E$ as a function of the logarithm of $ell$. In this way, we are able to remove the bias of the estimator of the fractal dimension, existing for finite networks. With this new methodology, we find that $N_E$ scales with respect to $ell$ as a power law $N_E sim ell^{-D_E}$ with $D_E=2.67pm0.15$ for the 43 cellular networks previously analyzed by Song, Havlin and Makse (2005). Bootstrap tests suggest that the analyzed cellular networks may have a significant log-periodicity qualifying a discrete hierarchy with a scaling ratio close to 2. In sum, we propose that our method of edge-covering with simulated annealing and log-periodic sampling minimizes the significant bias in the determination of fractal dimensions in log-log regressions.
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.
We study interface thermal resistance (ITR) in a system consisting of two dissimilar anharmonic lattices exemplified by Fermi-Pasta-Ulam (FPU) model and Frenkel-Kontorova (FK) model. It is found that the ITR is asymmetric, namely, it depends on how the temperature gradient is applied. The dependence of the ITR on the coupling constant, temperature, temperature difference, and system size are studied. Possible applications in nanoscale heat management and control are discussed.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
