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:quant-ph/0604059 · Communications in Theoretical Physics

Quantum Query Complexity for Searching Multiple Marked States from an Unsorted Database

Shang Bin

Published Aug 1, 2007• 3 citations
arXivHTMLPDF

Abstract

An important and usual sort of search problems is to find all marked states from an unsorted database with a large number of states. Grover's original quantum search algorithm is for finding single marked state with uncertainty, and it has been generalized to the case of multiple marked states, as well as been modified to find single marked state with certainty. However, the query complexity for finding all multiple marked states has not been addressed. We use a generalized Long's algorithm with high precision to solve such a problem. We calculate the approximate query complexity, which increases with the number of marked states and with the precision that we demand. In the end we introduce an algorithm for the problem on a ``duality computer'' and show its advantage over other algorithms.

DOI
10.1088/0253-6102/48/2/013

Related papers

Robust Quantum Search with Uncertain Number of Target States

Yuanyue Zhu, Zeguo Wang, Bao Yan +1 more

The quantum search algorithm is one of the milestones of quantum algorithms. Compared with classical algorithms, it shows quadratic speed-up when searching marked states in an unsorted database. However, the success rates of quantum search algorithms are sensitive to the number of marked states. In this paper, we study the relation between the success rate and the number of iterations in a quantum search algorithm of given λ=M/N, where M is the number of marked state and N is the number of items in the dataset. We develop a robust quantum search algorithm based on Grover–Long algorithm with some uncertainty in the number of marked states. The proposed algorithm has the same query complexity ON as the Grover’s algorithm, and shows high tolerance of the uncertainty in the ratio M/N. In particular, for a database with an uncertainty in the ratio M±MN, our algorithm will find the target states with a success rate no less than 96%.

Entropy•Dec 8, 2021•5 citations

Improved quantum multi-object search algorithm

Wei-Yun Ma

Grover’s quantum mechanical search algorithm solves the unsorted database search with quadratic speed-up over the classical algorithms.But Grover’s algorithm will be inefficient when the number of matching is close to 2n/2.This paper presents a quantum algorithm which can get a target item with certainty by a single query when the number of the target items is more than a quarter.

Computer Engineering and Applications Journal•Jan 1, 2009•0 citations

Exact quantum search by parallel unitary discrimination schemes

Xiaodi Wu, Runyao Duan

We study the unsorted database search problem with items $N$ from the viewpoint of unitary discrimination. Instead of considering the famous $O(\sqrt{N})$ Grover bounded-error algorithm for the original problem, we seek the results for the exact algorithms, i.e., those that succeed with certainty. Under the standard oracle model ${\ensuremath{\sum}}_{j}{(\ensuremath{-}1)}^{{\ensuremath{\delta}}_{\ensuremath{\tau}j}}|j⟩⟨j|$, we demonstrate a tight lower bound $\frac{2}{3}N+o(N)$ of the number of queries for any parallel scheme with unentangled input states. With the assistance of entanglement, we obtain a general lower bound $\frac{1}{2}(N\ensuremath{-}\sqrt{N})$. We provide concrete examples to illustrate our results. In particular, we show that the case of $N=6$ can be solved exactly with only two queries by using a bipartite entangled input state. Our results indicate that in the standard oracle model the complexity of the exact quantum search with one unique solution can be strictly less than that of the calculation of the OR function.

arXiv:0709.3627•Physical Review A•Jul 2, 2008•16 citations

Deleting a marked item from an unsorted database with a single query

Yang Liu, Long, Gui Lu

In this Letter we present a quantum deletion algorithm that deletes a marked state from an unsorted database of $N$ items with only a single query. This algorithm achieves exponential speedup compared with classical algorithm where O(N) number of query is required. General property of this deleting algorithm is also studied.

arXiv:0710.3301•Oct 17, 2007•4 citations

An efficient quantum search engine on unsorted database

Heping Hu, Yingyu Zhang, Zhengding Lu

We consider the problem of finding one or more desired items out of an unsorted database. Patel has shown that if the database permits quantum queries, then mere digitization is sufficient for efficient search for one desired item. The algorithm, called factorized quantum search algorithm, presented by him can locate the desired item in an unsorted database using $O(log_{4}N)$ queries to factorized oracles. But the algorithm requires that all the property values must be distinct from each other. In this paper, we discuss how to make a database satisfy the requirements, and present a quantum search engine based on the algorithm. Our goal is achieved by introducing auxiliary files for the property values that are not distinct, and converting every complex query request into a sequence of calls to factorized quantum search algorithm. The query complexity of our algorithm is $O(P*Q*M*log_{4}N)$, where P is the number of the potential simple query requests in the complex query request, Q is the maximum number of calls to the factorized quantum search algorithm of the simple queries, M is the number of the auxiliary files for the property on which our algorithm are searching for desired items. This implies that to manage an unsorted database on an actual quantum computer is possible and efficient.

arXiv:0904.3060•Apr 20, 2009•0 citations

Analysis of Grover’S Quantum Search Algorithm on a Classical Computer

Necati Çelik, Özkan Bingöl

In this paper, Grover's quantum search algorithm is analyzed using a classical computer by calculating the amplitudes and the probabilities of finding a single marked state for n=5, 10, 15, 20, 25, and 27 qubit states.The calculations show that the marked state can be found in 𝒪(√𝑁) iterations, where 𝑁 = 2 ( is the number of items.The possibility of improving Grover's search algorithm to find a single item in N search elements is discussed by calculating the amplitudes and hence the probabilities of finding a single marked state for n=5, 10, 15, 20, 25, 30, 35, 40, 45, and 50 qubit states.The calculations showed that the marked state could be found with sufficiently high probability in 𝒪(ln (𝑁)) iterations.This is quite a remarkable speed-up that can be achieved to find a single marked element in an unsorted N search element.

Sigma Journal of Engineering and Natural Sciences – Sigma Mühendislik ve Fen Bilimleri Dergisi•Jan 1, 2022•6 citations
An important and usual sort of search problems is to find all marked states from an unsorted database with a large number of states. Grover's original quantum search algorithm is for finding single marked state with uncertainty, and it has been generalized to the case of multiple marked states, as well as been modified to find single marked state with certainty. However, the query complexity for finding all multiple marked states has not been addressed. We use a generalized Long's algorithm with high precision to solve such a problem. We calculate the approximate query complexity, which increases with the number of marked states and with the precision that we demand. In the end we introduce an algorithm for the problem on a ``duality computer'' and show its advantage over other algorithms.
The quantum search algorithm is one of the milestones of quantum algorithms. Compared with classical algorithms, it shows quadratic speed-up when searching marked states in an unsorted database. However, the success rates of quantum search algorithms are sensitive to the number of marked states. In this paper, we study the relation between the success rate and the number of iterations in a quantum search algorithm of given λ=M/N, where M is the number of marked state and N is the number of items in the dataset. We develop a robust quantum search algorithm based on Grover–Long algorithm with some uncertainty in the number of marked states. The proposed algorithm has the same query complexity ON as the Grover’s algorithm, and shows high tolerance of the uncertainty in the ratio M/N. In particular, for a database with an uncertainty in the ratio M±MN, our algorithm will find the target states with a success rate no less than 96%.
We study the unsorted database search problem with items NNN from the viewpoint of unitary discrimination. Instead of considering the famous O(N)O(\sqrt{N})O(N​) Grover bounded-error algorithm for the original problem, we seek the results for the exact algorithms, i.e., those that succeed with certainty. Under the standard oracle model ${\ensuremath{\sum}}_{j}{(\ensuremath{-}1)}^{{\ensuremath{\delta}}_{\ensuremath{\tau}j}}|j⟩⟨j|$, we demonstrate a tight lower bound 23N+o(N)\frac{2}{3}N+o(N)32​N+o(N) of the number of queries for any parallel scheme with unentangled input states. With the assistance of entanglement, we obtain a general lower bound $\frac{1}{2}(N\ensuremath{-}\sqrt{N})$. We provide concrete examples to illustrate our results. In particular, we show that the case of N=6N=6N=6 can be solved exactly with only two queries by using a bipartite entangled input state. Our results indicate that in the standard oracle model the complexity of the exact quantum search with one unique solution can be strictly less than that of the calculation of the OR function.
In this Letter we present a quantum deletion algorithm that deletes a marked state from an unsorted database of NNN items with only a single query. This algorithm achieves exponential speedup compared with classical algorithm where O(N) number of query is required. General property of this deleting algorithm is also studied.
We consider the problem of finding one or more desired items out of an unsorted database. Patel has shown that if the database permits quantum queries, then mere digitization is sufficient for efficient search for one desired item. The algorithm, called factorized quantum search algorithm, presented by him can locate the desired item in an unsorted database using O(log4N)O(log_{4}N)O(log4​N) queries to factorized oracles. But the algorithm requires that all the property values must be distinct from each other. In this paper, we discuss how to make a database satisfy the requirements, and present a quantum search engine based on the algorithm. Our goal is achieved by introducing auxiliary files for the property values that are not distinct, and converting every complex query request into a sequence of calls to factorized quantum search algorithm. The query complexity of our algorithm is O(P∗Q∗M∗log4N)O(P*Q*M*log_{4}N)O(P∗Q∗M∗log4​N), where P is the number of the potential simple query requests in the complex query request, Q is the maximum number of calls to the factorized quantum search algorithm of the simple queries, M is the number of the auxiliary files for the property on which our algorithm are searching for desired items. This implies that to manage an unsorted database on an actual quantum computer is possible and efficient.
In this paper, Grover's quantum search algorithm is analyzed using a classical computer by calculating the amplitudes and the probabilities of finding a single marked state for n=5, 10, 15, 20, 25, and 27 qubit states.The calculations show that the marked state can be found in 𝒪(√𝑁) iterations, where 𝑁 = 2 ( is the number of items.The possibility of improving Grover's search algorithm to find a single item in N search elements is discussed by calculating the amplitudes and hence the probabilities of finding a single marked state for n=5, 10, 15, 20, 25, 30, 35, 40, 45, and 50 qubit states.The calculations showed that the marked state could be found with sufficiently high probability in 𝒪(ln (𝑁)) iterations.This is quite a remarkable speed-up that can be achieved to find a single marked element in an unsorted N search element.