A hybrid scheme for prime factorization and its experimental implementation using IBM quantum processor
arXiv:2009.05840 · doi:10.1007/s11128-021-03053-9
Abstract
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.
arXiv comment8 pages, 4 figures, 2 tables
References in corpus (21)
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- Experimental Comparison of Two Quantum Computing Architectures
- Shor's quantum factoring algorithm on a photonic chip
- Experimental demonstration of Shor's algorithm with quantum entanglement
- Computing prime factors with a Josephson phase qubit quantum processor
- Demonstration of Shor's quantum factoring algorithm using photonic qubits
- A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation
- Performing Quantum Computing Experiments in the Cloud
- Experimental test of Mermin inequalities on a 5-qubit quantum computer
- Prime factorization using quantum annealing and computational algebraic geometry
- Entropic uncertainty and measurement reversibility
- Experimental realization of quantum cheque using a five-qubit quantum computer
- Design and experimental realization of an optimal scheme for teleportion of an -qubit quantum state
- Compressed quantum computation using the IBM Quantum Experience
- Experimental Adiabatic Quantum Factorization under Ambient Conditions Based on a Solid-State Single Spin System
- Demonstrating non-Abelian braiding of surface code defects in a five qubit experiment
- Optimization and experimental realization of the quantum permutation algorithm
- Hybrid scheme for factorization: Factoring 551 using a 3-qubit NMR quantum adiabatic processor