| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1867512 | Physics Letters A | 2009 | 8 Pages |
Abstract
We show that Grover's algorithm can be described as an iterative change of the bipartite entanglement, which leads to a necessary and sufficient condition for quadratic speedup. This allows us to reestablish, from the entanglement perspective, that Grover's search algorithm is the only optimal pure state search algorithm.
Related Topics
Physical Sciences and Engineering
Physics and Astronomy
Physics and Astronomy (General)
Authors
Pranaw Rungta,