Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks

Computer Science – Neural and Evolutionary Computing

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

2 pages, 2 figures, 1 table, late-breaking

Scientific paper

10.1145/1830761.1830878

This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-inspired evolutionary algorithm, called HQEA, for solving combinatorial optimization problems, is also proposed. The novelty of HQEA lies in it's incorporation of QHW Remote Search and QHW Local Search - the quantum equivalents of classical mutation and local search, that this paper defines. The intuitive reasoning behind this approach, and the exploration-exploitation balance thus occurring is explained. From the results of the experiments carried out on the 0,1-knapsack problem, HQEA performs significantly better than a conventional genetic algorithm, CGA, and two quantum-inspired evolutionary algorithms - QEA and NQEA, in terms of convergence speed and accuracy.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-448894

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.