This paper demonstrates that how well a state performs as an input to Grover's search algorithm depends critically upon the entanglement present in that state; the more entanglement, the less well the algorithm performs. More precisely, suppose we take a pure state input, and prior to running the algorithm apply local unitary operations to each qubit in order to maximize the probability P_max that the search algorithm succeeds. We prove that, for pure states, P_max is an entanglement monotone, in the sense that P_max can never be decreased by local operations and classical communication.
We point out that the main results-the analytic expressions for the Groverian Measure of Entanglement, in the above mentioned paper are erroneous. The technical mistake of the paper is discussed. It is shown by an explicit example that the formula for calculating the Groverian measure yields G(|ψ>) = 0 for some entangled states.
We firstly investigate the multipartite entanglement features of the quantum states, including the iteration states achieved by repeated application of Grover iteration and the Oracle ones into which the above iteration states evolve by applying single Oracle operation, employed in Grover's search algorithm by means of the separable degree and the entanglement measure. Then we give the quantitative and qualitative descriptions of the entanglement dynamics in Grover's search algorithm. Our results show that for most instances (i) the separable degrees of these states and ranges of their maximum…
Evolution of entanglement with the proceeding 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 presenc…
Entanglement plays a crucial role in quantum processes particularly those pertaining to quantum information and computation. An analytical expression for an entanglement measure defined in terms of success rate of Grover's search algorithm has been obtained for qutrit systems with real coefficients and the calculated results agree well with the conventional entropy based measure. The entanglement measure is further generalised for qudit (d-level) systems with real coefficients.
The Groverian entanglement measure, G(psi), is applied to characterize a variety of pure quantum states |psi> of multiple qubits. The Groverian measure is calculated analytically for certain states of high symmetry, while for arbitrary states it is evaluated using a numerical procedure. In particular, it is calculated for the class of Greenberger-Horne-Zeilinger states, the W states as well as for random pure states of n qubits. The entanglement generated by Grover's algorithm is evaluated by calculating G(psi) for the intermediate states that are obtained after t Grover iterations, for variou…
We calculate the amount of entanglement of the multiqubit quantum states employed in the Grover algorithm, by following its dynamics at each step of the computation. We show that genuine multipartite entanglement is always present. Remarkably, the dynamics of any type of entanglement as well as of genuine multipartite entanglement is independent of the number n of qubits for large n, thus exhibiting a scale invariance property. We compare this result with the entanglement dynamics induced by a fixed-point quantum search algorithm. We also investigate criteria for efficient simulatability in th…
The Groverian entanglement measure introduced earlier for pure quantum states [O. Biham, M.A. Nielsen and T. Osborne, Phys. Rev. A 65, 062312 (2002)] is generalized to the case of mixed states, in a way that maintains its operational interpretation. The Groverian measure of a mixed state of n qubits is obtained by a purification procedure into a pure state of 2n qubits, followed by an optimization process based on Uhlmann's theorem, before the resulting state is fed into Grover's search algorithm. The Groverian measure, expressed in terms of the maximal success probability of the algorithm, pr…
We analyze the role played by entanglement in the dynamical evolution of Grover's search algorithm in the space of qubits. We show that the algorithm can be equivalently described as an iterative change of the entanglement between the qubits, which governs the evolution of the initial state towards the target state, and where the entanglement can be quantified in terms a single entanglement monotone. We also provide a necessary and sufficient condition for the quadratic speedup, which illustrates how the change in the bipartite entanglement of the state after each iteration determines the corr…
The Groverian entanglement measure of pure quantum states of $n$ qubits is generalized to the case in which the qubits are divided into any $m \le n$ parties and the entanglement between these parties is evaluated. To demonstrate this measure we apply it to general states of three qubits and to symmetric states with any number of qubits such as the Greenberg-Horne-Zeiliner state and the W state.
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}$. …
Entanglement plays a crucial role in quantum processes particularly those pertaining to quantum information and computation. An analytical expression for entanglement measure defined in terms of success rate of Grover's search algorithm has been obtained for a two-qutrit system and the calculated results agree well with the conventional entropy based measure. Qutrit system are of special interest because the Hilbert space dimensionality (for a given number of qudits-d-dimensional system)is optimal for d=3 and this may be of significance in the enhancement of computing power.
The entanglement of a quantum system can be valuated using Mermin polynomials. This gives us a means to study entanglement evolution during the execution of quantum algorithms. We first consider Grover's quantum search algorithm, noticing that states during the algorithm are maximally entangled in the direction of a single constant state, which allows us to search for a single optimal Mermin operator and use it to evaluate entanglement through the whole execution of Grover's algorithm. Then the Quantum Fourier Transform is also studied with Mermin polynomials. A different optimal Mermin operat…
We study the entanglement content of the states employed in the Grover algorithm after the first oracle call when a few searched items are concerned. We then construct a link between these initial states and hypergraphs, which provides an illustration of their entanglement properties.
A new approach to the classical limit of Grover's algorithm is discussed by assuming a very rapid dephasing of a system between consecutive Grover's unitary operations, which drives pure quantum states to decohered mixed states. One can identify a specific element among $N$ unsorted elements by a probability of the order of unity after $k\sim N$ steps of classical amplification, which is realized by a combination of Grover's unitary operation and rapid dephasing, in contrast to $k\sim π\sqrt{N}/4$ steps in quantum mechanical amplification. The initial two-state system with enormously unbalance…
Entanglement is considered to be one of the primary reasons for why quantum algorithms are more efficient than their classical counterparts for certain computational tasks. The global multipartite entanglement of the multiqubit states in Grover's search algorithm can be quantified using the geometric measure of entanglement (GME). Rossi {\em et al.} (Phys. Rev. A \textbf{87}, 022331 (2013)) found that the entanglement dynamics is scale invariant for large $n$. Namely, the GME does not depend on the number $n$ of qubits; rather, it only depends on the ratio of iteration $k$ to the total iterati…
Grover search is a well-known quantum algorithm that outperforms any classical search algorithm. It is known that quantum correlations such as entanglement are necessary for the power of quantum computation. But entanglement is not the only kind of quantum correlations. Other quantum correlations such as quantum discord are also useful to capture some aspects of the nonclassical correlation. We investigate several kinds of correlations including both quantum and classical in the whole process of Grover search algorithm. These correlations are the concurrence, entanglement of formation, quantum…
In this paper, we study the nature of entanglement in quantum Grover's and Shor's algorithms. So far, the authors who have been interested in this problem have approached the question quantitatively by introducing entanglement measures (numerical ones most of the time). One can ask a different question: what about a qualitative measure of entanglement ? In other words, we try to find what are the different entanglement SLOCC classes that can be generated by these two algorithms. We treat in this article the case of pure four-qubit systems.
Grover's quantum search algorithm is analyzed for the case in which the initial state is an arbitrary pure quantum state $|ϕ>$ of $n$ qubits. It is shown that the optimal time to perform the measurement is independent of $| ϕ>$, namely, it is identical to the optimal time in the original algorithm in which $| ϕ> = | 0>$, with the same number of marked states, $r$. The probability of success $P_{\rm s}$ is obtained, in terms of the amplitudes of the state $| ϕ>$, and is shown to be independent of $r$. A class of states, which includes fixed points and cycles of the Grover iteration operator is …
Groverian and Geometric entanglement measures of the n-party pure state are expressed by the (n-1)-party reduced state density operator directly. This main theorem derives several important consequences. First, if two pure n-qudit states have reduced states of (n-1)-qudits, which are equivalent under local unitary(LU) transformations, then they have equal Groverian and Geometric entanglement measures. Second, both measures have an upper bound for pure states. However, this upper bound is reached only for two qubit systems. Third, it converts effectively the nonlinear eigenvalue problem for thr…
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. 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 sta…
Despite intensive research, the physical origin of the speed-up offered by quantum algorithms remains mysterious. No general physical quantity, like, for instance, entanglement, can be singled out as the essential useful resource. Here we report a close connection between the trace speed and the quantum speed-up in Grover's search algorithm implemented with pure and pseudo-pure states. For a noiseless algorithm, we find a one-to-one correspondence between the quantum speed-up and the polarization of the pseudo-pure state, which can be connected to a wide class of quantum statistical speeds. Fo…
Quantum Computing offers an entirely new way of doing computation governed by the rules of quantum mechanics like Superposition and Entanglement. These rules allow us to do computation over all the possible states simultaneously. Hence, offering exponentially higher computation power than the present classical computers. Quantum computing algorithms are entirely different from classical algorithms due to quantum parallel computing derived from quantum state superposition and entanglement, which has natural advantages over classical image processing. Grover algorithm is a quantum-based search a…
We investigate the issue of speed-up and the necessity of entanglement in Grover's quantum search algorithm. We find that in a pure state implementation of Grover's algorithm entanglement is present even though the initial and target states are product states. In pseudo-pure state implementations, the separability of the states involved defines an entanglement boundary in terms of a bound on the purity parameter. Using this bound we investigate the necessity of entanglement in quantum searching for these pseudo-pure state implementations. If every active molecule involved in the ensemble is `c…
We construct entanglement monotones for multi-qubit states based on Plücker coordinate equations of Grassmann variety, which are central notion in geometric invariant theory. As an illustrative example, we in details investigate entanglement monotones of a three-qubit state.
Quantum Algorithms have long captured the imagination of computer scientists and physicists primarily because of the speed up achieved by them over their classical counterparts using principles of quantum mechanics. Entanglement is believed to be the primary phenomena behind this speed up. However their precise role in quantum algorithms is yet unclear. In this article, we explore the nature of entanglement in the Grover's search algorithm. This algorithm enables searching of elements from an unstructured database quadratically faster than the best known classical algorithm. Geometric measure …
In a recent paper it has been shown how to create a quantum state related to the prime number sequence using Grover's algorithm. Moreover, its multiqubit entanglement was analyzed. In the present work, we compare the multiqubit entanglement of several quantum sequence states as well we study the feasibility of producing such states using Grover's algorithm.
In this work we consider the permutational properties of multipartite entanglement monotones. Based on the fact that genuine multipartite entanglement is a property of the entire multi-qubit system, we argue that ideal definitions for its characterizing quantities must be permutation-invariant. Using this criterion, we examine the three 4-qubit entanglement monotones introduced by Osterloh and Siewert [Phys. Rev. A. 72, 012337]. By expressing them in terms of quantities whose permutational properties can be easily derived, we find that one of these monotones is not permutation-invariant. We pr…
Some of the secret sharing schemes having unique quantum features like parallelism and entanglement are supposed to be relatively secure. Different schemes proposed by various researchers over the years have features which could be specific to the nature and need of a situation. Following Hsu's proposed scheme we propose a secret sharing scheme using Grover's search algorithm for a four qubit system with several marked states. Further, the scheme has been generalised to an n-qubit syatem.
We construct a measure of entanglement for general pure multipartite states based on Segre variety. We also construct a class of entanglement monotones based on the Plücker coordinate equations of the Grassmann variety. Moreover, we discuss and compare these measures of entanglement.
Various parameterizations for the orbits under local unitary transformations of three-qubit pure states are analyzed. The interconvertibility, symmetry properties, parameter ranges, calculability and behavior under measurement are looked at. It is shown that the entanglement monotones of any multipartite pure state uniquely determine the orbit of that state under local unitary transformations. It follows that there must be an entanglement monotone for three-qubit pure states which depends on the Kempe invariant defined in [Phys. Rev. A 60, 910 (1999)]. A form for such an entanglement monotone …
We generalize the strategy presented in Refs. [1, 2], and propose general conditions for a measure of total correlations to be an entanglement monotone using its pure (and mixed) convex-roof extension. In so doing, we derive crucial theorems and propose a concrete candidate for a total correlations measure which is a fully additive entanglement monotone.
The preprocessing stage of Shor's algorithm generates a class of quantum states referred to as periodic states, on which the quantum Fourier transform is applied. Such states also play an important role in other quantum algorithms that rely on the quantum Fourier transform. Since entanglement is believed to be a necessary resource for quantum computational speedup, we analyze the entanglement of periodic states and the way it is affected by the quantum Fourier transform. To this end, we derive a formula that evaluates the Groverian entanglement measure for periodic states. Using this formula, …
We construct a class of algebraic invariants for N-qubit pure states based on bipartite decompositions of the system. We show that they are entanglement monotones, and that they differ from the well know linear entropies of the sub-systems. They therefore capture new information on the non-local properties of multipartite systems.
A genuine tripartite entanglement monotone is presented for $(2\otimes 2\otimes n)$-dimensional tripartite pure states by introducing a new entanglement measure for bipartite pure states. As an application, we consider the genuine tripartite entanglement of the ground state of the exactly solvable isotropic spin-1/2 chain with three-spin interaction. It is shown that the singular behavior of the genuine tripartite entanglement exactly signals a quantum phase transition.
We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.
We discuss the monotonicity under local operations and classical communication (LOCC) of systematically constructed quantities aiming at quantification of entanglement properties of multipartite quantum systems. The so-called generalized multipartite concurrences can qualify as legitimate entanglement measures if they are monotonous under LOCC. In the paper we give a necessary and sufficient criterion for their monotonicity.
Entanglement concurrence has been widely used for featuring entanglement in quantum experiments. As an entanglement monotone it is related to specific quantum Tsallis entropy. Our goal in this paper is to propose a new parameterized bipartite entanglement monotone which is named as $q$-concurrence inspired by general Tsallis entropy. We derive an analytical lower bound for the $q$-concurrence of any bipartite quantum entanglement state by employing positive partial transposition criterion and realignment criterion, which shows an interesting relationship to the strong separability criteria. Th…
Quantum information theory and quantum computing are theoritical basis of quantum computers. Thanks to entanglement, quantum mechanical systems are provisioned to realize many information processing problems faster than classical counterparts. For example, Shor factorization algorithm, Grover search algorithm, quantum Fourrier transformation, etc. Entanglement, is the theoretical basis providing the expected speedups. It can be view in bipartite or multipartite forms. In order to quantify entanglement, some measures are defined. On the other hand, a general and accepted criterion, which can me…
We investigate the role of quantum coherence depletion (QCD) in Grover search algorithm (GA) by using several typical measures of quantum coherence and quantum correlations. By using the relative entropy of coherence measure ($\mathcal{C}_r$), we show that the success probability depends on the QCD. The same phenomenon is also found by using the $l_1$ norm of coherence measure ($\mathcal{C}_{l_1}$). In the limit case, the cost performance is defined to characterize the behavior about QCD in enhancing the success probability of GA, which is only related to the number of searcher items and the s…
In this work we study the entanglement of pure fourpartite of qubit states. The analysis is realized through the comparison between two different entanglement measures: the Groverian entanglement measure and the residual entanglement measured with negativities. Furthemore, we discuss some applications of four-way entangled fourpartite states.
We propose to quantify the entanglement of pure states of $N \times N$ bipartite quantum system by defining its Husimi distribution with respect to $SU(N)\times SU(N)$ coherent states. The Wehrl entropy is minimal if and only if the pure state analyzed is separable. The excess of the Wehrl entropy is shown to be equal to the subentropy of the mixed state obtained by partial trace of the bipartite pure state. This quantity, as well as the generalized (R{é}nyi) subentropies, are proved to be Schur--convex, so they are entanglement monotones and may be used as alternative measures of entanglement…
Characterization and quantification of multipartite entanglement is one of the challenges in state-of-the-art experiments in quantum information processing. According to theory, this is achieved via entanglement monotones, that is, functions that do not increase under stochastic local operations and classical communication (SLOCC). Typically such monotones include the wave function and its time-reversal (antilinear-operator formalism) or they are based on not completely positive maps (e.g., partial transpose). Therefore, they are not directly accessible to experimental observations. We show ho…
In this paper, we present a new approach to study genuine tripartite entanglement existing in $(2\times 2\times n)-$dimensional quantum pure states. By utilizing the approach, we introduce a particular quantity to measure genuine tripartite entanglement. The quantity is shown to be an entanglement monotone in 2-dimensional subsystems (semi-monotone) and reaches zero for separable states and $(2\times 2\times 2)-$dimensional $W$ states, hence is a good criterion to characterize genuine tripartite entanglement. Furthermore, the formulation for pure states can be conveniently extended to the case…
The primary goal in the study of entanglement as a resource theory is to find conditions that determine when one quantum state can or cannot be transformed into another via local operations and classical communication. This is typically done through entanglement monotones or conversion witnesses. Such quantities cannot be computed for arbitrary quantum states in general, but it is useful to consider classes of symmetric states for which closed-form expressions can be found. In this paper, we show how to compute the convex roof of any entanglement monotone for all Werner states. The convex roof…
We derive a family of entanglement monotones, one member of which turns out to be the negativity. Two others are shown to be lower bounds on the I-concurrence, and on the I-tangle, respectively [P. Rungta and C. M. Caves, to appear in Phys. Rev. A]. We compare these bounds with the I-concurrence and I-tangle on the isotropic states, and on rank-two density operators resulting from a Tavis-Cummings interaction. Our results provide a global structure relating several different entanglement measures. Additionally, they possess analytic forms which are easily evaluated in the most general cases.
Distinguishability and predictability are part of complementarity relations which apply to two different kinds of interference experiments, with and without a path-detector, respectively. In [Opt. Comm. 179, 337 (2000)], Englert and Bergou pointed out the possible connection between distinguishability, predictability, and entanglement. They even conjectured that an entanglement measure was hidden between the measures of distinguishability and predictability. Here, we push forward this conjecture. We start defining a new entropic distinguishability measure and suggesting an entanglement measure…
In this paper we investigate the entanglement nature of quantum states generated by Grover's search algorithm by means of algebraic geometry. More precisely we establish a link between entanglement of states generated by the algorithm and auxiliary algebraic varieties built from the set of separable states. This new perspective enables us to propose qualitative interpretations of earlier numerical results obtained by M. Rossi et al. We also illustrate our purpose with a couple of examples investigated in details.
We present an implementation of Grover's algorithm in the framework of Feynman's cursor model of a quantum computer. The cursor degrees of freedom act as a quantum clocking mechanism, and allow Grover's algorithm to be performed using a single, time-independent Hamiltonian. We examine issues of locality and resource usage in implementing such a Hamiltonian. In the familiar language of Heisenberg spin-spin coupling, the clocking mechanism appears as an excitation of a basically linear chain of spins, with occasional controlled jumps that allow for motion on a planar graph: in this sense our mod…
Much of the theory of entanglement concerns the transformations that are possible to a state under local operations with classical communication (LOCC); however, this set of operations is complicated and difficult to describe mathematically. An idea which has proven very useful is that of the {\it entanglement monotone}: a function of the state which is invariant under local unitary transformations and always decreases (or increases) on average after any local operation. In this paper we look on LOCC as the set of operations generated by {\it infinitesimal local operations}, operations which c…
We present a method to construct entanglement measures for pure states of multipartite qubit systems. The key element of our approach is an antilinear operator that we call {\em comb} in reference to the {\em hairy-ball theorem}. For qubits (or spin 1/2) the combs are automatically invariant under $SL(2,\CC)$. This implies that the {\em filters} obtained from the combs are entanglement monotones by construction. We give alternative formulae for the concurrence and the 3-tangle as expectation values of certain antilinear operators. As an application we discuss inequivalent types of genuine four…
