.png){kind=icon}
Return
Quantum Search Algorithm for Weighted Solutions
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2022.3149351.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Heuristic algorithms
Color
Complexity theory
Interference
Image color analysis
Search problems
Graph theory
Dynamic spectrum management
graph coloring problem
quantum search algorithm
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
The 2-Aminopyridine Nucleobase Improves Triple-Helical Recognition of RNA and DNA When Used Instead of Pseudoisocytosine in Peptide Nucleic Acids.png)
Biochemistry
OAAI
BiochemistryIF0
OAAIShareSaveShareSaveShareSaveShareSave
View more