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

Quantum Information Processing

Groverian Entanglement Measure and Evolution of Entanglement in Search Algorithm for n(= 3, 5)-Qubit Systems with Real Coefficients

Arti Chamoli, Chandra Mohan Bhandari

Published Jul 17, 2007• 9 citations
Publisher
DOI
10.1007/s11128-007-0057-2

Related papers

Comment on “Groverian entanglement measure and evolution of entanglement in search algorithm for n(= 3, 5)-qubit systems with real coefficients” (volume 6, number 4, August 2007), by Arti Chamoli and C. M. Bhandari

Preeti Parashar, Swapan Rana

arXiv:0908.2031•Quantum Information Processing•Jul 23, 2009•0 citations

Success rate and entanglement measure in Grover's search algorithm for certain kinds of four qubit states

Arti Chamoli, Chandra Mohan Bhandari

Physics Letters A•Aug 16, 2005•7 citations

Groverian measure of entanglement for mixed states (4 pages)

Daniel Shapira, Yishai Shimoni

Physical Review A•Jan 1, 2006•0 citations

Comment on "Groverian entanglement measure and evolution of entanglement in search algorithm for n(= 3, 5)-qubit systems with real coefficients"

Preeti Parashar, Swapan Rana

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(|ψ� ) = 0f or some entangled states. Keyword Groverian measure of entanglement

•Jan 1, 2009•0 citations

Multipartite entanglement in Grover’s search algorithm

Ri Qu, Bing-jian Shang, Yan-ru Bao +3 more

Natural Computing•Jan 8, 2015•7 citations

Groverian entanglement measure and evolution of entanglement in search algorithm for n(=3 and 5)-qubit systems with real coefficients

Arti Chamoli, Chandra Mohan Bhandari

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 presence of local fluctuation within each iterative step is likely.

arXiv:quant-ph/0609064•Sep 8, 2006•0 citations
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 presence of local fluctuation within each iterative step is likely.