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:1001.5200

An Adaptive, Fixed-Point Version of Grover's Algorithm

Robert R. Tucci

Published Jan 28, 2010• 6 citations
arXivHTMLPDF

Abstract

We give an adaptive, fixed-point version of Grover's algorithm. By this we mean that our algorithm performs an infinite sequence of gradually diminishing steps (so we say it's adaptive) that drives the starting state to the target state with absolute certainty (so we say it's a fixed-point algorithm). Our algorithm is motivated by Bloch sphere geometry. We include with the ArXiv distribution of this paper some simple software (Octave/Matlab m-files) that implements, tests and illustrates some of the results of this paper.

DOI
10.48550/arxiv.1001.5200

Related papers

Quantum Circuit for Calculating Symmetrized Functions Via Grover-like Algorithm

Robert R. Tucci

In this paper, we give a quantum circuit that calculates symmetrized functions. Our algorithm applies the original Grover's algorithm or a variant thereof such as AFGA (adaptive fixed point Grover's algorithm). Our algorithm uses AFGA in conjunction with two new techniques we call "targeting two hypotheses" and "blind targeting". Suppose AFGA drives the starting state $|s\rangle$ to the target state $|t\rangle$. When targeting two hypotheses, $|t\rangle$ is a superposition $a_0|0\rangle + a_1|1\rangle$ of two orthonormal states or hypotheses $|0\rangle$ and $|1\rangle$. When targeting blindly, the value of $\langle t| s\rangle$ is not known a priori.

arXiv:1403.6707•Mar 26, 2014•3 citations

New Optimized Grover's Algorithm Optimization of Grover's algorithm: with quantum simulating

Idhant Sood, Ahaan Sirohia, Arjun Dev Juneja

The paper below shows an optimized algorithm to perform Grover’s Algorithm on classical computers for high no. of states in reasonable times.

•May 30, 2025•0 citations

Fixed-point adiabatic quantum search

Alexander M. Dalzell, Theodore J. Yoder, Isaac L. Chuang

Fixed-point quantum search algorithms succeed at finding one of $M$ target items among $N$ total items even when the run time of the algorithm is longer than necessary. While the famous Grover's algorithm can search quadratically faster than a classical computer, it lacks the fixed-point property---the fraction of target items must be known precisely to know when to terminate the algorithm. Recently, Yoder, Low, and Chuang [Phys. Rev. Lett. 113, 210501 (2014)] gave an optimal gate-model search algorithm with the fixed-point property. Previously, it had been discovered by Roland and Cerf [Phys. Rev. A 65, 042308 (2002)] that an adiabatic quantum algorithm, operating by continuously varying a Hamiltonian, can reproduce the quadratic speedup of gate-model Grover search. We ask, can an adiabatic algorithm also reproduce the fixed-point property? We show that the answer depends on what interpolation schedule is used, so as in the gate model, there are both fixed-point and non-fixed-point versions of adiabatic search, only some of which attain the quadratic quantum speedup. Guided by geometric intuition on the Bloch sphere, we rigorously justify our claims with an explicit upper bound on the error in the adiabatic approximation. We also show that the fixed-point adiabatic search algorithm can be simulated in the gate model with neither loss of the quadratic Grover speedup nor of the fixed-point property. Finally, we discuss natural uses of fixed-point algorithms such as preparation of a relatively prime state and oblivious amplitude amplification.

arXiv:1609.03603•Physical Review A•Jan 11, 2017•26 citations

New Optimized Grover's Algorithm Optimization of Grover's algorithm: with quantum simulating

Idhant Sood, Ahaan Sirohia, Arjun Dev Juneja

The paper below shows an optimized algorithm to perform Grover’s Algorithm on classical computers for high no. of states in reasonable times.

•May 23, 2025•0 citations

Quibbs, a Code Generator for Quantum Gibbs Sampling

Robert R. Tucci

This paper introduces Quibbs v1.3, a Java application available for free. (Source code included in the distribution.) Quibbs is a "code generator" for quantum Gibbs sampling: after the user inputs some files that specify a classical Bayesian network, Quibbs outputs a quantum circuit for performing Gibbs sampling of that Bayesian network on a quantum computer. Quibbs implements an algorithm described in earlier papers, that combines various apple pie techniques such as: an adaptive fixed-point version of Grover's algorithm, Szegedy operators, quantum phase estimation and quantum multiplexors.

arXiv:1004.2205•Apr 11, 2010•2 citations

NOTE ON QUANTUM ALGORITHM BASED ON ADAPTIVE DYNAMICS

Satoshi Iriyama

•May 26, 2020•1 citation
We give an adaptive, fixed-point version of Grover's algorithm. By this we mean that our algorithm performs an infinite sequence of gradually diminishing steps (so we say it's adaptive) that drives the starting state to the target state with absolute certainty (so we say it's a fixed-point algorithm). Our algorithm is motivated by Bloch sphere geometry. We include with the ArXiv distribution of this paper some simple software (Octave/Matlab m-files) that implements, tests and illustrates some of the results of this paper.
In this paper, we give a quantum circuit that calculates symmetrized functions. Our algorithm applies the original Grover's algorithm or a variant thereof such as AFGA (adaptive fixed point Grover's algorithm). Our algorithm uses AFGA in conjunction with two new techniques we call "targeting two hypotheses" and "blind targeting". Suppose AFGA drives the starting state ∣s⟩|s\rangle∣s⟩ to the target state ∣t⟩|t\rangle∣t⟩. When targeting two hypotheses, ∣t⟩|t\rangle∣t⟩ is a superposition a0∣0⟩+a1∣1⟩a_0|0\rangle + a_1|1\ranglea0​∣0⟩+a1​∣1⟩ of two orthonormal states or hypotheses ∣0⟩|0\rangle∣0⟩ and ∣1⟩|1\rangle∣1⟩. When targeting blindly, the value of ⟨t∣s⟩\langle t| s\rangle⟨t∣s⟩ is not known a priori.
Fixed-point quantum search algorithms succeed at finding one of MMM target items among NNN total items even when the run time of the algorithm is longer than necessary. While the famous Grover's algorithm can search quadratically faster than a classical computer, it lacks the fixed-point property---the fraction of target items must be known precisely to know when to terminate the algorithm. Recently, Yoder, Low, and Chuang [Phys. Rev. Lett. 113, 210501 (2014)] gave an optimal gate-model search algorithm with the fixed-point property. Previously, it had been discovered by Roland and Cerf [Phys. Rev. A 65, 042308 (2002)] that an adiabatic quantum algorithm, operating by continuously varying a Hamiltonian, can reproduce the quadratic speedup of gate-model Grover search. We ask, can an adiabatic algorithm also reproduce the fixed-point property? We show that the answer depends on what interpolation schedule is used, so as in the gate model, there are both fixed-point and non-fixed-point versions of adiabatic search, only some of which attain the quadratic quantum speedup. Guided by geometric intuition on the Bloch sphere, we rigorously justify our claims with an explicit upper bound on the error in the adiabatic approximation. We also show that the fixed-point adiabatic search algorithm can be simulated in the gate model with neither loss of the quadratic Grover speedup nor of the fixed-point property. Finally, we discuss natural uses of fixed-point algorithms such as preparation of a relatively prime state and oblivious amplitude amplification.
This paper introduces Quibbs v1.3, a Java application available for free. (Source code included in the distribution.) Quibbs is a "code generator" for quantum Gibbs sampling: after the user inputs some files that specify a classical Bayesian network, Quibbs outputs a quantum circuit for performing Gibbs sampling of that Bayesian network on a quantum computer. Quibbs implements an algorithm described in earlier papers, that combines various apple pie techniques such as: an adaptive fixed-point version of Grover's algorithm, Szegedy operators, quantum phase estimation and quantum multiplexors.