Researchers have reported 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 has involved both classical optimization techniques and adiabatic quantum optimization techniques, and has been built by extending a previous known scheme of hybrid factorization.
The quantum part of the scheme is very general in the sense that it can be implemented using any quantum computing architecture.
As an example, they experimentally implemented the scheme for prime factorization using IBM’s QX4 quantum processor and have factorized 35.
The post Hybrid quantum-classical scheme for prime factorization appeared first on Swiss Quantum Hub.
