Quantum Simulation of the Factorization Problem
This work addresses the factorization problem for cryptography and number theory, presenting a novel quantum approach with potential foundational implications.
The authors tackled the integer factorization problem by deriving a Hamiltonian for a quantum simulator based on primes below √N, achieving a prediction of the prime counting function nearly identical to Riemann's R(x) for x ≪ √N.
Feynman's prescription for a quantum simulator was to find a hamitonian for a system that could serve as a computer. Pólya and Hilbert conjecture was to demonstrate Riemann's hypothesis through the spectral decomposition of hermitian operators. Here we study the problem of decomposing a number into its prime factors, $N=xy$, using such a simulator. First, we derive the hamiltonian of the physical system that simulate a new arithmetic function, formulated for the factorization problem, that represents the energy of the computer. This function rests alone on the primes below $\sqrt N$. We exactly solve the spectrum of the quantum system without resorting to any external ad-hoc conditions, also showing that it obtains, for $x\ll \sqrt{N}$, a prediction of the prime counting function that is almost identical to Riemann's $R(x)$ function. It has no counterpart in analytic number theory and its derivation is a consequence of the quantum theory of the simulator alone.