Experimenting with D-Wave Quantum Annealers on Prime Factorization problems
Jingwen Ding, Giuseppe Spallitta, Roberto Sebastiani

TL;DR
This paper reports on extensive experiments with D-Wave quantum annealers for prime factorization, achieving the largest number factorized to date, and shares insights into effective strategies and challenges encountered during the process.
Contribution
It provides a detailed account of experimental strategies, insights, and lessons learned for optimizing quantum annealing approaches to prime factorization.
Findings
Flux biases improve local embedding performance
Chain strengths have less impact on local embeddings
Incremental annealing offset helps reduce chain breaks
Abstract
This paper builds on top of a paper we have published very recently, in which we have proposed a novel approach to prime factorization (PF) by quantum annealing, where 8,219,999=32,749x251 was the highest prime product we were able to factorize -- which, to the best of our knowledge is the largest number which was ever factorized by means of a quantum device. The series of annealing experiments which led us to these results, however, did not follow a straight-line path; rather, they involved a convoluted trial-and-error process, full of failed or partially-failed attempts and backtracks, which only in the end drove us to find the successful annealing strategies. In this paper, we delve into the reasoning behind our experimental decisions and provide an account of some of the attempts we have taken before conceiving the final strategies that allowed us to achieve the results. This…
Peer 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.
Code & Models
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
