Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Communications in computer and information science

Potential Well Analysis of Multi Scale Quantum Harmonic Oscillator Algorithms

Jin Jin, Peng Wang

Published Jan 1, 2020• 1 citation
Publisher
DOI
10.1007/978-981-15-5577-0_5

Related papers

Multi-scale quantum harmonic oscillator algorithm for global numerical optimization

Peng Wang, Xinggui Ye, Bo Li +1 more

Applied Soft Computing•May 9, 2018•34 citations

Exploring superposition state in multi-scale quantum harmonic oscillator algorithm

Gang Xin, Peng Wang

Applied Soft Computing•Apr 20, 2021•8 citations

Bare-bones multi-scale quantum harmonic oscillator algorithm for global optimization

Benjun Guo, Jin Jin, Yuanping Xu +2 more

Expert Systems with Applications•Sep 29, 2023•1 citation

A novel dynamic analysis on multi-scale quantum harmonic oscillator algorithm using double-well function

Guosong Yang, Peng Wang, Xinyu Yin

Based on the double-well function, a novel dynamic analysis is proposed to study the optimization mechanism of the multi-scale quantum harmonic oscillator algorithm. This procedure-oriented method gives new clues for the algorithm's improvement, it can be adapted to study other algorithms' evolution process and complement the prevailing performance-oriented benchmark testing.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 9, 2022•2 citations

Multi-Scale Quantum Harmonic Oscillator for High-Dimensional Function Global Optimization Algorithm

Wang Pen

With the multi-scale binary sampling methods on the basis of Gaussian scaling function,the model of multi-scale quantum harmonic oscillator algorithm for high-dimensional function global optimization problems is proposed.High-dimensional function optimization process is divided into two steps,scale convergence and quantum harmonic oscillator convergence.This algorithm model is based on the same convergence process probability interpretations between function optimization problem and quantum harmonic oscillator from high-energy state to ground state.This algorithm,which has explicit physical model,can realize highdimensional function optimization without coding or complex initial conditions.Experiments and analysis are done for 15 typical two-dimensional optimized test functions and 6 typical high-dimensional optimized test functions.The results show that multi-scale quantum harmonic oscillator algorithm gets precise global optimum for high-dimensional function quickly,and withreduced frequencyapproach,the search speed of function withhigh frequency component improves significantly.

Dianzi xuebao•Jan 1, 2013•17 citations

Performance analysis of multi-scale quantum harmonic oscillator algorithm

Yuan Yana

Multi-scale Quantum Oscillator Harmonic Algorithm( MQHOA) has good characteristics of global convergence and adaptability. For analyzing the specific performance of MQHOA on solution precision and speed, the comparisons of theoretical models and experiments were completed among the MQHOA, the classic Quantum Particle Swarm Optimization( QPSO) algorithm adopting the quantum-behaved model and having been widely used, and the QPSO with Random Mean best position( QPSO-RM) through solving the integer nonlinear programming problems. In simulation experiments, MQHOA achieved 100% success rate in solving seven unconstrained integer nonlinear programming problems, and was faster than QPSO and QPSO-RM in most cases. MQHOA was a little slower than QPSO and QPSO-RM in solving the two constrained integer nonlinear programming problems, but could obtain 100% success rate which was higher than the latter. Through the comparison of the convergence process of QPSO, QPSO-RM, MQHOA was faster and earlier on converging to the global optimal solution. The experimental results show that MQHOA can effectively adapt to solving the integer programming problems, and can avoid falling into the local optimal solution so as to obtain the global optimal solution. MQHOA is better than the contrast algorithms of QPSO and QPSO-RM in accuracy and convergence rate.

Journal of Computer Applications•Jan 1, 2015•0 citations
With the multi-scale binary sampling methods on the basis of Gaussian scaling function,the model of multi-scale quantum harmonic oscillator algorithm for high-dimensional function global optimization problems is proposed.High-dimensional function optimization process is divided into two steps,scale convergence and quantum harmonic oscillator convergence.This algorithm model is based on the same convergence process probability interpretations between function optimization problem and quantum harmonic oscillator from high-energy state to ground state.This algorithm,which has explicit physical model,can realize highdimensional function optimization without coding or complex initial conditions.Experiments and analysis are done for 15 typical two-dimensional optimized test functions and 6 typical high-dimensional optimized test functions.The results show that multi-scale quantum harmonic oscillator algorithm gets precise global optimum for high-dimensional function quickly,and withreduced frequencyapproach,the search speed of function withhigh frequency component improves significantly.
Multi-scale Quantum Oscillator Harmonic Algorithm( MQHOA) has good characteristics of global convergence and adaptability. For analyzing the specific performance of MQHOA on solution precision and speed, the comparisons of theoretical models and experiments were completed among the MQHOA, the classic Quantum Particle Swarm Optimization( QPSO) algorithm adopting the quantum-behaved model and having been widely used, and the QPSO with Random Mean best position( QPSO-RM) through solving the integer nonlinear programming problems. In simulation experiments, MQHOA achieved 100% success rate in solving seven unconstrained integer nonlinear programming problems, and was faster than QPSO and QPSO-RM in most cases. MQHOA was a little slower than QPSO and QPSO-RM in solving the two constrained integer nonlinear programming problems, but could obtain 100% success rate which was higher than the latter. Through the comparison of the convergence process of QPSO, QPSO-RM, MQHOA was faster and earlier on converging to the global optimal solution. The experimental results show that MQHOA can effectively adapt to solving the integer programming problems, and can avoid falling into the local optimal solution so as to obtain the global optimal solution. MQHOA is better than the contrast algorithms of QPSO and QPSO-RM in accuracy and convergence rate.