Postprocessing can speed up general quantum search algorithms
Avatar Tulsi

TL;DR
This paper introduces an efficient postprocessing method using phase estimation to speed up general quantum search algorithms, reducing their complexity from O(B^3/α) to O(B/α).
Contribution
It presents a novel algorithm to approximate selective phase inversions of unknown eigenstates, enabling faster quantum search with practical implementation benefits.
Findings
Reduces quantum search complexity from O(B^3/α) to O(B/α).
Provides an efficient approximation of selective phase inversions.
Offers advantages for physical implementation of quantum algorithms.
Abstract
A general quantum search algorithm aims to evolve a quantum system from a known source state to an unknown target state . It uses a diffusion operator having source state as one of its eigenstates and , where denotes the selective phase inversion of state. It evolves to a particular state , call it w-state, in time steps where is and is a characteristic of the diffusion operator. Measuring the w-state gives the target state with the success probability of and applications of the algorithm can boost it from to , making the total time complexity . In the special case of Grover's algorithm, is and is very close to . A more efficient way to boost the success probability is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
