Spectral Signatures of Prime Factorization
Giuseppe Mussardo, Andrea Trombettoni

TL;DR
The paper introduces a quantum-based method for factoring integers using a specialized quantum device and measurements.
Contribution
A novel quantum protocol for integer factorization using a single-purpose quantum device and decoupling preparation cost from computation.
Findings
Factorization of integers N ≤ Λ requires I quantum measurements, where I is the number of prime factors.
Device initialization can be efficiently implemented on a quantum computer in d steps.
The method involves solving ~2d differential equations for device construction.
Abstract
We present a protocol for integer factorization for all integers N below a certain cut-off Λ=2d, grounded in the theory of quantum measurement. In this framework, the factorization of an integer N≤Λ is achieved in a number of steps equal to the total number I of primes present in its factorization; explicitly, the procedure consists of a sequence of I quantum measurements. The method requires a single-purpose quantum device designed to perform measurements of an observable with a prescribed spectrum. Crucially, the construction of this device involves solving, once and for all, a set of approximately 2d differential equations, independently of the specific integer to be factorized. We argue that the initialization task of this device can be efficiently implemented on a quantum computer in d steps, thereby decoupling the computational cost of device preparation from the factorization…
Click any figure to enlarge with its caption.
Figure 1
Figure 2Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
