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/0507125

Comments on quant-ph/0506137: Fast quantum search algorithms by qubit comparisons exploiting global phase interference

Luis Antônio Brasil Kowada, Celina M.H. de Figueiredo, Renato Portugal, Carlile Lavor

Published Jul 13, 2005• 0 citations
arXivHTMLPDF

Abstract

Recently, Andreas de Vries proposed a quantum algorithm that would find an element in an unsorted database exponentially faster than Grover's algorithm. We show that de Vries' algorithm does not work as intended and does not give any clue about the position of the searched element.
DOI
10.48550/arxiv.quant-ph/0507125

Related papers

A summary on two new algorithms for Grover's unsorted database search problem

Shang Bin

In this summary we discuss two new algorithms for Grover's unsorted database search problem that claimed to have reached exponential speedup over Grover's original algorithm. One is in the quantum setting with "power queries" that allow for exponential reduction in the number of queries over Grover's original algorithm with "bit queries". The other is to use "dubit queries" on a duality computer - a new computing model uses a quantum system's wave-particle duality, which is able to achieve even greater computing power and better capability than existent quantum computers we have been discussing. We discuss the shortages and difficulties of both schemes as well.

arXiv:quant-ph/0603210•Mar 23, 2006•2 citations

Comment on quant-ph/0506105: The modified Grover algorithm cannot speedup unsorted database search

Long, Gui Lu

In a recent paper (quant-ph/0506105), A S Gupta, M. Gupta and A. Pathak proposed a modified Grover algorithm that would exponentially accelerate the unsorted database search problem if the number of marked items is known. If this were true, it would represent a major fundamental breakthrough in computer science, mathematics, quantum information and other related branches of sciences. However the algorithm is not valid. We will explain it in this brief comment.

arXiv:quant-ph/0506121•Jun 15, 2005•0 citations

A Modification of Grover’s Quantum Search Algorithm

I. Ashraf, T. Mahmood, Vasudevan Lakshminarayanan

Abstract-We propose a quantum search method based on Grover’s algorithm. This algorithm is described and we show that to search for a single marked element from an unsorted search space of N elements, the number of queries are required using this algorithm when compared to for the Grover algorithm.

•Aug 31, 2016•1 citation

Quantum search by local adiabatic evolution

Jérémie Roland, Nicolas J. Cerf

The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state, which tends to the solution. We apply this time-dependent Hamiltonian approach to Grover's problem, i.e., searching a marked item in an unstructured database. We find that by adjusting the evolution rate of the Hamiltonian so as to keep the evolution adiabatic on each infinitesimal time interval, the total running time is of order $\sqrt{N},$ where N is the number of items in the database. We thus recover the advantage of Grover's standard algorithm as compared to a classical search, scaling as N. This is in contrast with the constant-rate adiabatic approach of Farhi et al. (e-print quant-ph/0001106), where the requirement of adiabaticity is expressed only globally, resulting in a time of order N.

arXiv:quant-ph/0107015•Physical Review A•Mar 26, 2002•629 citations

The Measurement Based Quantum Computing Search Algorithm is Faster than Grover's Algorithm

A. Matthew Smith, Paul M. Alsing

We find that the Measurement Based Quantum Computing (MBQC) search algorithm on an unsorted list is not the same as Grover's search algorithm (GSA).

arXiv:1211.3405•Nov 14, 2012•1 citation

Complete Adiabatic Quantum Search in Unsorted Databases

Nanyang Xu, Xinhua Peng, Mingjun Shi +1 more

We propose a new adiabatic algorithm for the unsorted database search problem. This algorithm saves two thirds of qubits than Grover's algorithm in realizations. Meanwhile, we analyze the time complexity of the algorithm by both perturbative method and numerical simulation. The results show it provides a better speedup than the previous adiabatic search algorithm.

arXiv:0811.0663•Nov 5, 2008•0 citations
In this summary we discuss two new algorithms for Grover's unsorted database search problem that claimed to have reached exponential speedup over Grover's original algorithm. One is in the quantum setting with "power queries" that allow for exponential reduction in the number of queries over Grover's original algorithm with "bit queries". The other is to use "dubit queries" on a duality computer - a new computing model uses a quantum system's wave-particle duality, which is able to achieve even greater computing power and better capability than existent quantum computers we have been discussing. We discuss the shortages and difficulties of both schemes as well.
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state, which tends to the solution. We apply this time-dependent Hamiltonian approach to Grover's problem, i.e., searching a marked item in an unstructured database. We find that by adjusting the evolution rate of the Hamiltonian so as to keep the evolution adiabatic on each infinitesimal time interval, the total running time is of order N,\sqrt{N},N​, where N is the number of items in the database. We thus recover the advantage of Grover's standard algorithm as compared to a classical search, scaling as N. This is in contrast with the constant-rate adiabatic approach of Farhi et al. (e-print quant-ph/0001106), where the requirement of adiabaticity is expressed only globally, resulting in a time of order N.