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

Journal of Physics A Mathematical and Theoretical

Correlations in the Grover search

Jian Cui, Heng Fan

Published Jun 8, 2011• 4 citations
Publisher
DOI
10.1088/1751-8113/44/27/279501

Related papers

Quantum and classical correlations in Grover search

Jian Cui, Heng Fan

•Apr 17, 2009•0 citations

Global versus local quantum correlations in the Grover search algorithm

Josep Amengual i Batle, C. H. Raymond Ooi, Ahmed Farouk +2 more

Quantum Information Processing•Nov 20, 2015•34 citations

Measuring peptide mass spectrum correlation using the quantum Grover algorithm

Keng Wah Choo

We investigated the use of the quantum Grover algorithm in the mass-spectrometry-based protein identification process. The approach coded the mass spectra on a quantum register and uses the Grover search algorithm for searching multiple solutions to find matches from a database. Measurement of the fidelity between the input and final states was used to quantify the similarity between the experimental and theoretical spectra. The optimal number of iteration is proven to be pi/4sqrt[N/k] , where k refers to the number of marked states. We found that one iteration is sufficient for the search if we let more that 62% of the N states be marked states. By measuring the fidelity after only one iteration of Grover search, we discovered that it resembles that of the correlation-based measurement used in the existing protein identification software. We concluded that the quantum Grover algorithm can be adapted for a correlation-based mass spectra database search, provided that decoherence can be kept to a minimum.

Physical Review E•Mar 30, 2007•2 citations

Correlations in the Grover search

Jian Cui, Heng Fan

The Grover search is a well-known quantum algorithm that outperforms any classical search algorithm. It is known that quantum correlations such as entanglement are responsible for the power of some quantum information protocols. But entanglement is not the only kind of quantum correlations. Other quantum correlations such as quantum discord are also useful to capture some important properties of the nonclassical correlation. Also there is no well-accepted and clear distinction between quantum correlations and classical correlations. In this paper, we systematically investigate several kinds of correlations including both quantum and classical in the whole process of the Grover search algorithm. These correlations are the concurrence, entanglement of formation, quantum discord, classical correlation and mutual information. The behaviors of quantum discord, classical correlation and mutual information are almost the same while the concurrence is different in the qubit–qubit case. For the qubit partition 1: n case, the behaviors of all correlations are qualitative the same. When the search is over, all kinds of correlations are zero, we argue that this is necessary for the final step in the search.

arXiv:0904.2703•Journal of Physics A Mathematical and Theoretical•Jan 4, 2010•124 citations

Grover Search and its Applications

Byung-Soo Choi

•Jun 1, 2011•0 citations

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
We investigated the use of the quantum Grover algorithm in the mass-spectrometry-based protein identification process. The approach coded the mass spectra on a quantum register and uses the Grover search algorithm for searching multiple solutions to find matches from a database. Measurement of the fidelity between the input and final states was used to quantify the similarity between the experimental and theoretical spectra. The optimal number of iteration is proven to be pi/4sqrt[N/k] , where k refers to the number of marked states. We found that one iteration is sufficient for the search if we let more that 62% of the N states be marked states. By measuring the fidelity after only one iteration of Grover search, we discovered that it resembles that of the correlation-based measurement used in the existing protein identification software. We concluded that the quantum Grover algorithm can be adapted for a correlation-based mass spectra database search, provided that decoherence can be kept to a minimum.
The Grover search is a well-known quantum algorithm that outperforms any classical search algorithm. It is known that quantum correlations such as entanglement are responsible for the power of some quantum information protocols. But entanglement is not the only kind of quantum correlations. Other quantum correlations such as quantum discord are also useful to capture some important properties of the nonclassical correlation. Also there is no well-accepted and clear distinction between quantum correlations and classical correlations. In this paper, we systematically investigate several kinds of correlations including both quantum and classical in the whole process of the Grover search algorithm. These correlations are the concurrence, entanglement of formation, quantum discord, classical correlation and mutual information. The behaviors of quantum discord, classical correlation and mutual information are almost the same while the concurrence is different in the qubit–qubit case. For the qubit partition 1: n case, the behaviors of all correlations are qualitative the same. When the search is over, all kinds of correlations are zero, we argue that this is necessary for the final step in the search.
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.