A quantum no-reflection theorem and the speeding up of Grover's search algorithm
Kumar, Karthikeyan S. · Paraoanu, G. S.
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.