A family of sure-success quantum algorithms for solving a generalized Grover search problem
Chia-Ren Hu
Abstract
This work considers a generalization of Grover's search problem, viz., to find any one element in a set of acceptable choices which constitute a fraction f of the total number of choices in an unsorted data base. An infinite family of sure-success quantum algorithms are introduced here to solve this problem, each member for a different range of f. The nth member of this family involves n queries of the data base, and so the lowest few members of this family should be very convenient algorithms within their ranges of validity. The even member A2n of the family covers ever larger range of f for larger n, which is expected to become the full range 0 <= f <= 1 in the limit n -->infinity.
Create a lesson
Related papers
Parallel quantum channel discrimination and numerical ranges in tensor product subspaces
Adam Bílek, Paulina Lewandowska, Ryszard Kukulski
Asymptotically Good Quantum Locally Testable Codes
William Gay, Fernando Granha Jeronimo
All causally separable quantum processes are quantum circuits with classical control of causal order
Julian Wechs, Alastair A. Abbott, Cyril Branciard
Analytic leakage suppression with a single control field: fast two-qubit gates with tunable couplers
Lukas Heunisch, Michael J. Hartmann, Aashish A. Clerk
Procrastinating einselection in non-Markovian quantum dynamics
Michael J. Moody, Tara Kalsi, Agung Budiyono et al.
Quantum Entropy Contraction and Factorization from Hypercontractivity
Li Gao, Lijun Wang