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

Open Physics

Quantum discord and entanglement in grover search algorithm

Bin Ye, Tingzhong Zhang, Liang Qiu, Xuesong Wang

Published Jan 1, 2016• 1 citation
Publisher

Abstract

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.

DOI
10.1515/phys-2016-0020

Related papers

Correlations in the Grover search

Jian Cui, Heng Fan

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.

arXiv:0904.2703•Journal of Physics A Mathematical and Theoretical•Jan 4, 2010•119 citations

Phase diagram for the Grover algorithm with static imperfections

Pomeransky, A A, Zhirov, O V, Dima L. Shepelyansky

We study effects of static inter-qubit interactions on the stability of the Grover quantum search algorithm. Our numerical and analytical results show existence of regular and chaotic phases depending on the imperfection strength $\\epsilon$. The critical border $\\epsilon_c$ between two phases drops polynomially with the number of qubits $n_q$ as $\\epsilon_c \\sim n_q^{-3/2}$. In the regular phase $(\\epsilon < \\epsilon_c)$ the algorithm remains robust against imperfections showing the efficiency gain $\\epsilon_c / \\epsilon$ for $\\epsilon \\gtrsim 2^{-n_q/2}$. In the chaotic phase $(\\epsilon > \\epsilon_c)$ the algorithm is completely destroyed.

•Jan 1, 2004•10 citations

Effects of decoherence and imperfections for quantum algorithms

A. A. Pomeransky, O. V. Zhirov, Dima L. Shepelyansky

We study effects of static inter-qubit interactions and random errors in quantum gates on the stability of various quantum algorithms including the Grover quantum search algorithm and the quantum chaos maps. For the Grover algorithm our numerical and analytical results show existence of regular and chaotic phases depending on the static imperfection strength $ε$. The critical border $ε_c$ between two phases drops polynomially with the number of qubits $n_q$ as $ε_c \sim n_q^{-3/2}$. In the regular phase $(ε< ε_c)$ the algorithm remains robust against imperfections showing the efficiency gain $ε_c / ε$ for $ε> 2^{-n_q/2}$. In the chaotic phase $(ε> ε_c)$ the algorithm is completely destroyed. The results for the Grover algorithm are compared with the imperfection effects for quantum algorithms of quantum chaos maps where the universal law for the fidelity decay is given by the Random Matrix Theory (RMT). We also discuss a new gyroscopic quantum error correction method which allows to reduce the effect of static imperfections. In spite of this decay GYQEC allows to obtain a significant gain in the accuracy of quantum computations.

arXiv:quant-ph/0407264•Jul 30, 2004•0 citations

EFFECTS OF CLASSICAL ENVIRONMENTAL NOISE ON ENTANGLEMENT AND QUANTUM DISCORD DYNAMICS

Claudia Benedetti, Fabrizio Buscemi, Paolo Bordone +1 more

We address the effect of classical noise on the dynamics of quantum correlations, entanglement and quantum discord (QD), of two non-interacting qubits initially prepared in a Bell state. The effect of noise is modeled by randomizing the single-qubit transition amplitudes. We address both static and dynamic environmental noise corresponding to interaction with separate and common baths in either Markovian and non-Markovian regimes. In the Markov regime, a monotone decay of the quantum correlations is found, whereas for non-Markovian noise sudden death and revival phenomena may occur, depending on the characteristics of the noise. Entanglement and QD show the same qualitative behavior for all kind of noises considered. On the other hand, we find that separate and common environments may play opposite roles in preserving quantum correlations, depending on the noise regime considered.

arXiv:1209.4201•International Journal of Quantum Information•Dec 1, 2012•72 citations

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

Robustness of quantum discord to sudden death

T. Werlang, S. Souza, F. F. Fanchini +1 more

We calculate the dissipative dynamics of two-qubit quantum discord under Markovian environments. We analyze various dissipative channels such as dephasing, depolarizing, and generalized amplitude damping, assuming independent perturbation, in which each qubit is coupled to its own channel. Choosing initial conditions that manifest the so-called sudden death of entanglement, we compare the dynamics of entanglement with that of quantum discord. We show that in all cases where entanglement suddenly disappears, quantum discord vanishes only in the asymptotic limit, behaving similarly to individual decoherence of the qubits, even at finite temperatures. Hence, quantum discord is more robust than the entanglement against decoherence so that quantum algorithms based only on quantum discord correlations may be more robust than those based on entanglement.

arXiv:0905.3376•Physical Review A•Aug 31, 2009•543 citations
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.
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.
We study effects of static inter-qubit interactions on the stability of the Grover quantum search algorithm. Our numerical and analytical results show existence of regular and chaotic phases depending on the imperfection strength epsilon\\epsilonepsilon. The critical border epsilonc\\epsilon_cepsilonc​ between two phases drops polynomially with the number of qubits nqn_qnq​ as epsiloncsimnq−3/2\\epsilon_c \\sim n_q^{-3/2}epsilonc​simnq−3/2​. In the regular phase (epsilon<epsilonc)(\\epsilon < \\epsilon_c)(epsilon<epsilonc​) the algorithm remains robust against imperfections showing the efficiency gain epsilonc/epsilon\\epsilon_c / \\epsilonepsilonc​/epsilon for epsilongtrsim2−nq/2\\epsilon \\gtrsim 2^{-n_q/2}epsilongtrsim2−nq​/2. In the chaotic phase (epsilon>epsilonc)(\\epsilon > \\epsilon_c)(epsilon>epsilonc​) the algorithm is completely destroyed.
We study effects of static inter-qubit interactions and random errors in quantum gates on the stability of various quantum algorithms including the Grover quantum search algorithm and the quantum chaos maps. For the Grover algorithm our numerical and analytical results show existence of regular and chaotic phases depending on the static imperfection strength εεε. The critical border εcε_cεc​ between two phases drops polynomially with the number of qubits nqn_qnq​ as εc∼nq−3/2ε_c \sim n_q^{-3/2}εc​∼nq−3/2​. In the regular phase (ε<εc)(ε< ε_c)(ε<εc​) the algorithm remains robust against imperfections showing the efficiency gain εc/εε_c / εεc​/ε for ε>2−nq/2ε> 2^{-n_q/2}ε>2−nq​/2. In the chaotic phase (ε>εc)(ε> ε_c)(ε>εc​) the algorithm is completely destroyed. The results for the Grover algorithm are compared with the imperfection effects for quantum algorithms of quantum chaos maps where the universal law for the fidelity decay is given by the Random Matrix Theory (RMT). We also discuss a new gyroscopic quantum error correction method which allows to reduce the effect of static imperfections. In spite of this decay GYQEC allows to obtain a significant gain in the accuracy of quantum computations.
We address the effect of classical noise on the dynamics of quantum correlations, entanglement and quantum discord (QD), of two non-interacting qubits initially prepared in a Bell state. The effect of noise is modeled by randomizing the single-qubit transition amplitudes. We address both static and dynamic environmental noise corresponding to interaction with separate and common baths in either Markovian and non-Markovian regimes. In the Markov regime, a monotone decay of the quantum correlations is found, whereas for non-Markovian noise sudden death and revival phenomena may occur, depending on the characteristics of the noise. Entanglement and QD show the same qualitative behavior for all kind of noises considered. On the other hand, we find that separate and common environments may play opposite roles in preserving quantum correlations, depending on the noise regime considered.
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.
We calculate the dissipative dynamics of two-qubit quantum discord under Markovian environments. We analyze various dissipative channels such as dephasing, depolarizing, and generalized amplitude damping, assuming independent perturbation, in which each qubit is coupled to its own channel. Choosing initial conditions that manifest the so-called sudden death of entanglement, we compare the dynamics of entanglement with that of quantum discord. We show that in all cases where entanglement suddenly disappears, quantum discord vanishes only in the asymptotic limit, behaving similarly to individual decoherence of the qubits, even at finite temperatures. Hence, quantum discord is more robust than the entanglement against decoherence so that quantum algorithms based only on quantum discord correlations may be more robust than those based on entanglement.