Related papers: Chen and Diao's quantum search algorithm is not ex…
This paper has been withdrawn by the author(s).The scheme presented is insecure.
This paper has been withdrawn by the authors due to numerical problems to get viable results.
This paper has been retracted.
This paper is withdrawn because the results in the paper are included in a paper to be published in Mathematical and Computer Modelling.
This paper has been withdrawn.
Paper is withdrawn. On review the paper contributes little of significance. The runtime analysis of the algorithms presented, while correct in terms of number of operations, does not represent the complexity of the algorithms in terms of…
This paper has been withdrawn as it has been superseded by 0808.2697
This paper has been withdrawn by the author.
This paper has been withdrawn by the authors because the authors excluded the paper from electronic proceedings of the conference.
This paper has been withdrawn by the authors, due a oversimplified decoherence model. It will be substituted by a new work.
This paper has been withdrawn by the author(s). Please refer to quant-ph/0311171.
The paper has been withdrawn by the author since the protocol is not new. It is just the oldest version of BB84.
This paper has been withdrawn by the author.
The quantum search algorithm consists of an alternating sequence of selective inversions and diffusion type operations, as a result of which it can find a target state in an unsorted database of size N in only sqrt(N) queries. This paper…
The quantum search algorithm of Chen and Diao, which finds with certainty a single target item in an unsorted database, is modified so as to be capable of searching for an arbitrary specified number of target items. If the number of…
This paper has been withdrawn. See quant-ph/9806031 for a discussion.
This paper has been withdrawn.
We show that Durr-Hoyer's quantum algorithm of searching for extreme point of integer function can not be sped up for functions chosen randomly. Any other algorithm acting in substantially shorter time $o(\sqrt{2^n})$ gives incorrect answer…
This paper has been withdrawn.
The partial adiabatic search algorithm was introduced in [A. Tulsi, Phys. Rev. A 80, 052328 (2009)] as a modification of the usual adiabatic algorithm for quantum search with the idea that most of the interesting computation only happens…