Quantum Circuit Based on Grover's Algorithm to Solve Exact Cover Problem

Jehn Ruey Jiang, Yu Jie Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

In this paper, we propose a quantum circuit based on Grover's algorithm to solve the exact cover problem (ECP), which is NP-hard. A novel controlled counter is designed and used to implement the ECP oracle to check if every element is covered by a set exactly once. If so, a feasible solution is found. The phase of the qubit state representing a feasible solution is flipped by calling the oracle, and the state's amplitude is amplified through the diffusion operator o(2n) times, where n is the number of sets given in the ECP. Thanks to Grover's algorithm, the proposed quantum circuit achieves quadratic speedup compared with the classical algorithm that needs to call the oracle O(2n) times. To validate our approach, we execute the proposed quantum circuit using the IBM Quantum Lab service.

Original languageEnglish
Title of host publicationProceedings - 2023 VTS Asia Pacific Wireless Communications Symposium, APWCS 2023
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9798350316803
DOIs
StatePublished - 2023
Event2023 VTS Asia Pacific Wireless Communications Symposium, APWCS 2023 - Tainan City, Taiwan
Duration: 23 Aug 202325 Aug 2023

Publication series

NameProceedings - 2023 VTS Asia Pacific Wireless Communications Symposium, APWCS 2023

Conference

Conference2023 VTS Asia Pacific Wireless Communications Symposium, APWCS 2023
Country/TerritoryTaiwan
CityTainan City
Period23/08/2325/08/23

Keywords

  • exact cover problem
  • Grover's algorithm
  • quantum circuit
  • quantum oracle

Fingerprint

Dive into the research topics of 'Quantum Circuit Based on Grover's Algorithm to Solve Exact Cover Problem'. Together they form a unique fingerprint.

Cite this