We consider Grover's unstructured search problem in the setting where each oracle call has some small probability of failing. We show that no quantum speed-up is possible in this case. © 2008 Springer-Verlag.
CITATION STYLE
Regev, O., & Schiff, L. (2008). Impossibility of a quantum speed-up with a faulty oracle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5125 LNCS, pp. 773–781). https://doi.org/10.1007/978-3-540-70575-8_63
Mendeley helps you to discover research relevant for your work.