Quantum robots are described as mobile quantum computers and ancillary systems that move in and interact with arbitrary environments. Their dynamics is given as tasks which consist of sequences of alternating computation and action phases. A task example is considered in which a quantum robot searches a space region to find the location of a system. The possibility that the search can be more e...

Amplitude amplification is a central tool used in Grover’s quantum search algorithm and has been used in various forms in numerous quantum algorithms since then. It has been shown to completely eliminate one-sided error of quantum search algorithms where input is accessed in the form of black-box queries. We generalize amplitude amplification for two-sided error quantum algorithm for decision p...

A quantum chaos cloning multi-objective evolutionary algorithm was proposed herein based on chaos search ergodicity, quantum computing efficiency and clonal selection theory of antibodies in artificial immune system. The qubits encoded initial population is used in the new algorithm, Chaos quantum rotation gates are introduced to update individuals, crowding distance is used to keep solution po...

task assignment problem (tap) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. tap is a combinatorial optimization problem and np-complete. this paper proposes a hybrid meta-heuristic algorithm for solving tap in a h...

We consider an application of the Mathematica package QuantumCircuit to simulation of quantum circuits implementing two of the best known quantum algorithms, namely, the Grover search algorithm and the Shor algorithm for order finding. The algorithms are discussed in detail and concrete examples of their application are demonstrated. The main features of the package QuantumCircuit which can be ...

One of the significant breakthroughs in quantum computation is Grover’s algorithm for unsorted database search. Recently, the applications of Grover’s algorithm to solve global optimization problems have been demonstrated, where unknown optimum solutions are found by iteratively improving the threshold value for the selective phase shift operator in Grover rotation. In this paper, a hybrid appr...

We present two quantum walk algorithms for 3-Distinctness. Both algorithms have time complexity Õ(n), improving the previous Õ(n) and matching the best known upper bound for query complexity (obtained via learning graphs) up to log factors. The first algorithm is based on a connection between quantum walks and electric networks. The second algorithm uses an extension of the quantum walk search ...

We report on an experiment on Grover's quantum search algorithm showing that classical waves can search a N-item database as efficiently as quantum mechanics can. The transverse beam profile of a short laser pulse is processed iteratively as the pulse bounces back and forth between two mirrors. We directly observe the sought item being found in approximately square root[N] iterations, in the fo...

Experimental realization of quantum information processing in the field of nuclear magnetic resonance (NMR) has been well established. Implementation of conditional phase-shift gate has been a significant step, which has lead to realization of important algorithms such as Grover's search algorithm and quantum Fourier transform. This gate has so far been implemented in NMR by using coupling evol...