Dennis Willsch, Philipp Hanussek, Georg Hoever, Madita Willsch, Fengping Jin, Hans De Raedt, Kristel Michielsen
Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
Abstract
We report on the current state of factoring integers on both digital and analog quantum computers. For digital quantum computers, we study the effect of errors for which one can formally prove that Shor's factoring algorithm fails. For analog quantum computers, we experimentally test three factorisation methods and provide evidence for a scaling performance that is absolutely and asymptotically better than random guessing but still exponential. We conclude with an overview of future perspectives on factoring large integers on quantum computers.
arXiv comments
This is an updated version (with an extended footnote on post-processing parameters and a paragraph on Schnorr's lattice-based factoring method) of the article published in https://doi.org/10.34734/FZJ-2025-01965
Journal reference
NIC Symposium 2025, Publication Series of the John von Neumann Institute for Computing (NIC) NIC Series 52, 239 - 250 (2025)
> By late 2024 the biggest numbers that had been factored by an actual digital quantum computer had 35 bits (citing https://arxiv.org/pdf/2410.14397v1 ) This is incorrect. The cited reference says "N <= 35". That N is the number being factored, not the number of bits in the…
> By late 2024 the biggest numbers that had been factored by an actual digital quantum computer had 35 bits (citing https://arxiv.org/pdf/2410.14397v1 ) This is incorrect. The cited reference says "N <= 35". That N is the number being factored, not the number of bits in the…
StrilancView on HNParent context