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

International Journal of Theoretical Physics

The Quantum Search Algorithms for All Solutions

Hai-Sheng Li, Zhu Qingxin, Song Lan, Qian Hong Wu

Published Aug 23, 2012• 3 citations
Publisher
DOI
10.1007/s10773-012-1305-5

Related papers

Quantum search algorithms

Christoph Dürr, xb b b

•Jan 1, 2005•17 citations

Optimized quantum random-walk search algorithm for multi-solution search

Yuchao Zhang, Wan‐Su Bao, Xiang Wang +1 more

This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the search on the graph to the multi-solution case, it can be applied to analyze the multi-solution case of quantum random-walk search on the graph directly. Thus, the computational complexity of the optimized quantum random-walk search algorithm for the multi-solution search is obtained. Through numerical simulations and analysis, we obtain a critical value of the proportion of solutions q . For a given q , we derive the relationship between the success rate of the algorithm and the number of iterations when q is no longer than the critical value.

Chinese Physics B•Nov 1, 2015•7 citations

Quantum Search Algorithm for Weighted Solutions

Youngjin Seo, Yujin Kang, Jun Heo

This paper presents a quantum search algorithm (QSA) for weighted solutions. In a QSA, the final quantum state has an equal probability of solutions. However, solutions should have different probabilities in specific problems, such as dynamic spectrum management (DSM). We propose a method to make differences with probability in accordance with rewards for each solution, and present an application to DSM. The proposed algorithm has some error terms for the final quantum state, and we provide the error terms in accordance with the number of iterations. In addition, we present the simulation results of the proposed algorithm compared with a classical exact algorithm and QSA. The proposed algorithm has a lower complexity and relative difference than the classical exact algorithm. Furthermore, the proposed algorithm has a higher performance than the QSA in specific cases.

IEEE Access•Jan 1, 2022•10 citations

Quantum Search Algorithms

Uwe Schöning, Randall J. Pruim

Springer eBooks•Jan 1, 1998•1 citation

A Non-Oracle Quantum Search Algorithm and Its Experimental Implementation

Nanyang Xu, Zhu Jin, Xinhua Peng +2 more

Grover's algorithm has achieved great success. But quantum search algorithms still are not complete algorithms because of Grover's Oracle. We concerned on this problem and present a new quantum search algorithm in adiabatic model without Oracle. We analyze the general difficulties in quantum search algorithms and show how to solve them in the present algorithm. As well this algorithm could deal with both single-solution and multi-solution searches without modification. We also implement this algorithm on NMR quantum computer. It is the first experiment which perform a real quantum database search rather than a marked-state search.

arXiv:0809.0664•Sep 3, 2008•2 citations

A Modified Quantum Search Algorithm

Hossein Mehri‐Dehnavi, Hasan Dashtianeh, Hossein Yahyavi Kuchaksaraei +3 more

International Journal of Theoretical Physics•Sep 7, 2018•6 citations
This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the search on the graph to the multi-solution case, it can be applied to analyze the multi-solution case of quantum random-walk search on the graph directly. Thus, the computational complexity of the optimized quantum random-walk search algorithm for the multi-solution search is obtained. Through numerical simulations and analysis, we obtain a critical value of the proportion of solutions q . For a given q , we derive the relationship between the success rate of the algorithm and the number of iterations when q is no longer than the critical value.
This paper presents a quantum search algorithm (QSA) for weighted solutions. In a QSA, the final quantum state has an equal probability of solutions. However, solutions should have different probabilities in specific problems, such as dynamic spectrum management (DSM). We propose a method to make differences with probability in accordance with rewards for each solution, and present an application to DSM. The proposed algorithm has some error terms for the final quantum state, and we provide the error terms in accordance with the number of iterations. In addition, we present the simulation results of the proposed algorithm compared with a classical exact algorithm and QSA. The proposed algorithm has a lower complexity and relative difference than the classical exact algorithm. Furthermore, the proposed algorithm has a higher performance than the QSA in specific cases.
Grover's algorithm has achieved great success. But quantum search algorithms still are not complete algorithms because of Grover's Oracle. We concerned on this problem and present a new quantum search algorithm in adiabatic model without Oracle. We analyze the general difficulties in quantum search algorithms and show how to solve them in the present algorithm. As well this algorithm could deal with both single-solution and multi-solution searches without modification. We also implement this algorithm on NMR quantum computer. It is the first experiment which perform a real quantum database search rather than a marked-state search.