Quantum Algorithms for Integer Factorization

Quantum algorithms for integer factorisation employ quantum mechanical principles to decompose composite numbers into prime factors with greater efficiency than classical approaches. Central to this endeavour is Shor’s algorithm, which reformulates factorisation as an order‐finding problem addressed via quantum phase estimation and entanglement. By harnessing superposition and interference, Shor’s algorithm attains polynomial time complexity, posing a significant challenge to current public‐key cryptography. Beyond Shor’s framework, adiabatic quantum computing techniques map factorisation onto the ground state of spin Hamiltonians, while quantum annealing methods explore energy landscapes to locate factorisation solutions. Variational algorithms iteratively approximate ground‐state configurations through parameterised circuits, offering flexible implementations on near‐term devices. Advances in reversible gate design, error mitigation and specialised encodings have enhanced scalability and robustness, enabling hybrid quantum–classical workflows that tackle medium‐sized integers. The global impact spans the anticipation of quantum threats to existing cryptosystems and the acceleration of post-quantum cryptographic standardisation, alongside driving progress in quantum hardware and algorithmic innovation.

Research from Nature Portfolio

Recent studies have devised a set of reversible parity gates that directly encode binary multiplication logic into nearest-neighbour quantum interactions. By applying a parity transformation and ground‐space encoding, these gates enable the quantum reversal of multiplication operations within adiabatic schedules, offering a modular and scalable route to integer factorisation with enhanced resource efficiency. Another line of investigation has critically assessed reductions of factorisation to Boolean satisfiability instances, evaluating the practicality of deploying quantum solvers for SAT-based factorisation. These analyses reveal that, although conceptually appealing, SAT reductions face substantial hurdles in scaling to cryptographically significant sizes, thereby guiding future algorithmic development and hardware requirements.

Research from all publishers

An optimised classical simulation of Shor’s algorithm employs matrix product state techniques to map circuit entanglement onto a one-dimensional structure, reducing memory demands and enabling the emulation of up to 60-qubit circuits. These findings inform the management of entanglement in near-term quantum devices. A proof-of-principle photonic realisation of a fully compiled Shor’s algorithm has been achieved using deterministic quantum-dot photon sources and cluster-state methods, successfully factoring 15 with minimised resource overhead and verifying genuine multiparticle entanglement. Complementing these advances, it has been shown that a single execution of the quantum order-finding routine, coupled with efficient classical post-processing, suffices to recover all prime factors of an arbitrary integer with high probability, thereby streamlining the interplay between quantum subroutines and classical computation.

Quantum Algorithms for Integer Factorization publication trend

The graph below shows the total number of articles in quantum algorithms for integer factorization across all publications each year (not limited to Nature Index journals).

Technical terms

Shor’s algorithm: A quantum procedure that factors integers in polynomial time by transforming factorisation into an order-finding task solved via quantum phase estimation.

Quantum phase estimation: A method to determine eigenvalues of unitary operators by exploiting superposition and interference, fundamental to the order-finding subroutine.

Adiabatic quantum computing: A model in which an optimisation problem is encoded in the ground state of a time-dependent Hamiltonian, and the system is evolved slowly to remain in that state.

Variational imaginary time evolution: A hybrid algorithm that uses parameterised quantum circuits to approximate the ground state of a Hamiltonian by simulating imaginary time dynamics.

Boolean satisfiability (SAT): The problem of deciding whether there exists an assignment of truth values to variables that makes a Boolean formula true, often used to represent combinatorial challenges.

References

1. Scalable set of reversible parity gates for integer factorization. Communications Physics (2023).
2. Factoring semi-primes with (quantum) SAT-solvers. Scientific Reports (2022).
3. Optimising Matrix Product State Simulations of Shor's Algorithm. Quantum (2019).
4. Proof-of-principle demonstration of compiled Shor's algorithm using a quantum dot single-photon source.. Optics Express (2020).
5. On completely factoring any integer efficiently in a single run of an order-finding algorithm. Quantum Information Processing (2021).