A quantum no-reflection theorem and the speeding up of Grover's search algorithm
Quantum Physics
2011-05-23 v1
Abstract
We prove that it is impossible to built a universal quantum machine that produces reflections about an unknown state. We then point out a connection between this result and the optimality of Grover's search algorithm: if such reflection machines were available, it would be possible to accelerate Grover's search algorithm to exponential speedups.
Cite
@article{arxiv.1105.4032,
title = {A quantum no-reflection theorem and the speeding up of Grover's search algorithm},
author = {Karthikeyan S. Kumar and G. S. Paraoanu},
journal= {arXiv preprint arXiv:1105.4032},
year = {2011}
}
Comments
8 pages, 3 figures