A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Introduction to Quantum Computation Information
Introduction to Quantum Computation Information
Speed-up and entanglement in quantum searching
Quantum Information & Computation
Residual entanglement with negativity for pure four-qubit quantum states
Quantum Information Processing
Entanglement measure for pure six-qubit quantum states
Quantum Information Processing
| Hi-index | 0.00 |
Evolution of entanglement with the processing of quantum algorithms affects the outcome of the algorithm. Particularly, the performance of Grover's search algorithm gets worsened if the initial state of the algorithm is an entangled one. The success probability of search can be seen as an operational measure of entanglement. This paper demonstrates an entanglement measure based on the performance of Grover's search algorithm for three and five qubit systems. We also show that although the overall pattern shows growth of entanglement, its rise to a maximum and then consequent decay, the presence of local fluctuation within each iterative step is likely.