The quadratic speedup in Grover's search algorithm from the entanglement perspective |
| |
Authors: | Pranaw Rungta |
| |
Institution: | Physics Department, Poornaprajna Institute of Scientific Research, Devanahalli, Bangalore 562110, India |
| |
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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|