Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0904.2703 · Journal of Physics A Mathematical and Theoretical

Correlations in the Grover search

Jian Cui, Heng Fan

Published Jan 4, 2010• 119 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1751-8113/43/4/045305

Related papers

Non-classical Correlations in the Quantum Search Algorithm

Shantanav Chakraborty, Satyabrata Adhikari

Entanglement lies at the heart of quantum mechanics and has no classical analogue. It is central to the speed up achieved by quantum algorithms over their classical counterparts. The Grover's search algorithm is one such algorithm which enables us to achieve a quadratic speed up over any known classical algorithm that searches for an element in an unstructured database. Here, we analyse and quantify the effects of entanglement in the generalized version of this algorithm for two qubits. By 'generalized', it is meant that the use of any arbitrary single qubit unitary gate is permitted to create superposed states. Our analysis has been firstly on a noise free environment and secondly in the presence of noise. In the absence of noise, we establish a relation between the concurrence and the amplitude of the final state thereby showing the explicit effects of entanglement on the same. Moreover, the effects of noisy channels, namely amplitude and phase damping channels are studied. We investigate the amount of quantum correlation in the states obtained after the phase inversion stage of the algorithm followed by interaction of those states with the noisy environment. The quantum correlations are quantified by geometric discord. It has been revealed that the states generated after the effect of amplitude damping on the phase inverted states of the quantum search algorithm possess non-zero quantum correlation even when entanglement is absent. However, this is absent in the phase damping scenario.

arXiv:1302.6005•Feb 25, 2013•2 citations

Quantum discord and entanglement in grover search algorithm

Bin Ye, Tingzhong Zhang, Liang Qiu +1 more

Abstract Imperfections and noise in realistic quantum computers may seriously affect the accuracy of quantum algorithms. In this article we explore the impact of static imperfections on quantum entanglement as well as non-entangled quantum correlations in Grover’s search algorithm. Using the metrics of concurrence and geometric quantum discord, we show that both the evolution of entanglement and quantum discord in Grover algorithm can be restrained with the increasing strength of static imperfections. For very weak imperfections, the quantum entanglement and discord exhibit periodic behavior, while the periodicity will most certainly be destroyed with stronger imperfections. Moreover, entanglement sudden death may occur when the strength of static imperfections is greater than a certain threshold.

Open Physics•Jan 1, 2016•1 citation

Effects of initial states on the quantum correlations in the generalized Grover search algorithm*

Zhenyu Chen, Tianhui Qiu, Wenbin Zhang +1 more

We investigate the correlations between two qubits in the Grover search algorithm with arbitrary initial states by numerical simulation. Using a set of suitable bases, we construct the reduced density matrix and give the numerical expression of correlations relating to the iterations. For different initial states, we obtain the concurrence and quantum discord compared with the success probability in the algorithm. The results show that the initial states affect the correlations and the limit point of the correlations in the searching process. However, the initial states do not influence the whole cyclical trend.

Chinese Physics B•May 27, 2021•1 citation

The role of quantum correlations beyond entanglement in quantum information theory

Alexander Streltsov

Quantum entanglement is the most popular kind of quantum correlations. Its role in several tasks in quantum information theory like quantum cryptography, quantum dense coding and quantum teleportation is indisputable. The role of entanglement in quantum algorithms has also attracted enormous amount of attention in the literature. The research in this direction is motivated by the finding that a quantum computer can efficiently factorize arbitrary integer numbers. Since no classical algorithm is known today that can solve this problem efficiently, this example clearly demonstrates the superiority of a quantum computer compared to its classical counterpart. In this context, entanglement also plays a crucial role: if the quantum computer operates on a pure state without entanglement, then the computational process can be simulated efficiently on a classical computer. In this case entanglement is the key ingredient that makes the difference between a quantum and a classical computer. However, the situation is more involved if the computational process is not perfect. In this case the quantum computer operates on a mixed state, and the role of entanglement is less obvious. A seminal result in this direction is a quantum algorithm known under the acronym DQC1. This algorithm operates on an almost maximally mixed state with vanishingly little entanglement. However, DQC1 can still perform tasks efficiently for which no efficient classical algorithm is known today. Thus, it is reasonable to assume that entanglement in general is not related to the efficiency of a quantum algorithm. Triggered by this observation other kinds of quantum correlations have been studied. In this context a particular measure of quantum correlations known as quantum discord is referred to frequently in the literature. Quantum discord is a measure of quantum correlations beyond entanglement, i.e., a quantum state can have no entanglement, but nonvanishing quantum discord. Quantum discord is also regarded as the key resource in the DQC1 algorithm. Although this statement is still controversial, it was shown under very general assumptions that quantum discord is required if a quantum computer is to show an exponential speedup over any classical algorithm. In this thesis we give a short introduction into the theory of entanglement and general quantum correlations, and further discuss our results. In particular, we show that two different kinds of entanglement measures can coincide. This result is used to build an algorithm for computing entanglement. We also consider the role of quantum correlations for the distribution of entanglement and for the quantum measurement process. We further discuss the behavior of quantum correlations under local noise, and their monogamy properties.

•Jan 1, 2013•1 citation

Quantum discord for two-qubit X states

Mazhar Ali, A. R. P. Rau, G. Alber

Quantum discord, a kind of quantum correlation, is defined as the difference between quantum mutual information and classical correlation in a bipartite system. In general, this correlation is different from entanglement, and quantum discord may be nonzero even for certain separable states. Even in the simple case of bipartite quantum systems, this different kind of quantum correlation has interesting and significant applications in quantum information processing. So far, quantum discord has been calculated explicitly only for a rather limited set of two-qubit quantum states and expressions for more general quantum states are not known. In this article, we derive explicit expressions for quantum discord for a larger class of two-qubit states, namely, a seven-parameter family of so called $X$ states that have been of interest in a variety of contexts in the field. We also study the relation between quantum discord, classical correlation, and entanglement for a number of two-qubit states to demonstrate that they are independent measures of correlation with no simple relative ordering between them.

arXiv:1002.3429•Physical Review A•Apr 12, 2010•835 citations

Coherence and Entanglement Monogamy in the Discrete Analogue of Analog Grover Search

Namit Anand, Arun Kumar Pati

Grover's search algorithm is the optimal quantum algorithm that can search an unstructured database quadratically faster than any known classical algorithm. The role of entanglement and correlations in the search algorithm have been studied in great detail and it is known that entanglement between the qubits is necessary to gain a quadratic speedup, for pure state implementation of the Grover search algorithm. Here, we systematically investigate the behavior of quantum coherence and monogamy of entanglement in the discrete analogue of the $\textit{analog analogue of Grover search algorithm}$. The analog analogue of Grover search is a continuous time quantum algorithm based on the adiabatic Hamiltonian evolution that gives a quadratic speedup, similar to the original Grover search algorithm. We show that the decrease of quantum coherence, quantified using various coherence monotones, is a clear signature of attaining the maximum success probability in the analog Grover search. We also show that for any two qubit reduced density matrix of the system, the concurrence evolves in close vicinity to the increasing rate of success probability. Furthermore, we show that the system satisfies a $n$-party monogamy inequality for arbitrary times, hence bounding the amount of $n$-qubit entanglement during the quantum search.

arXiv:1611.04542•Nov 14, 2016•24 citations
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.
Entanglement lies at the heart of quantum mechanics and has no classical analogue. It is central to the speed up achieved by quantum algorithms over their classical counterparts. The Grover's search algorithm is one such algorithm which enables us to achieve a quadratic speed up over any known classical algorithm that searches for an element in an unstructured database. Here, we analyse and quantify the effects of entanglement in the generalized version of this algorithm for two qubits. By 'generalized', it is meant that the use of any arbitrary single qubit unitary gate is permitted to create superposed states. Our analysis has been firstly on a noise free environment and secondly in the presence of noise. In the absence of noise, we establish a relation between the concurrence and the amplitude of the final state thereby showing the explicit effects of entanglement on the same. Moreover, the effects of noisy channels, namely amplitude and phase damping channels are studied. We investigate the amount of quantum correlation in the states obtained after the phase inversion stage of the algorithm followed by interaction of those states with the noisy environment. The quantum correlations are quantified by geometric discord. It has been revealed that the states generated after the effect of amplitude damping on the phase inverted states of the quantum search algorithm possess non-zero quantum correlation even when entanglement is absent. However, this is absent in the phase damping scenario.
Abstract Imperfections and noise in realistic quantum computers may seriously affect the accuracy of quantum algorithms. In this article we explore the impact of static imperfections on quantum entanglement as well as non-entangled quantum correlations in Grover’s search algorithm. Using the metrics of concurrence and geometric quantum discord, we show that both the evolution of entanglement and quantum discord in Grover algorithm can be restrained with the increasing strength of static imperfections. For very weak imperfections, the quantum entanglement and discord exhibit periodic behavior, while the periodicity will most certainly be destroyed with stronger imperfections. Moreover, entanglement sudden death may occur when the strength of static imperfections is greater than a certain threshold.
We investigate the correlations between two qubits in the Grover search algorithm with arbitrary initial states by numerical simulation. Using a set of suitable bases, we construct the reduced density matrix and give the numerical expression of correlations relating to the iterations. For different initial states, we obtain the concurrence and quantum discord compared with the success probability in the algorithm. The results show that the initial states affect the correlations and the limit point of the correlations in the searching process. However, the initial states do not influence the whole cyclical trend.
Quantum entanglement is the most popular kind of quantum correlations. Its role in several tasks in quantum information theory like quantum cryptography, quantum dense coding and quantum teleportation is indisputable. The role of entanglement in quantum algorithms has also attracted enormous amount of attention in the literature. The research in this direction is motivated by the finding that a quantum computer can efficiently factorize arbitrary integer numbers. Since no classical algorithm is known today that can solve this problem efficiently, this example clearly demonstrates the superiority of a quantum computer compared to its classical counterpart. In this context, entanglement also plays a crucial role: if the quantum computer operates on a pure state without entanglement, then the computational process can be simulated efficiently on a classical computer. In this case entanglement is the key ingredient that makes the difference between a quantum and a classical computer. However, the situation is more involved if the computational process is not perfect. In this case the quantum computer operates on a mixed state, and the role of entanglement is less obvious. A seminal result in this direction is a quantum algorithm known under the acronym DQC1. This algorithm operates on an almost maximally mixed state with vanishingly little entanglement. However, DQC1 can still perform tasks efficiently for which no efficient classical algorithm is known today. Thus, it is reasonable to assume that entanglement in general is not related to the efficiency of a quantum algorithm. Triggered by this observation other kinds of quantum correlations have been studied. In this context a particular measure of quantum correlations known as quantum discord is referred to frequently in the literature. Quantum discord is a measure of quantum correlations beyond entanglement, i.e., a quantum state can have no entanglement, but nonvanishing quantum discord. Quantum discord is also regarded as the key resource in the DQC1 algorithm. Although this statement is still controversial, it was shown under very general assumptions that quantum discord is required if a quantum computer is to show an exponential speedup over any classical algorithm. In this thesis we give a short introduction into the theory of entanglement and general quantum correlations, and further discuss our results. In particular, we show that two different kinds of entanglement measures can coincide. This result is used to build an algorithm for computing entanglement. We also consider the role of quantum correlations for the distribution of entanglement and for the quantum measurement process. We further discuss the behavior of quantum correlations under local noise, and their monogamy properties.
Quantum discord, a kind of quantum correlation, is defined as the difference between quantum mutual information and classical correlation in a bipartite system. In general, this correlation is different from entanglement, and quantum discord may be nonzero even for certain separable states. Even in the simple case of bipartite quantum systems, this different kind of quantum correlation has interesting and significant applications in quantum information processing. So far, quantum discord has been calculated explicitly only for a rather limited set of two-qubit quantum states and expressions for more general quantum states are not known. In this article, we derive explicit expressions for quantum discord for a larger class of two-qubit states, namely, a seven-parameter family of so called XXX states that have been of interest in a variety of contexts in the field. We also study the relation between quantum discord, classical correlation, and entanglement for a number of two-qubit states to demonstrate that they are independent measures of correlation with no simple relative ordering between them.
Grover's search algorithm is the optimal quantum algorithm that can search an unstructured database quadratically faster than any known classical algorithm. The role of entanglement and correlations in the search algorithm have been studied in great detail and it is known that entanglement between the qubits is necessary to gain a quadratic speedup, for pure state implementation of the Grover search algorithm. Here, we systematically investigate the behavior of quantum coherence and monogamy of entanglement in the discrete analogue of the analog analogue of Grover search algorithm\textit{analog analogue of Grover search algorithm}analog analogue of Grover search algorithm. The analog analogue of Grover search is a continuous time quantum algorithm based on the adiabatic Hamiltonian evolution that gives a quadratic speedup, similar to the original Grover search algorithm. We show that the decrease of quantum coherence, quantified using various coherence monotones, is a clear signature of attaining the maximum success probability in the analog Grover search. We also show that for any two qubit reduced density matrix of the system, the concurrence evolves in close vicinity to the increasing rate of success probability. Furthermore, we show that the system satisfies a nnn-party monogamy inequality for arbitrary times, hence bounding the amount of nnn-qubit entanglement during the quantum search.