Quantum Search Algorithm for Weighted Solutions

Youngjin Seo, Yujin Kang, Jun Heo

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)16209-16224
Number of pages16
JournalIEEE Access
Publication statusPublished - 2022

Bibliographical note

Publisher Copyright:
© 2013 IEEE.


  • Dynamic spectrum management
  • graph coloring problem
  • quantum search algorithm

ASJC Scopus subject areas

  • General Computer Science
  • General Materials Science
  • General Engineering


Dive into the research topics of 'Quantum Search Algorithm for Weighted Solutions'. Together they form a unique fingerprint.

Cite this