Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0110098

Chen and Diao's quantum search algorithm is not exponentially fast

Chang-Cun Tu, Long, Gui Lu

Published Oct 16, 2001• 2 citations
arXivHTMLPDF

Abstract

This paper has been withdrawn due to the withdrawal of the related paper.
DOI
10.48550/arxiv.quant-ph/0110098

Related papers

An Exponentially Fast Quantum Search Algorithm

Goong Chen, Zijian Diao

This paper has been withdrawn by the authors.

arXiv:quant-ph/0011109•Nov 27, 2000•13 citations

An Algorithm to Speed Up Quantum Search

Martinelli, Giuseppe, Massimo Panella

The paper has been withdrawn because the research work is still in progress.

arXiv:quant-ph/0609176•Sep 22, 2006•0 citations

A New Exponentially Fast Quantum Algorithm for Searching Target in the Unstructured Database

Quantum Physics Letters•Apr 1, 2022•1 citation

A Quantum Search Algorithm for a Specified Number of Targets

Mark A. Rubin

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 targets, nu_0, is a power of four, the new algorithm will with certainty find one of the targets in a database of n items using (1/2)(3(N/nu_0)^{log_base_4(3)}-1) \approx (1/2)(3(N/nu_0)^{0.7925}-1) oracle calls, where N is the smallest power of four greater than or equal to n. If nu_0 is not a power of four, the algorithm will, with a probability of at least one-half, find one of the targets using no more than (1/2)(9(N/nu)^{log_base_4(3)}-1) calls, where nu is the smallest power of four greater than or equal to nu_0.

arXiv:quant-ph/0104082•Apr 17, 2001•1 citation

Withdrawn: A Measurement-based Algorithm for Graph Colouring

Michael Epping, Tobias Stollenwerk

In a previous version of this document we misinterpreted the runtime of a part of the described algorithm. Indeed, the runtime is not better than the Grover-Algorithm. We therefor withdraw this work. We present a novel algorithmic approach to find a proper vertex colouring of a graph with $d$ colours, if it exists. We associate a $d$-dimensional quantum system with each vertex and the initial state is a mixture of all possible colourings, from which we obtain a random proper colouring of the graph by measurements. The non-deterministic nature of the quantum measurement is tackled by a reset operation, which can revert the effect of unwanted projections. As in the classical case, we find that the runtime scales exponentially with the number of vertices. However, we provide numerical evidence that the average runtime of the problem-specific part of the algorithm scales polynomially in the number of edges.

arXiv:2111.14390•Nov 29, 2021•0 citations

Performance Analysis of the Hardware-Efficient Quantum Search Algorithm

Armin Ahmadkhaniha, Yousef Mafi, Payman Kazemikhah +3 more

International Journal of Theoretical Physics•Aug 3, 2023•6 citations
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 targets, nu_0, is a power of four, the new algorithm will with certainty find one of the targets in a database of n items using (1/2)(3(N/nu_0)^{log_base_4(3)}-1) \approx (1/2)(3(N/nu_0)^{0.7925}-1) oracle calls, where N is the smallest power of four greater than or equal to n. If nu_0 is not a power of four, the algorithm will, with a probability of at least one-half, find one of the targets using no more than (1/2)(9(N/nu)^{log_base_4(3)}-1) calls, where nu is the smallest power of four greater than or equal to nu_0.
In a previous version of this document we misinterpreted the runtime of a part of the described algorithm. Indeed, the runtime is not better than the Grover-Algorithm. We therefor withdraw this work. We present a novel algorithmic approach to find a proper vertex colouring of a graph with ddd colours, if it exists. We associate a ddd-dimensional quantum system with each vertex and the initial state is a mixture of all possible colourings, from which we obtain a random proper colouring of the graph by measurements. The non-deterministic nature of the quantum measurement is tackled by a reset operation, which can revert the effect of unwanted projections. As in the classical case, we find that the runtime scales exponentially with the number of vertices. However, we provide numerical evidence that the average runtime of the problem-specific part of the algorithm scales polynomially in the number of edges.