cost optimization of the reinforced concrete cantilever soil retaining wall of a given height satisfying some structural and geotechnical design constraints is performed utilizing harmony search and improved harmony search algorithms. the objective function considered is the cost of the structure, and design is based on aci 318-05. this function is minimized subjected to design constraints. a n...

We analyze the performance of classical and quantum search algorithms from a thermodynamic perspective, focusing on resources such as time, energy, and memory size. We consider two examples that are relevant to post-quantum cryptography: Grover’s search algorithm, and the quantum algorithm for collisionfinding. Using Bennett’s “Brownian” model of low-power reversible computation, we show classi...

The spatial search problem consists in minimizing the number of steps required to find a given site in a network, under the restriction that only oracle queries or translations to neighboring sites are allowed. We propose a quantum algorithm for the spatial search problem on a honeycomb lattice with N sites and torus-like boundary conditions. The search algorithm is based on a modified quantum ...

Quantum algorithms and circuits can, in principle, outperform the best non-quantum (classical) techniques for some hard computational problems. However, this does not necessarily lead to useful applications. To gauge the practical significance of a quantum algorithm, one must weigh it against the best conventional techniques applied to useful instances of the same problem. Grover’s quantum sear...

Traditional tree search algorithms supply a blueprint for modeling problem solving behaviour. A diverse spectrum of problems can be formulated in terms of tree search. Quantum computation, in particular Grover’s algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. In this work we consider the impact of incorporating classic...

Traditional tree search algorithms supply a blueprint for modeling problem solving behaviour. A diverse spectrum of problems can be formulated in terms of tree search. Quantum computation, in particular Grover’s algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. In this work we consider the impact of incorporating classic...

This paper surveys the recent trends in quantum computational intelligence. Initially we focus on Grover’s search algorithm and its extensions. Next we summarize the current research aimed at applying the search algorithm to create quantum Artificial Neural Networks and look at methods of improving the performance of our newly created quantum neural networks.

job shop scheduling problem has significant importance in many researchingfields such as production management and programming and also combinedoptimizing. job shop scheduling problem includes two sub-problems: machineassignment and sequence operation performing. in this paper combination ofparticle swarm optimization algorithm (pso) and gravitational search algorithm(gsa) have been presented f...