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:0908.2031 · Quantum Information Processing

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

Published Jul 23, 2009• 0 citations
arXivHTMLPDF
DOI
10.1007/s11128-009-0122-0

Related papers

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

Arti Chamoli, Chandra Mohan Bhandari

arXiv:quant-ph/0609064•Quantum Information Processing•Jul 17, 2007•8 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•5 citations

Evolution of Entanglement in Groverian Search Algorithm: n-qudit System

Arti Chamoli, Chandra Mohan Bhandari

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.

arXiv:quant-ph/0702222•Feb 24, 2007•1 citation

Characterization of pure quantum states of multiple qubits using the Groverian entanglement measure

Yishai Shimoni, Daniel Shapira, Ofer Biham

The Groverian entanglement measure $G(\ensuremath{\psi})$ is applied to characterize pure quantum states $\ensuremath{\mid}\ensuremath{\psi}⟩$ of multiple qubits. This is an operational measure of entanglement in the sense that it quantifies the utility of the state $\ensuremath{\mid}\ensuremath{\psi}⟩$ as an initial state for the search algorithm. A convenient parametrization is presented, which allows us to calculate the Groverian measure analytically for certain states of high symmetry. A numerical procedure is used in order to calculate it for arbitrary pure states of multiple qubits. Using the Groverian measure to evaluate the entanglement produced by quantum algorithms may provide useful insight into the role of entanglement in making quantum algorithms powerful. Here we calculate $G(\ensuremath{\psi})$ for the intermediate states generated during the evolution of Grover's algorithm for various initial states and for different sets of marked states. It is shown that Grover's iterations generate highly entangled states in intermediate stages of the quantum search process, even if the initial state and the target state are product states.

arXiv:quant-ph/0309062•Physical Review A•Jun 2, 2004•46 citations

Multipartite entanglement in Grover’s search algorithm

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

Natural Computing•Jan 8, 2015•8 citations

The quadratic speedup in Grover's search algorithm from the entanglement perspective

Pranaw Rungta

arXiv:0707.1410•Physics Letters A•May 31, 2009•21 citations
The Groverian entanglement measure $G(\ensuremath{\psi})$ is applied to characterize pure quantum states $\ensuremath{\mid}\ensuremath{\psi}⟩$ of multiple qubits. This is an operational measure of entanglement in the sense that it quantifies the utility of the state $\ensuremath{\mid}\ensuremath{\psi}⟩$ as an initial state for the search algorithm. A convenient parametrization is presented, which allows us to calculate the Groverian measure analytically for certain states of high symmetry. A numerical procedure is used in order to calculate it for arbitrary pure states of multiple qubits. Using the Groverian measure to evaluate the entanglement produced by quantum algorithms may provide useful insight into the role of entanglement in making quantum algorithms powerful. Here we calculate $G(\ensuremath{\psi})$ for the intermediate states generated during the evolution of Grover's algorithm for various initial states and for different sets of marked states. It is shown that Grover's iterations generate highly entangled states in intermediate stages of the quantum search process, even if the initial state and the target state are product states.