Tsallis relative α entropy of coherence dynamics in Grover's search algorithm
Abstract
Quantum coherence plays a central role in Grover's search algorithm. We study the Tsallis relative α entropy of coherence dynamics of the evolved state in Grover's search algorithm. We prove that the Tsallis relative α entropy of coherence decreases with the increase of the success probability, and derive the complementarity relations between the coherence and the success probability. We show that the operator coherence of the first H n relies on the size of the database N, the success probability and the target states. Moreover, we illustrate the relationships between coherence and entanglement of the superposition state of targets, as well as the production and deletion of coherence in Grover iterations.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.