Impossibility of a Quantum Speed-up with a Faulty Oracle
classification
🪐 quant-ph
keywords
oraclequantumspeed-upcallcaseconsiderfailingfaulty
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.