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

理论物理通讯：英文版

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

Shang Shang

Published Jan 1, 2007• 2 citations
OpenAlex

Abstract

搜索问题的一个重要、平常的种类是与很多状态从一个未排序的数据库发现所有显著状态。格罗弗的原来的量搜索算法为与不确定性发现单个显著状态，并且它被概括了到多重显著状态的盒子，以及修改了与必然发现单个显著状态。然而，为发现所有多重显著状态的询问复杂性没被探讨。我们使用一长概括了是有高精确的算法解决如此的一个问题。我们计算近似询问复杂性，它与显著状态的数字并且与我们要求的精确增加。最后，我们在“ duaiitycomputer ”上为这个问题介绍 aigorithm 并且在另外的算法上显示出它的优点。

Related papers

An efficient quantum search engine on unsorted database

Songfeng Lu, Yingyu Zhang, Fang Liu

Quantum Information Processing•Jun 7, 2013•0 citations

Search an unsorted database with quantum mechanics

Guilu Long, Yang Liu

Frontiers of Computer Science in China•Jul 1, 2007•31 citations

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

Shang Bin

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.

arXiv:quant-ph/0604059•Communications in Theoretical Physics•Aug 1, 2007•3 citations

From Quantum Query Complexity to State Complexity

Shenggen Zheng, Daowen Qiu

arXiv:1407.7342•Lecture notes in computer science•Jan 1, 2014•10 citations

Quantum Partial Searching Algorithm of a Database with Several Target Items

钟普查, 鲍皖苏, 魏云

Choi 和 Korepin [量信息处理 6 (2007 ) 243 ] 介绍了量有当每目标块包含目标项目的一样的数字时，能快速发现目标块的几个目标项目的一个数据库的部分搜索算法。实际上，在每目标块的目标项目的数字是任意的。瞄准这个盒子，我们给一个条件保证要表现的部分搜索算法和询问的数字的性能到要最小化的算法的神谕。另外，由进一步数字的计算，我们来到结论越多制服目标项目的分发，越 smaller 询问的数字。

Chinese Physics Letters•Jan 1, 2009•0 citations

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
搜索问题的一个重要、平常的种类是与很多状态从一个未排序的数据库发现所有显著状态。格罗弗的原来的量搜索算法为与不确定性发现单个显著状态，并且它被概括了到多重显著状态的盒子，以及修改了与必然发现单个显著状态。然而，为发现所有多重显著状态的询问复杂性没被探讨。我们使用一长概括了是有高精确的算法解决如此的一个问题。我们计算近似询问复杂性，它与显著状态的数字并且与我们要求的精确增加。最后，我们在“ duaiitycomputer ”上为这个问题介绍 aigorithm 并且在另外的算法上显示出它的优点。
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.
Choi 和 Korepin [量信息处理 6 (2007 ) 243 ] 介绍了量有当每目标块包含目标项目的一样的数字时，能快速发现目标块的几个目标项目的一个数据库的部分搜索算法。实际上，在每目标块的目标项目的数字是任意的。瞄准这个盒子，我们给一个条件保证要表现的部分搜索算法和询问的数字的性能到要最小化的算法的神谕。另外，由进一步数字的计算，我们来到结论越多制服目标项目的分发，越 smaller 询问的数字。
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%.