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 extend...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2020-09
Main Authors: Saxena, Ashwin, Shukla, Abhishek, Pathak, Anirban
Format: Article
Language:English
Subjects:
Factorization
Microprocessors
Optimization
Optimization techniques
Prime numbers
Quantum computing
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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 factorised 35.
ISSN:2331-8422
DOI:10.48550/arxiv.2009.05840