Semiclassical Shor's Algorithm

Alfredo Iorio; Paolo Giorda; Samik Sen; Siddhartha Sen

Semiclassical Shor's Algorithm

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0303037 v2 pith:WMJEZ6R5 submitted 2003-03-07 quant-ph

Paolo Giorda , Alfredo Iorio , Samik Sen , Siddhartha Sen This is my paper

classification quant-ph

keywords algorithmsemiclassicalshorapproximationcoherentdevicesevidencesfactorize

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We propose a semiclassical version of Shor's quantum algorithm to factorize integer numbers, based on spin-1/2 SU(2) generalized coherent states. Surprisingly, we find evidences that the algorithm's success probability is not too severely modified by our semiclassical approximation. This suggests that it is worth pursuing practical implementations of the algorithm on semiclassical devices.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Mid-circuit measurement as an algorithmic primitive
quant-ph 2025-05 conditional novelty 4.0 of 10

A single-ancilla Hadamard test post-selects a QAOA state toward low-energy answers, but the implementation sets its parameters from the exact ground energy, making the convergence demonstration self-referential.

Pith tools