Grover's search with an oracle distinguishing between solutions

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Tonchev, Hristo, Bahtev, Rosen
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866916927270551552
author Tonchev, Hristo
Bahtev, Rosen
author_facet Tonchev, Hristo
Bahtev, Rosen
contents Here we suggest a modification of Grover's algorithm, based on a multiphase oracle which marks each solution with a different phase when there is more than one solution. Such a modification can be used to maintain a high probability of finding a solution for a number of iterations equal to or more than the one required by the deterministic Grover's algorithm (the one based on generalized Householder reflections). We use various semiempirical methods to show that the interval of number of iterations for which the algorithm keeps the probability of finding solution high depends on the register size and the oracle phases.
format Preprint
id arxiv_https___arxiv_org_abs_2508_19793
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Grover's search with an oracle distinguishing between solutions
Tonchev, Hristo
Bahtev, Rosen
Quantum Physics
Here we suggest a modification of Grover's algorithm, based on a multiphase oracle which marks each solution with a different phase when there is more than one solution. Such a modification can be used to maintain a high probability of finding a solution for a number of iterations equal to or more than the one required by the deterministic Grover's algorithm (the one based on generalized Householder reflections). We use various semiempirical methods to show that the interval of number of iterations for which the algorithm keeps the probability of finding solution high depends on the register size and the oracle phases.
title Grover's search with an oracle distinguishing between solutions
topic Quantum Physics
url https://arxiv.org/abs/2508.19793