Quantum algorithms standardly use two techniques: Fourier transforms [1] and amplitude amplification. The Grover search algorithm is based on the latter. The problem addressed by the Grover algorithm is to find a marked term (or target term in [2]) in an unsorted database of size N . To accomplish this, a quantum computer needs O (√ N ) queries using the Grover algorithm [3]. In Grover’s origin...

We introduce an algorithm for combinatorial search on quantum computers that is capable of signi cantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem structure as used by classical backtrack methods to avoid unproductive search choices. This quantum algorithm is much more likely to nd solutions than the sim...

Quantum Secret Sharing (QSS) is one of the important branch in Quantum Cryptography which combines Quantum with classical mechanics. The main objective of this paper is to propose elliptic curve cryptography (ECC) for solving heuristic attacks. The QSS and ECC methods has been tested in the following three quantum algorithms like Genetic Algorithm (GA), Tabu search algorithm (TS), Cuckoo search...

The search operation for a marked state by means of Grover’s quantum searching algorithm is shown to be an element of group SU(2) which acts on a 2-dimensional space spanned by the marked state and the unmarked collective state. Based on this underlying structure, those exact bounds of the steps in various quantum search algorithms are obtained in a quite concise way. This reformulation of the ...