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

More On Grover's Algorithm

Ken Loo

Published Feb 22, 2005• 0 citations
arXivHTMLPDF

Abstract

The goals of this paper are to show the following. First, Grover's algorithm can be viewed as a digital approximation to the analog quantum algorithm proposed in "An Analog Analogue of a Digital Quantum Computation", by E. Farhi and S. Gutmann, Phys.Rev. A 57, 2403 - 2406 (1998), quant-ph/9612026. We will call the above analog algorithm the Grover-Farhi-Gutmann or GFG algorithm. Second, the propagator of the GFG algorithm can be written as a sum-over-paths formula and given a sum-over-path interpretation, i.e., a Feynman path sum/integral. We will use nonstandard analysis to do this. Third, in the semi-classical limit $\hbar\to 0$, both the Grover and the GFG algorithms (viewed in the setting of the approximation in this paper) must run instantaneously. Finally, we will end the paper with an open question. In "Semiclassical Shor's Algorithm", by P. Giorda, et al, Phys. Rev.A 70, 032303 (2004), quant-ph/0303037, the authors proposed building semi-classical quantum computers to run Shor's algorithm because the success probability of Shor's algorithm does not change much in the semi-classical limit. We ask the open questions: In the semi-classical limit, does Shor's algorithm have to run instantaneously?

DOI
10.48550/arxiv.quant-ph/0502137

Related papers

Continuous-time Quantum Algorithms: Searching and Adiabatic Computation

Lawrence M. Ioannou

One of the most important quantum algorithms is Grover's search algorithm [G96]. Quantum searching can be used to speed up the search for solutions to NP-complete problems e. g. 3SAT. Even so, the best known quantum algorithms for 3SAT are considered inefficient. \nSoon after Grover's discovery, Farhi and Gutmann [FG96] devised a "continuous-time analogue" of quantum searching. More recently Farhi et. al. [FGGS00] proposed a continuous-time 3SAT algorithm which invokes the adiabatic approximation [M76]. Their algorithm is difficult to analyze, hence we do not know whether it can solve typical 3SAT instances faster than Grover's search algorithm can. \nI begin with a review of the discrete- and continuous-time models of quantum computation. I then make precise the notion of "efficient quantum algorithms", motivating sufficient conditions for discrete- and continuous-time algorithms to be considered efficient via discussion of standard techniques for discrete-time simulation of continuous-time algorithms. After reviewing three quantum search algorithms [F00,FG96,G96], I develop the adiabatic 3SAT algorithm as a natural extension of Farhi and Gutmann's search algorithm. Along the way, I present the adiabatic search algorithm [vDMV01] and remark on its discrete-time simulation. Finally I devise a generalization of the adiabatic algorithm and prove some lower bounds for various cases of this general framework. \nUPDATE (February 2003): Please see article http://arxiv. org/abs/quant-ph/0302138 for a resolution to the problem of simulating the continuous-time adiabatic search algorithm with a quantum circuit using only O(sqrt(N)) resources.

•Jan 1, 2002•4 citations

Digital-Analog Quantum Computing

Asier Galicia Martínez

[EN] We reviewed the paradigm of quantum computation, analysing its strengths and some of the most relevant algorithms, shuch as Shor's algorithm and Grover's algorithm. We also developed a new algorithm in the digital-analog quantum computation framework which aims at enhancing connectivity between qubits in quantum platforms.

•Jan 16, 2020•0 citations

Computación Cuántica Digital-Analógica

Asier Galicia Martínez

[EN] We reviewed the paradigm of quantum computation, analysing its strengths and some of the most relevant algorithms, shuch as Shor's algorithm and Grover's algorithm. We also developed a new algorithm in the digital-analog quantum computation framework which aims at enhancing connectivity between qubits in quantum platforms.

•Jun 21, 2019•0 citations

Analog analogue of a digital quantum computation

Edward Farhi, Sam Gutmann

We solve a problem, which while not fitting into the usual paradigm, can be viewed as a quantum computation. Suppose we are given a quantum system with a Hamiltonian of the form $E|w〉〈w|$ where $|w〉$ is an unknown (normalized) state. The problem is to produce $|w〉$ by adding a Hamiltonian (independent of $|w〉)$ and evolving the system. If $|w〉$ is chosen uniformly at random we can (with high probability) produce $|w〉$ in a time proportional to ${N}^{1/2}/E$. If $|w〉$ is instead chosen from a fixed, known orthonormal basis we can also produce $|w〉$ in a time proportional to ${N}^{1/2}/E$ and we show that this time is optimally short. This restricted problem is an analog analogue to Grover's algorithm, a computation on a conventional (!) quantum computer that locates a marked item from an unsorted list of $N$ items in a number of steps proportional to ${N}^{1/2}$.

arXiv:quant-ph/9612026•Physical Review A•Apr 1, 1998•415 citations

Optimality of spatial search in graphs with infinite tail

Weichen Xie, Christino Tamon

Farhi and Gutmann [Phys. Rev. A 57, 2403 (1998)] proved that a continuous-time analog of Grover search (also called spatial search) is optimal on complete graphs. We extend this result by showing that spatial search remains optimal on a complete graph even in the presence of an infinitely long path (or tail). If we view the latter as an external quantum system that has a limited but nontrivial interaction with our finite quantum system, this suggests that spatial search is robust against a coherent infinite one-dimensional probe. Moreover, we show that the search algorithm is oblivious in that it does not need to know whether the tail is present or not, and if so, where it is attached to.

arXiv:2301.07251•Physical Review A•Mar 20, 2023•0 citations

Shor's algorithm and Grover's algorithm in quantum computing.

Chris Valle

In this paper we will analyse two quantum algorithms that sparked interest in the potential of quantum computers. The first is Lov Grover's algorithm which may be used to conduct a type of database search. The second is Peter Shor's algorithm which may be used to factor large numbers and provides an exponential speed up over the best current classical algorithms. In the context of these two algorithms we will discuss the benefits and weaknesses of quantum computation. We will show that in exchange for a quantum computer's greater speed we must accept an inherent level of uncertainty in our results.

•Jan 1, 2011•1 citation
The goals of this paper are to show the following. First, Grover's algorithm can be viewed as a digital approximation to the analog quantum algorithm proposed in "An Analog Analogue of a Digital Quantum Computation", by E. Farhi and S. Gutmann, Phys.Rev. A 57, 2403 - 2406 (1998), quant-ph/9612026. We will call the above analog algorithm the Grover-Farhi-Gutmann or GFG algorithm. Second, the propagator of the GFG algorithm can be written as a sum-over-paths formula and given a sum-over-path interpretation, i.e., a Feynman path sum/integral. We will use nonstandard analysis to do this. Third, in the semi-classical limit ℏ→0\hbar\to 0ℏ→0, both the Grover and the GFG algorithms (viewed in the setting of the approximation in this paper) must run instantaneously. Finally, we will end the paper with an open question. In "Semiclassical Shor's Algorithm", by P. Giorda, et al, Phys. Rev.A 70, 032303 (2004), quant-ph/0303037, the authors proposed building semi-classical quantum computers to run Shor's algorithm because the success probability of Shor's algorithm does not change much in the semi-classical limit. We ask the open questions: In the semi-classical limit, does Shor's algorithm have to run instantaneously?
One of the most important quantum algorithms is Grover's search algorithm [G96]. Quantum searching can be used to speed up the search for solutions to NP-complete problems e. g. 3SAT. Even so, the best known quantum algorithms for 3SAT are considered inefficient. \nSoon after Grover's discovery, Farhi and Gutmann [FG96] devised a "continuous-time analogue" of quantum searching. More recently Farhi et. al. [FGGS00] proposed a continuous-time 3SAT algorithm which invokes the adiabatic approximation [M76]. Their algorithm is difficult to analyze, hence we do not know whether it can solve typical 3SAT instances faster than Grover's search algorithm can. \nI begin with a review of the discrete- and continuous-time models of quantum computation. I then make precise the notion of "efficient quantum algorithms", motivating sufficient conditions for discrete- and continuous-time algorithms to be considered efficient via discussion of standard techniques for discrete-time simulation of continuous-time algorithms. After reviewing three quantum search algorithms [F00,FG96,G96], I develop the adiabatic 3SAT algorithm as a natural extension of Farhi and Gutmann's search algorithm. Along the way, I present the adiabatic search algorithm [vDMV01] and remark on its discrete-time simulation. Finally I devise a generalization of the adiabatic algorithm and prove some lower bounds for various cases of this general framework. \nUPDATE (February 2003): Please see article http://arxiv. org/abs/quant-ph/0302138 for a resolution to the problem of simulating the continuous-time adiabatic search algorithm with a quantum circuit using only O(sqrt(N)) resources.
We solve a problem, which while not fitting into the usual paradigm, can be viewed as a quantum computation. Suppose we are given a quantum system with a Hamiltonian of the form E∣w〉〈w∣E|w〉〈w|E∣w〉〈w∣ where ∣w〉|w〉∣w〉 is an unknown (normalized) state. The problem is to produce ∣w〉|w〉∣w〉 by adding a Hamiltonian (independent of ∣w〉)|w〉)∣w〉) and evolving the system. If ∣w〉|w〉∣w〉 is chosen uniformly at random we can (with high probability) produce ∣w〉|w〉∣w〉 in a time proportional to N1/2/E{N}^{1/2}/EN1/2/E. If ∣w〉|w〉∣w〉 is instead chosen from a fixed, known orthonormal basis we can also produce ∣w〉|w〉∣w〉 in a time proportional to N1/2/E{N}^{1/2}/EN1/2/E and we show that this time is optimally short. This restricted problem is an analog analogue to Grover's algorithm, a computation on a conventional (!) quantum computer that locates a marked item from an unsorted list of NNN items in a number of steps proportional to N1/2{N}^{1/2}N1/2.
Farhi and Gutmann [Phys. Rev. A 57, 2403 (1998)] proved that a continuous-time analog of Grover search (also called spatial search) is optimal on complete graphs. We extend this result by showing that spatial search remains optimal on a complete graph even in the presence of an infinitely long path (or tail). If we view the latter as an external quantum system that has a limited but nontrivial interaction with our finite quantum system, this suggests that spatial search is robust against a coherent infinite one-dimensional probe. Moreover, we show that the search algorithm is oblivious in that it does not need to know whether the tail is present or not, and if so, where it is attached to.
In this paper we will analyse two quantum algorithms that sparked interest in the potential of quantum computers. The first is Lov Grover's algorithm which may be used to conduct a type of database search. The second is Peter Shor's algorithm which may be used to factor large numbers and provides an exponential speed up over the best current classical algorithms. In the context of these two algorithms we will discuss the benefits and weaknesses of quantum computation. We will show that in exchange for a quantum computer's greater speed we must accept an inherent level of uncertainty in our results.