| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
28 March 2024 |
|
| | | |
|
Article overview
| |
|
The quadratic speedup in Grover's search algorithm from the entanglement
perspective | Pranaw Rungta
; | Date: |
10 Jul 2007 | Abstract: | We analyze the role played by entanglement in the dynamical evolution of
Grover’s search algorithm in the space of qubits. We show that the algorithm
can be equivalently described as an iterative change of the entanglement
between the qubits, which governs the evolution of the initial state towards
the target state, and where the entanglement can be quantified in terms a
single entanglement monotone. We also provide a necessary and sufficient
condition for the quadratic speedup, which illustrates how the change in the
bipartite entanglement of the state after each iteration determines the
corresponding increase in the probability of finding the target state. This
allows us to reestablish from the entanglement perspective that Grover’s search
algorithm is the only optimal pure state search algorithm. | Source: | arXiv, arxiv.0707.1410 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |