Pith. sign in

REVIEW 1 cited by

Breaking RSA Security With A Low Noise D-Wave 2000Q Quantum Annealer: Computational Times, Limitations And Prospects

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 2005.02268 v1 pith:KUDKZUXG submitted 2020-05-05 quant-ph cs.CR

Riccardo Mengoni , Daniele Ottaviani , Paolino Iorio This is my paper · ORCID
classification quant-phcs.CR
keywords quantumannealingcomputationald-wavefactorizationlimitationsnoisetimes
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The RSA cryptosystem could be easily broken with large scale general purpose quantum computers running Shor's factorization algorithm. Being such devices still in their infancy, a quantum annealing approach to integer factorization has recently gained attention. In this work, we analyzed the most promising strategies for RSA hacking via quantum annealing with an extensive study of the low noise D-Wave 2000Q computational times, current hardware limitations and challenges for future developments.

Discussion (0). Continue with ORCID 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

  1. Improving adiabatic quantum factorization via chopped random-basis optimization

    quant-ph 2025-05 conditional novelty 4.0 of 10

    Applying CRAB schedule optimization to adiabatic factorization Hamiltonians raises final-state fidelity for integers 21 to 2479, with a performance threshold near the quantum speed limit, and the improvement survives ...

Pith tools