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:1702.03219 · Physical Review A

Coherence number as a discrete quantum resource

Seungbeom Chin

Published Oct 25, 2017• 46 citations
arXivHTMLPDF

Abstract

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{\le}k\ensuremath{\le}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 ${C}_{c}^{(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.

DOI
10.1103/physreva.96.042336

Related papers

Coherence and Entanglement Monogamy in the Discrete Analogue of Analog Grover Search

Namit Anand, Arun Kumar Pati

Grover's search algorithm is the optimal quantum algorithm that can search an unstructured database quadratically faster than any known classical algorithm. The role of entanglement and correlations in the search algorithm have been studied in great detail and it is known that entanglement between the qubits is necessary to gain a quadratic speedup, for pure state implementation of the Grover search algorithm. Here, we systematically investigate the behavior of quantum coherence and monogamy of entanglement in the discrete analogue of the $\textit{analog analogue of Grover search algorithm}$. The analog analogue of Grover search is a continuous time quantum algorithm based on the adiabatic Hamiltonian evolution that gives a quadratic speedup, similar to the original Grover search algorithm. We show that the decrease of quantum coherence, quantified using various coherence monotones, is a clear signature of attaining the maximum success probability in the analog Grover search. We also show that for any two qubit reduced density matrix of the system, the concurrence evolves in close vicinity to the increasing rate of success probability. Furthermore, we show that the system satisfies a $n$-party monogamy inequality for arbitrary times, hence bounding the amount of $n$-qubit entanglement during the quantum search.

arXiv:1611.04542•Nov 14, 2016•53 citations

Coherence Fraction in Grover Search Algorithm

Si-Qi Zhou, Hai Jin, Jin-Min Liang +3 more

The question of which resources drive the advantages in quantum algorithms has long been a fundamental challenge. While entanglement and coherence are critical to many quantum algorithms, our results indicate that they do not fully explain the quantum advantage achieved by the Grover search algorithm. By introducing a generalized Grover search algorithm, we demonstrate that the success probability depends not only on the querying number of oracles but also on the coherence fraction, which quantifies the fidelity between an arbitrary initial quantum state and the equal superposition state. Additionally, we explore the role of the coherence fraction in the quantum minimization algorithm, which offers a framework for solving complex problems in quantum machine learning. These findings offer insights into the origins of quantum advantage and open pathways for the development of new quantum algorithms.

quant-pharXiv:2511.06835•Physical Review A•Nov 11, 2025•7 citations

Coherence depletion in the Grover quantum search algorithm

Hailong Shi, Siyuan Liu, Xiao-Hui Wang +3 more

We investigate the role of quantum coherence depletion (QCD) in the Grover search algorithm (GA) by using several typical measures of quantum coherence and quantum correlations. By using the relative entropy of coherence measure (${\mathcal{C}}_{r}$), we show that the success probability depends on the QCD. The same phenomenon is also found by using the ${l}_{1}$ norm of coherence measure (${\mathcal{C}}_{{l}_{1}}$). In the limit case, the cost performance is defined to characterize the behavior about QCD in enhancing the success probability of GA, which is only related to the number of searcher items and the scale of the database, regardless of using ${\mathcal{C}}_{r}$ or ${\mathcal{C}}_{{l}_{1}}$. In the generalized Grover search algorithm (GGA), the QCD for a class of states increases with the required optimal measurement time. In comparison, the quantification of other quantum correlations in GA, such as pairwise entanglement, multipartite entanglement, pairwise discord, and genuine multipartite discord, cannot be directly related to the success probability or the optimal measurement time. Additionally, we do not detect pairwise nonlocality or genuine tripartite nonlocality in GA since Clauser-Horne-Shimony-Holt inequality and Svetlichny's inequality are not violated.

arXiv:1610.08656•Physical Review A•Mar 7, 2017•183 citations

Operator coherence dynamics in Grover's quantum search algorithm

Minghua Pan, Daowen Qiu

Coherence is one of the most basic concepts and resources in quantum information. To clear the role coherence plays on the essential operator level in Grover's search algorithm, here we discuss the coherence dynamics of the state after each basic operator is applyied. As it is known, Grover's search algorithm repeats the application of Grover operator $G$, which can be decomposed into $G={H}^{\ensuremath{\bigotimes}n}P{H}^{\ensuremath{\bigotimes}n}O$, where $H$ is Hadamard operator, $P$ is the condition phase-shift operator, and $O$ is the oracle operator. First, we show that $O$ and $P$ are incoherent operators while ${H}^{\ensuremath{\bigotimes}n}$ is coherent. Second, we prove that the amount of the operator coherence of the first ${H}^{\ensuremath{\bigotimes}n}$ and the operator coherence produced or depleted by ${H}^{\ensuremath{\bigotimes}n}$ depends not only on the size of the database and the success probability, but also on target states. Moreover, the amount of operator coherence is larger when the superposition state of targets is entangled rather than product. Third, we show that the two ${H}^{\ensuremath{\bigotimes}n}$ have different effects on coherence that one produces coherence and the other depletes coherence, and the depletion plays a major role. Therefore, the coherence is vibrating during the search process and the overall effect is that coherence is in depletion.

Physical Review A•Jul 31, 2019•27 citations

Entanglement of multipartite quantum states and the generalized quantum search

Robert M. Gingrich

In chapter 2 various parameterizations for the orbits under local unitary transformations of three-qubit pure states are analyzed. It is shown that the entanglement monotones of any multipartite pure state uniquely determine the orbit of that state. It follows that there must be an entanglement monotone for three-qubit pure states which depends on the Kempe invariant defined in [1]. A form for such an entanglement monotone is proposed. A theorem is proved that significantly reduces the number of entanglement monotones that must be looked at to find the maximal probability of transforming one multipartite state to another. In chapter 3 Grover's unstructured quantum search algorithm is generalized to use an arbitrary starting superposition and an arbitrary unitary matrix. A formula for the probability of the generalized Grover's algorithm succeeding after n iterations is derived. This formula is used to determine the optimal strategy for using the unstructured quantum search algorithm. The speedup obtained illustrates that a hybrid use of quantum computing and classical computing techniques can yield a performance that is better than either alone. The analysis is extended to the case of a society of k quantum searches acting in parallel. In chapter 4 the positive map Г : p → (Trρ) - ρ is introduced as a separability criterion. Any separable state is mapped by the tensor product of Г and the identity in to a non-negative operator, which provides a necessary condition for separability. If Г acts on a two-dimensional subsystem, then it is equivalent to partial transposition and therefore also sufficient for 2 x 2 and 2 x 3 systems. Finally, a connection between this map for two qubits and complex conjugation in the "magic" basis [2] is displayed.

•Jan 23, 2012•0 citations

Coherence Depletion in Quantum Algorithms

Ye-Chao Liu, Jiangwei Shang, Xiangdong Zhang

Besides the superior efficiency compared to their classical counterparts, quantum algorithms known so far are basically task-dependent, and scarcely any common features are shared between them. In this work, however, we show that the depletion of quantum coherence turns out to be a common phenomenon in these algorithms. For all the quantum algorithms that we investigated, including Grover's algorithm, Deutsch-Jozsa algorithm, and Shor's algorithm, quantum coherence of the system states reduces to the minimum along with the successful execution of the respective processes. Notably, a similar conclusion cannot be drawn using other quantitative measures such as quantum entanglement. Thus, we expect that coherence depletion as a common feature can be useful for devising new quantum algorithms in the future.

arXiv:1808.02222•Entropy•Mar 7, 2019•22 citations
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 kkk concurrence (a member of the generalized concurrence family with 2\ensuremath≤k\ensuremath≤d2\ensuremath{\le}k\ensuremath{\le}d2\ensuremath≤k\ensuremath≤d). As an application of the coherence number to a practical quantum system, Grover's search algorithm of NNN items is considered. We show that the coherence number remains NNN 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){C}_{c}^{(N)}Cc(N)​ (the last member of the generalized coherence concurrence, nonzero when the coherence number is NNN), 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.
Grover's search algorithm is the optimal quantum algorithm that can search an unstructured database quadratically faster than any known classical algorithm. The role of entanglement and correlations in the search algorithm have been studied in great detail and it is known that entanglement between the qubits is necessary to gain a quadratic speedup, for pure state implementation of the Grover search algorithm. Here, we systematically investigate the behavior of quantum coherence and monogamy of entanglement in the discrete analogue of the analog analogue of Grover search algorithm\textit{analog analogue of Grover search algorithm}analog analogue of Grover search algorithm. The analog analogue of Grover search is a continuous time quantum algorithm based on the adiabatic Hamiltonian evolution that gives a quadratic speedup, similar to the original Grover search algorithm. We show that the decrease of quantum coherence, quantified using various coherence monotones, is a clear signature of attaining the maximum success probability in the analog Grover search. We also show that for any two qubit reduced density matrix of the system, the concurrence evolves in close vicinity to the increasing rate of success probability. Furthermore, we show that the system satisfies a nnn-party monogamy inequality for arbitrary times, hence bounding the amount of nnn-qubit entanglement during the quantum search.
The question of which resources drive the advantages in quantum algorithms has long been a fundamental challenge. While entanglement and coherence are critical to many quantum algorithms, our results indicate that they do not fully explain the quantum advantage achieved by the Grover search algorithm. By introducing a generalized Grover search algorithm, we demonstrate that the success probability depends not only on the querying number of oracles but also on the coherence fraction, which quantifies the fidelity between an arbitrary initial quantum state and the equal superposition state. Additionally, we explore the role of the coherence fraction in the quantum minimization algorithm, which offers a framework for solving complex problems in quantum machine learning. These findings offer insights into the origins of quantum advantage and open pathways for the development of new quantum algorithms.
We investigate the role of quantum coherence depletion (QCD) in the Grover search algorithm (GA) by using several typical measures of quantum coherence and quantum correlations. By using the relative entropy of coherence measure (Cr{\mathcal{C}}_{r}Cr​), we show that the success probability depends on the QCD. The same phenomenon is also found by using the l1{l}_{1}l1​ norm of coherence measure (Cl1{\mathcal{C}}_{{l}_{1}}Cl1​​). In the limit case, the cost performance is defined to characterize the behavior about QCD in enhancing the success probability of GA, which is only related to the number of searcher items and the scale of the database, regardless of using Cr{\mathcal{C}}_{r}Cr​ or Cl1{\mathcal{C}}_{{l}_{1}}Cl1​​. In the generalized Grover search algorithm (GGA), the QCD for a class of states increases with the required optimal measurement time. In comparison, the quantification of other quantum correlations in GA, such as pairwise entanglement, multipartite entanglement, pairwise discord, and genuine multipartite discord, cannot be directly related to the success probability or the optimal measurement time. Additionally, we do not detect pairwise nonlocality or genuine tripartite nonlocality in GA since Clauser-Horne-Shimony-Holt inequality and Svetlichny's inequality are not violated.
Coherence is one of the most basic concepts and resources in quantum information. To clear the role coherence plays on the essential operator level in Grover's search algorithm, here we discuss the coherence dynamics of the state after each basic operator is applyied. As it is known, Grover's search algorithm repeats the application of Grover operator GGG, which can be decomposed into $G={H}^{\ensuremath{\bigotimes}n}P{H}^{\ensuremath{\bigotimes}n}O$, where HHH is Hadamard operator, PPP is the condition phase-shift operator, and OOO is the oracle operator. First, we show that OOO and PPP are incoherent operators while ${H}^{\ensuremath{\bigotimes}n}$ is coherent. Second, we prove that the amount of the operator coherence of the first ${H}^{\ensuremath{\bigotimes}n}$ and the operator coherence produced or depleted by ${H}^{\ensuremath{\bigotimes}n}$ depends not only on the size of the database and the success probability, but also on target states. Moreover, the amount of operator coherence is larger when the superposition state of targets is entangled rather than product. Third, we show that the two ${H}^{\ensuremath{\bigotimes}n}$ have different effects on coherence that one produces coherence and the other depletes coherence, and the depletion plays a major role. Therefore, the coherence is vibrating during the search process and the overall effect is that coherence is in depletion.
In chapter 2 various parameterizations for the orbits under local unitary transformations of three-qubit pure states are analyzed. It is shown that the entanglement monotones of any multipartite pure state uniquely determine the orbit of that state. It follows that there must be an entanglement monotone for three-qubit pure states which depends on the Kempe invariant defined in [1]. A form for such an entanglement monotone is proposed. A theorem is proved that significantly reduces the number of entanglement monotones that must be looked at to find the maximal probability of transforming one multipartite state to another. In chapter 3 Grover's unstructured quantum search algorithm is generalized to use an arbitrary starting superposition and an arbitrary unitary matrix. A formula for the probability of the generalized Grover's algorithm succeeding after n iterations is derived. This formula is used to determine the optimal strategy for using the unstructured quantum search algorithm. The speedup obtained illustrates that a hybrid use of quantum computing and classical computing techniques can yield a performance that is better than either alone. The analysis is extended to the case of a society of k quantum searches acting in parallel. In chapter 4 the positive map Г : p → (Trρ) - ρ is introduced as a separability criterion. Any separable state is mapped by the tensor product of Г and the identity in to a non-negative operator, which provides a necessary condition for separability. If Г acts on a two-dimensional subsystem, then it is equivalent to partial transposition and therefore also sufficient for 2 x 2 and 2 x 3 systems. Finally, a connection between this map for two qubits and complex conjugation in the "magic" basis [2] is displayed.
Besides the superior efficiency compared to their classical counterparts, quantum algorithms known so far are basically task-dependent, and scarcely any common features are shared between them. In this work, however, we show that the depletion of quantum coherence turns out to be a common phenomenon in these algorithms. For all the quantum algorithms that we investigated, including Grover's algorithm, Deutsch-Jozsa algorithm, and Shor's algorithm, quantum coherence of the system states reduces to the minimum along with the successful execution of the respective processes. Notably, a similar conclusion cannot be drawn using other quantitative measures such as quantum entanglement. Thus, we expect that coherence depletion as a common feature can be useful for devising new quantum algorithms in the future.