This paper presents an original Quantum Genetic algorithm for Multiple sequence ALIGNment (QGMALIGN) that combines a genetic algorithm and a quantum algorithm. A quantum probabilistic coding is designed for representing the multiple sequence alignment. A quantum rotation gate as a mutation operator is used to guide the quantum state evolution. Six genetic operators are designed on the coding ba...

Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants (ESQUID) is a new algorithm for generating quantum arrays for the purpose of initializing a desired quantum superposition. The quantum arrays generated by this algorithm almost always use fewer gates than other algorithms and in the worst case use the same number of gates. These improvements are achieved by allowin...

Received on:2/6/2009 Accepted on:1/4/2010 Abstract Simulated annealing (SA) has been considered as a good tool for search and optimization problems which represent the abstraction of obtaining the crystalline structure through a physical process. This algorithm works sequentially that the current state will produce only one next state. That will make the search to be slower and the important dr...

We give an algorithm for the hidden subgroup problem for the dihedral group DN , or equivalently the cyclic hidden shift problem, that supersedes our first algorithm and is suggested by Regev’s algorithm. It runs in exp(O( √ logN)) quantum time and uses exp(O( √ logN)) classical space, but only O(logN) quantum space. The algorithm also runs faster with quantumly addressable classical space than...

The performance of a quantum teleportation algorithm implemented on an ion trap quantum computer is investigated. First the algorithm is analyzed in terms of the teleportation fidelity of six input states evenly distributed over the Bloch sphere. Furthermore, a quantum process tomography of the teleportation algorithm is carried out which provides almost complete knowledge about the algorithm.

Quantum intelligent computation has been widely drawing the attention of many researchers. Quantum clone genetic algorithm ,which is based on quantum genetic algorithm and clone algorithm, is a new quantum intelligent algorithm with good performance. In order to overcome the shortcomings such as low efficiency, poor population diversity, slow convergence speed, easy to trap in local minimums, a...

In the future quantum computers may allow us to process information in ways not possible on classical computers. The invention of algorithms to run on a quantum computer is a very difficult task, a fact made evident by the small number of algorithms currently known. This essay is intended as a review of the most important quantum algorithms, and will hopefully allow the reader to gain some unde...

Quantum computers are touted as revolutionary systems for tractably factorizing integers and solving discrete logarithms, but, in 1982, Feynman made the first proposal of a quantum computer application. He suggested that a quantum computer could efficiently simulate any local quantum system; moreover he claimed that such systems cannot in general be efficiently simulated by a (classical) Turing...

We point out that the criterion, derived by Long et al.[Phys. Rev A 61, 042305 (2000)], to judging the degree of inaccuracy under systematic errors in phase inversions in Grover’s quantum search algorithm is overestimated. Although this criterion is properly deduced, it lacks a more accurate characterization to the relation between systematic errors and the size of a quantum database. The crite...

This thesis proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principles of quantum computing, such as a quantum bit and superposition of states. Like other evolutionary algorithms, QEA is also characterized by the representation of the individual, the evaluation function, and the popu...