Factoring semi-primes with (quantum) SAT-solvers

02/04/2019
by   Michele Mosca, et al.
0

The assumed computationally difficulty of factoring large integers forms the basis of security for RSA public-key cryptography, which specifically relies on products of two large primes or semi-primes. The best-known factoring algorithms for classical computers run in sub-exponential time. Since integer factorization is in NP, one can reduce this problem to any NP-hard problem, such as Boolean Satisfiability (SAT). While reducing factoring to SAT has proved to be useful for studying SAT solvers, attempting to factor large integers via such a reduction has not been found to be successful. Shor's quantum factoring algorithm factors any integer in polynomial time, although large-scale fault-tolerant quantum computers capable of implementing Shor's algorithm are not yet available, so relevant benchmarking experiments for factoring via Shor's algorithm are not yet possible. In recent years, however, several authors have attempted factorizations with the help of quantum processors via reductions to NP-hard problems. While this approach may shed some light on some algorithmic approaches for quantum solutions to NP-hard problems, in this paper we study and question the practical effectiveness of this approach for factoring large numbers. We find no evidence that this is a viable path toward factoring large numbers, even for scalable fault-tolerant quantum computers, as well as for various quantum annealing or other special purpose quantum hardware.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2019

On speeding up factoring with quantum SAT solvers

There have been several efforts to apply quantum SAT solving methods to ...
research
08/07/2023

A Parallel and Distributed Quantum SAT Solver Based on Entanglement and Quantum Teleportation

Boolean satisfiability (SAT) solving is a fundamental problem in compute...
research
07/17/2020

Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard

Distribution networks with periodically repeating events often hold grea...
research
02/02/2023

Generalized Uncertainty Principles for Quantum Cryptography

We know the classical public cryptographic algorithms are based on certa...
research
01/01/2020

Reinforcement Quantum Annealing: A Quantum-Assisted Learning Automata Approach

We introduce the reinforcement quantum annealing (RQA) scheme in which a...
research
09/18/2023

Quantum Vision Clustering

Unsupervised visual clustering has recently received considerable attent...
research
10/29/2019

Estimating the Density of States of Boolean Satisfiability Problems on Classical and Quantum Computing Platforms

Given a Boolean formula ϕ(x) in conjunctive normal form (CNF), the densi...

Please sign up or login with your details

Forgot password? Click here to reset