A hybrid scheme for prime factorization and its experimental implementation using IBM quantum processor

We report a quantum–classical hybrid scheme for factorization of bi-prime numbers (which are odd and square-free) using IBM’s quantum processors. The hybrid scheme proposed here involves both classical optimization techniques and adiabatic quantum optimization techniques, and is build by extending a...

Full description

Saved in:
Bibliographic Details
Published inQuantum information processing Vol. 20; no. 3
Main Authors Saxena, Ashwin, Shukla, Abhishek, Pathak, Anirban
Format Journal Article
LanguageEnglish
Published New York Springer US 01.03.2021
Springer Nature B.V
Subjects
Data Structures and Information Theory
Factorization
Mathematical Physics
Microprocessors
Optimization
Optimization techniques
Physics
Physics and Astronomy
Prime numbers
Quantum Computing
Quantum Information Technology
Quantum Physics
Spintronics
Quantum Information
Hybrid Factorization
IBM Quantum Processor
Online AccessGet full text

Cover

More Information
Summary:We report a quantum–classical hybrid scheme for factorization of bi-prime numbers (which are odd and square-free) using IBM’s quantum processors. The hybrid scheme proposed here involves both classical optimization techniques and adiabatic quantum optimization techniques, and is build by extending a previous scheme of hybrid factorization [Pal et al., Pramana 92, 26 (2019) and Xu et al., Phys. Rev. Lett. 108, 130501 (2012)]. The quantum part of the scheme is very general in the sense that it can be implemented using any quantum computing architecture. Here, as an example, we experimentally implement our scheme for prime factorization using IBM’s QX4 quantum processor and have factorized 35.
ISSN:1570-0755
1573-1332
DOI:10.1007/s11128-021-03053-9