Reducing Iterations of Grover Search Algorithm for N-Queen Problem U sing Quantum Permutation States

Jinyoung Ha, Jun Heo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we propose a construction method of Grover's algorithm to solve the N-Queen problem. Quantum permutation state was designed and applied to the initialization and amplitude amplification process in Grover's algorithm. An oracle-level quantum circuit was constructed using Boolean algebraic expressions. We reduced the number of iterations of the Grover's algorithm by decreasing the number of superposed inputs in the initialize step using quantum permutation state. We show that our algorithm has less time complexity compared to previous study that solved the N -Queen problem using Grover's algorithm with W state as a input.

Original languageEnglish
Title of host publicationICTC 2022 - 13th International Conference on Information and Communication Technology Convergence
Subtitle of host publicationAccelerating Digital Transformation with ICT Innovation
PublisherIEEE Computer Society
Pages329-331
Number of pages3
ISBN (Electronic)9781665499392
DOIs
Publication statusPublished - 2022
Event13th International Conference on Information and Communication Technology Convergence, ICTC 2022 - Jeju Island, Korea, Republic of
Duration: 2022 Oct 192022 Oct 21

Publication series

NameInternational Conference on ICT Convergence
Volume2022-October
ISSN (Print)2162-1233
ISSN (Electronic)2162-1241

Conference

Conference13th International Conference on Information and Communication Technology Convergence, ICTC 2022
Country/TerritoryKorea, Republic of
CityJeju Island
Period22/10/1922/10/21

Bibliographical note

Publisher Copyright:
© 2022 IEEE.

Keywords

  • Grover's algorithm
  • N-Queen problem
  • Quan-tum computing
  • Quantum algorithm
  • W state

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Reducing Iterations of Grover Search Algorithm for N-Queen Problem U sing Quantum Permutation States'. Together they form a unique fingerprint.

Cite this