Digitized Adiabatic Quantum Factorization

TL;DR

This paper introduces a digitized-adiabatic quantum algorithm for integer factorization, optimized for current noisy intermediate-scale quantum computers, and demonstrates its effectiveness on IBM's quantum hardware.

Contribution

It presents a novel digitized-adiabatic factorization method enhanced by shortcuts to adiabaticity, suitable for existing quantum computers, and shows improved performance over traditional algorithms.

Findings

Successfully tested on IBM quantum hardware with up to six qubits.

Outperformed common factorization algorithms on current quantum devices.

Demonstrated potential for near-term quantum advantage in factorization.

Abstract

Quantum integer factorization is a potential quantum computing solution that may revolutionize cryptography. Nevertheless, a scalable and efficient quantum algorithm for noisy intermediate-scale quantum computers looks far-fetched. We propose an alternative factorization method, within the digitized-adiabatic quantum computing paradigm, by digitizing an adiabatic quantum factorization algorithm enhanced by shortcuts to adiabaticity techniques. We find that this fast factorization algorithm is suitable for available gate-based quantum computers. We test our quantum algorithm in an IBM quantum computer with up to six qubits, surpassing the performance of the more commonly used factorization algorithms on the long way towards quantum advantage.