Success Rate and Entanglement Evolution in Search Algorithm

Simple item page
dc.creatorChamoli, Arti
dc.creatorBhandari, C. M.
dc.date2007-02-24
dc.date.accessioned2026-07-07T07:48:57Z
dc.date.available2026-07-07T07:48:57Z
dc.descriptionEvolution 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. Biham et al [14] have shown that the success probability of search algorithm can be seen as an operational measure of entanglement. Following the same line of thought, analytical expressions for entanglement measure for three and five qubit system have been derived, which reveals that entanglement measure based on Grover's search algorithm is valid for any state with real coefficients for even number of qubits.
dc.description08 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0702221
dc.identifierhttp://arxiv.org/abs/quant-ph/0702221
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/124679
dc.subjectQuantum Physics
dc.titleSuccess Rate and Entanglement Evolution in Search Algorithm
dc.typetext

Files

Collections

arXiv