Groverian entanglement measure and evolution of entanglement in search algorithm for n(=3 and 5)-qubit systems with real coefficients
| dc.creator | Chamoli, Arti | |
| dc.creator | Bhandari, C. M. | |
| dc.date | 2006-09-08 | |
| dc.date | 2007-05-04 | |
| dc.date.accessioned | 2026-07-07T07:59:24Z | |
| dc.date.available | 2026-07-07T07:59:24Z | |
| dc.description | Evolution of entanglement with the proceeding 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. | |
| dc.description | 13 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0609064 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0609064 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/128352 | |
| dc.subject | Quantum Physics | |
| dc.title | Groverian entanglement measure and evolution of entanglement in search algorithm for n(=3 and 5)-qubit systems with real coefficients | |
| dc.type | text |