Homotopic quantum fuzzy adaptive simulated annealing [ HQF ASA ]

被引:1
|
作者
Oliviera Jr, Hima A. e [1 ]
机构
[1] Univ Fed Rio de Janeiro, Program Elect Engn, COPPE UFRJ, Rio De Janeiro, Brazil
关键词
Quantum annealing; Tunneling; Homotopic annealing; Artificial inference; Simulated annealing;
D O I
10.1016/j.ins.2024.120529
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The work proposes a new approach for evolutionary global optimization which, in simple terms, may be described as a fusion of quantum and simulated annealing. This becomes possible by using basic concepts from Homotopy Theory, conjugated to the already existing Fuzzy Adaptive Simulated Annealing paradigm and other components. In this fashion, it occurs a temporal and nonlinear superposition of the two types of annealing, provoking interesting effects in runtime, including the so-called quantum tunneling, when there is a sudden transition between attraction basins of different minima without "climbing" potential barriers. In addition, the proposal includes a generalization of the "deformation" of Hamiltonians used in quantum annealing by suggesting the use of general homotopies between the surface corresponding to the cost function under processing and another specific landscape, being this possible because of the ability of Fuzzy ASA of handling time -varying objective functions. The proposed paradigm shows that it is possible and beneficial to superpose the two types of annealing, displaying amazing numerical results and suggesting a kind of interlacing or synergic behavior - perhaps we could call it an "annealing entanglement". Finally, given the fast advances in commercial quantum annealing processors, it seems sensible to expect that an implementation of the proposed approach using such devices may occur very soon. In order to demonstrate the efficacy of the proposed algorithm, some significant and detailed examples are included in the text, so as to illustrate and clarify the presented ideas.
引用
收藏
页数:12
相关论文
共 50 条
  • [11] Adaptive Quantum Simulated Annealing for Bayesian Inference and Estimating Partition Functions
    Harro, Aram W.
    Wei, Annie Y.
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 193 - 212
  • [12] Frequency Domain FIR Filter Design Using Fuzzy Adaptive Simulated Annealing
    Oliveira, Hime A., Jr.
    Petraglia, Antonio
    Petraglia, Mariane R.
    CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2009, 28 (06) : 899 - 911
  • [13] Frequency domain FIR filter design using fuzzy adaptive simulated annealing
    Aguiar e Oliveira, Hime, Jr.
    Petraglia, Antonio
    Petraglia, Mariane Rembold
    2007 IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY, VOLS 1-3, 2007, : 1020 - +
  • [14] Frequency Domain FIR Filter Design Using Fuzzy Adaptive Simulated Annealing
    Hime A. Oliveira
    Antonio Petraglia
    Mariane R. Petraglia
    Circuits, Systems and Signal Processing, 2009, 28 : 899 - 911
  • [15] An adaptive simulated annealing algorithm
    Gong, GL
    Liu, Y
    Qian, MP
    STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2001, 94 (01) : 95 - 103
  • [16] Fuzzy cluster analysis by simulated annealing
    Sun, LX
    Danzer, K
    JOURNAL OF CHEMOMETRICS, 1996, 10 (04) : 325 - 342
  • [17] Self-adaptive fuzzy controller based on an exact fast simulated annealing algorithm
    Hu, JS
    Zheng, QL
    Pan, D
    Peng, H
    10TH IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-3: MEETING THE GRAND CHALLENGE: MACHINES THAT SERVE PEOPLE, 2001, : 529 - 532
  • [18] Establishing Nash equilibria of strategic games: a multistart Fuzzy Adaptive Simulated Annealing approach
    Oliveira, Hime, Jr.
    Petraglia, Antonio
    APPLIED SOFT COMPUTING, 2014, 19 : 188 - 197
  • [19] An Adaptive Approach to the Physical Annealing Strategy for Simulated Annealing
    Hasegawa, M.
    4TH INTERNATIONAL SYMPOSIUM ON SLOW DYNAMICS IN COMPLEX SYSTEMS: KEEP GOING TOHOKU, 2013, 1518 : 733 - 736
  • [20] Simulated annealing algorithm with adaptive neighborhood
    Zhao Xinchao
    APPLIED SOFT COMPUTING, 2011, 11 (02) : 1827 - 1836