2017/02/28 by Seungbeom Chin · 3 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Coherence (philosophical gambling strategy) #Coherence length #Coherence theory #Concurrence #Discrete mathematics #Generalization #Geometry #Mathematical analysis #Mathematics #Monotone polygon #Monotonic function #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Quantum state #State (computer science) #Statistical physics #Statistics #cs.IT #math.IT #quant-ph
paper · pdf · doi:10.1103/physreva.96.042336
published as Phys. Rev. A 96, 042336 (2017) · 10 pages, Revtex 4.1; (v3) new analysis on the aspect of coherence number as a resource for the Grover algorithm, former title "Conversion of Coherence into Entanglement $ k $-concurrence" ; (v4) minor corrections and clarifications, 1 figure added
arxiv created 2017/06/08 · openalex publication_date 2017/10/25 · arxiv updated 2017/10/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We introduce a discrete coherence monotone named the coherence number, which is a generalization of the coherence rank to mixed states. After defining the coherence number in a manner similar to that of the Schmidt number in entanglement theory, we present a necessary and sufficient condition of the coherence number for a coherent state to be converted to an entangled state of nonzero k concurrence (a member of the generalized concurrence family with 2\ensuremath≤k\ensuremath≤d). As an application of the coherence number to a practical quantum system, Grover's search algorithm of N items is considered. We show that the coherence number remains N and falls abruptly when the success probability of a searching process becomes maximal. This phenomenon motivates us to analyze the depletion pattern of Cc(N) (the last member of the generalized coherence concurrence, nonzero when the coherence number is N), which turns out to be an optimal resource for the process since it is completely consumed to finish the searching task. The generalization of the original Grover algorithm with arbitrary (mixed) initial states is also discussed, which reveals the boundary condition for the coherence to be monotonically decreasing under the process.