2019-11-17 Sunday - Quantum Factorization Papers

This is a placeholder blog post - as part of a deep-dive into Quantum Computing that I'm doing.

Background reading:

• https://en.wikipedia.org/wiki/Shor%27s_algorithm
• Some additional notes and links to resources I periodically update in a github repository:
• https://github.com/intltechventures/Lab.QuantumComputing

Some papers in my reading queue:

Quantum-Kit: Simulating Shor's Factorization of 24-Bit Number on Desktop

https://arxiv.org/abs/1908.07187

How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits

https://arxiv.org/abs/1905.09749

Factoring semi-primes with (quantum) SAT-solvers

https://arxiv.org/abs/1902.01448

Exact search algorithm to factorize large biprimes and a triprime on IBM quantum computer

https://arxiv.org/abs/1805.10478

Summatory function of the number of prime factors

https://arxiv.org/abs/1801.06906

On speeding up factoring with quantum SAT solvers

https://arxiv.org/abs/1910.09592