Volume 93, Number 2, March 2011
|Number of page(s)||4|
|Published online||07 February 2011|
A quantum no-reflection theorem and the speeding up of Grover's search algorithm
Low Temperature Laboratory, Aalto University - P.O. Box 15100, FI-00076 Aalto, Finland, EU
Accepted: 10 January 2011
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.
PACS: 03.67.Ac – Quantum algorithms, protocols, and simulations
© EPLA, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.