2009/04/30 by Jian Cui, Heng Fan · 104 citations
Computer Science · Physics and Astronomy · #Amplitude damping channel #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum algorithm #Quantum capacity #Quantum correlation #Quantum discord #Quantum entanglement #Quantum information #Quantum process #quant-ph
paper · pdf · doi:10.1088/1751-8113/43/4/045305
published in Journal of Physics A Mathematical and Theoretical 43(4), 045305 (Institute of Physics) · 9 pages, 11 figures, summary is revised, more contents are added
arxiv created 2009/10/22 · openalex publication_date 2010/01/04 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/06
The Grover search is a well-known quantum algorithm that outperforms any classical search algorithm. It is known that quantum correlations such as entanglement are responsible for the power of some quantum information protocols. But entanglement is not the only kind of quantum correlations. Other quantum correlations such as quantum discord are also useful to capture some important properties of the nonclassical correlation. Also there is no well-accepted and clear distinction between quantum correlations and classical correlations. In this paper, we systematically investigate several kinds of correlations including both quantum and classical in the whole process of the Grover search algorithm. These correlations are the concurrence, entanglement of formation, quantum discord, classical correlation and mutual information. The behaviors of quantum discord, classical correlation and mutual information are almost the same while the concurrence is different in the qubit–qubit case. For the qubit partition 1: n case, the behaviors of all correlations are qualitative the same. When the search is over, all kinds of correlations are zero, we argue that this is necessary for the final step in the search.