Groverian Entanglement Measure and Evolution of Entanglement in Search Algorithm for n(= 3, 5)-Qubit Systems with Real Coefficients
Groverian Entanglement Measure and Evolution of Entanglement in Search Algorithm for n(= 3, 5)-Qubit Systems with Real Coefficients
复制标题
DOI：
10.1007/s11128-007-0057-2
复制
发表时间：
2006-09
影响因子：
2.5
通讯作者：
Arti Chamoli;C. Bhandari
中科院分区：
文献类型：
--
作者：
Arti Chamoli;C. Bhandari
量子算法处理过程中纠缠的演化会影响算法的结果。特别是，如果 Grover 搜索算法的初始状态是纠缠状态，则该算法的性能会变差。搜索的成功概率可以被视为纠缠的操作度量。本文展示了基于 Grover 搜索算法性能的三量子位和五量子位系统的纠缠测量。我们还表明，虽然整体模式显示纠缠的增长，其上升到最大值然后随后衰减，但每个迭代步骤中可能存在局部波动。
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.