Spectral Signatures of Prime Factorization

We present a protocol for integer factorization for all integers <i>N</i> 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>I</i> of primes present in its factorization; explicitly, the procedure consists of a sequence of <i>I</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 <i>d</i> steps, thereby decoupling the computational cost of device preparation from the factorization process itself.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2026-03-23
DOI
https://doi.org/10.3390/e28030363
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Spectral Signatures of Prime Factorization

Giuseppe Mussardo, Andrea Trombettoni
Entropy
Quantum Computing Algorithms and Architecture
article

Spectral Signatures of Prime Factorization

Giuseppe Mussardo, Andrea Trombettoni
article en

Abstract

We present a protocol for integer factorization for all integers <i>N</i> 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>I</i> of primes present in its factorization; explicitly, the procedure consists of a sequence of <i>I</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 <i>d</i> steps, thereby decoupling the computational cost of device preparation from the factorization process itself.

EntropyVol. 28(3)
Scuola Internazionale Superiore di Studi Avanzati (IT), University of Trieste (IT), Istituto Nazionale di Fisica Nucleare, Sezione di Trieste (IT)
Openalex Percentile: Top 13%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.