Using Single Time of Quantum Computer for Shor's Factoring Algorithm

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

Abstract

Peter Shor's in 1994 developed a factoring algorithm that can factor a composite number n in a polynomial time by using a quantum computer in one step of the algorithm. The algorithm may contain a loop that requires calling a quantum computer many times to find the order of selected number a, a\in Z_n. In this paper, the improvement to the Shor's factoring algorithm guarantees the single use of the quantum computer to find the order, where the rest of the algorithm can be implemented by a classical computer. A numerical example for the original and improved version is presented.

Original languageEnglish
Title of host publication2023 International Conference on IT Innovation and Knowledge Discovery, ITIKD 2023
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781665463720
DOIs
Publication statusPublished - 2023
Event2023 International Conference on IT Innovation and Knowledge Discovery, ITIKD 2023 - Manama, Bahrain
Duration: Mar 8 2023Mar 9 2023

Publication series

Name2023 International Conference on IT Innovation and Knowledge Discovery, ITIKD 2023

Conference

Conference2023 International Conference on IT Innovation and Knowledge Discovery, ITIKD 2023
Country/TerritoryBahrain
CityManama
Period3/8/233/9/23

Keywords

  • Factoring algorithm
  • Shor's factoring algorithm
  • polynomial time

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Information Systems
  • Decision Sciences (miscellaneous)
  • Safety, Risk, Reliability and Quality

Fingerprint

Dive into the research topics of 'Using Single Time of Quantum Computer for Shor's Factoring Algorithm'. Together they form a unique fingerprint.

Cite this