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

Applied Soft Computing

Exploring superposition state in multi-scale quantum harmonic oscillator algorithm

Gang Xin, Peng Wang

Published Apr 20, 2021• 8 citations
Publisher
DOI
10.1016/j.asoc.2021.107398

Related papers

Potential Well Analysis of Multi Scale Quantum Harmonic Oscillator Algorithms

Jin Jin, Peng Wang

Communications in computer and information science•Jan 1, 2020•1 citation

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

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

Adaptive Multi-scale Quantum Harmonic Oscillator Algorithm Based on Evolutionary Strategy

Xinggui Ye, Peng Wang

This paper proposes a novel adaptive multi-scale quantum harmonic oscillator algorithm based on evolutionary strategies (AMQHOA-ES) for global numerical optimization. Since the original Multi-scale Quantum Harmonic Oscillator Algorithm (MQHOA) utilizes a fixed contraction factor to narrow the search scale, the searching step decreases too fast at the later stage of the evolution and is more likely to suffer premature convergence and stagnation. To improve the convergence performance, an adaptive attenuation mechanism of scaling is proposed to dynamically adjust the exploration and exploitation properties. Evolutionary strategies such as selection, crossover and DE/rand/1 mutation are implemented in the proposed algorithm to enhance the exploration and exploitation abilities. Experimental results evaluated on several unimodal and multimodal benchmark functions indicate the significant improvement of the proposed algorithm to the original MQHOA. Meanwhile, the experimental results compared with several state-of-the-art optimizers show the superiority or competitiveness of the proposed algorithm.

IEEE Congress on Evolutionary Computation (CEC)•Jul 1, 2020•3 citations

A Binary Multi-Scale Quantum Harmonic Oscillator Algorithm for 0–1 Knapsack Problem With Genetic Operator

Yan Huang, Peng Wang, Jianping Li +2 more

The 0-1 knapsack problem is a typical discrete combinatorial optimization problem with numerous applications. In this paper, a binary multi-scale quantum harmonic oscillator algorithm (BMQHOA) with genetic operator is proposed for solving 0-1 knapsack problem. The framework of BMQHOA is consisted of three nested phases including energy level stablization, energy level decline and scale adjustment. In BMQHOA, the number of different bits between solutions is defined as the distance between solutions to map the continuous search space into the discrete search space. Repair operator with greedy strategy is adopted in BMQHOA to guarantee the knapsack capacity constraint. The current best solution is used to perform a random mutation with the origin solutions, making solutions evolve towards the current optimal solution. The performance of BMQHOA is evaluated on two low-dimensional and three high-dimensional KP01 data sets, and computational results are compared with several state-of-art 0-1 knapsack algorithms. Experimental results demonstrate that the proposed BMQHOA can get the best solutions of most knapsack data sets, and performs well on convergence and stability.

IEEE Access•Jan 1, 2019•14 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
This paper proposes a novel adaptive multi-scale quantum harmonic oscillator algorithm based on evolutionary strategies (AMQHOA-ES) for global numerical optimization. Since the original Multi-scale Quantum Harmonic Oscillator Algorithm (MQHOA) utilizes a fixed contraction factor to narrow the search scale, the searching step decreases too fast at the later stage of the evolution and is more likely to suffer premature convergence and stagnation. To improve the convergence performance, an adaptive attenuation mechanism of scaling is proposed to dynamically adjust the exploration and exploitation properties. Evolutionary strategies such as selection, crossover and DE/rand/1 mutation are implemented in the proposed algorithm to enhance the exploration and exploitation abilities. Experimental results evaluated on several unimodal and multimodal benchmark functions indicate the significant improvement of the proposed algorithm to the original MQHOA. Meanwhile, the experimental results compared with several state-of-the-art optimizers show the superiority or competitiveness of the proposed algorithm.
The 0-1 knapsack problem is a typical discrete combinatorial optimization problem with numerous applications. In this paper, a binary multi-scale quantum harmonic oscillator algorithm (BMQHOA) with genetic operator is proposed for solving 0-1 knapsack problem. The framework of BMQHOA is consisted of three nested phases including energy level stablization, energy level decline and scale adjustment. In BMQHOA, the number of different bits between solutions is defined as the distance between solutions to map the continuous search space into the discrete search space. Repair operator with greedy strategy is adopted in BMQHOA to guarantee the knapsack capacity constraint. The current best solution is used to perform a random mutation with the origin solutions, making solutions evolve towards the current optimal solution. The performance of BMQHOA is evaluated on two low-dimensional and three high-dimensional KP01 data sets, and computational results are compared with several state-of-art 0-1 knapsack algorithms. Experimental results demonstrate that the proposed BMQHOA can get the best solutions of most knapsack data sets, and performs well on convergence and stability.
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.