Related papers: Chen and Diao's quantum search algorithm is not ex…
This paper has been withdrawn by the authors due to a gap in the proof of the main result (in 5.3).
The method is introduced for fast data processing by reducing the probability amplitudes of undesirable elements. The algorithm has a mathematical description and circuit implementation on a quantum processor. The idea is to make a quick…
We study the quantum walk search algorithm of Shenvi, Kempe and Whaley [PRA 67 052307 (2003)] on data structures of one to two spatial dimensions, on which the algorithm is thought to be less efficient than in three or more spatial…
This paper has been withdrawn at the author's request.
Quantum computing has noteworthy speedup over classical computing by taking advantage of quantum parallelism, i.e., the superposition of states. In particular, quantum search is widely used in various computationally hard problems. Grover's…
This paper has been withdrawn
This paper has been withdrawn by the author.
The paper has been withdrawn
The quantum search algorithm is a technique for searching N possibilities in only sqrt(N) steps. Although the algorithm itself is widely known, not so well known is the series of steps that first led to it, these are quite different from…
This paper has been withdrawn by the authors due to new experimental results.
This paper has been withdrawn since the results are not satisfied.
This paper has been withdrawn by the authors to avoid redundancy with e-print hep-ph0507031.
unpublished; this paper has been withdrawn.
This paper has been withdrawn by the author due to an error.
This paper has been withdrawn by the authors due to crucial error in the main proof (located in Section 2.4). The authors apologize for any inconveniences.
This paper was withdrawn by the authors.
This paper has been withdrawn by the first author due to disagreement with experiments.
This paper has been withdrawn.
This paper has been withdrawn by the authors.
This paper was withdrawn by the author.