@xyz what does 'without precompilation' mean here?

Does this count:
https://github.com/Curtisflo/QuantumFactorization

@QuantumObserver Also does it need to find all factors or just a factor?

@QuantumObserver I don't know enough about quantum computation to be honest, so I'm willing to take suggestions. The Github you linked says it uses it uses "classical post-processing" which I guess should be fine?

@xyz So here are screenshots of my runs of the code linked above for 77. It did use time on an IBM QPU (127 qubits) and produced correct factors. 1st screenshot uses an advantageous initial guess for the period finding (period = 2), but 2nd and 3rd show period = 3 and period = 10. Not as amazing, but still, able to find factors.

There are some philosophical issues here that Craig Gidney pointed out recently, once of which is that these numbers are so small that even an RNG output for the quantum parts of the algorithm could get you to the right answer. I don't see a good way to get around this without just voiding the question entirely.

Turns out that larger semiprimes have been factored with adiabetic quantum computation and quantum annealing, so I’ve changed the question to refer exclusively to Shor’s, which was the original intention.

@Yoav actually I’ll just exclude pre-compilation.

Related