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

2007/02/24 by Arti Chamoli, Chamoli, Arti, C. M. Bhandari +1
Computer Science · Physics and Astronomy · #Computability, Logic, AI Algorithms #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #quant-ph

paper · pdf · doi:10.48550/arxiv.quant-ph/0702222

11 pages, 01 figure

arxiv created 2007/02/24 · openalex publication_date 2007/02/24 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Related

• Evolution Of Entanglement In Groverian Search Algorithm: Two-Qutrit System
• Success Rate and Entanglement Evolution in Search Algorithm
• Groverian entanglement measure and evolution of entanglement in search algorithm for n(=3 and 5)-qubit systems with real coefficients
• Entanglement in the Grover's Search Algorithm
• The quadratic speedup in Grover's search algorithm from the entanglement perspective