Abstract
The relationship between the success probability of a modified Grover's quantum search algorithm and the amount of entanglement present in the initial state used for the algorithm was discussed. The entanglement measures for n-party pure states, the Groverian entanglement were also presented. Results showed that Grover's algorithm not only corresponds to a traversal of shortest path between the initial state and target state but also its success depends on the entanglement content of the initial state in a monotone fashion.
| Original language | English |
|---|---|
| Article number | 062312 |
| Pages (from-to) | 623121-623127 |
| Number of pages | 7 |
| Journal | Physical Review A - Atomic, Molecular, and Optical Physics |
| Volume | 65 |
| Issue number | 6 |
| DOIs | |
| State | Published - Jun 2002 |