[codesushi42]

You are just plain wrong.

And you failed to consider quantum annealing as an alternative to Shor.

[scottlocklin]

You're right I do fail to consider this, as it's not really an alternative to Shor, because annealing is horse shit that nobody can decide the computational complexity of. Not even D-wave thinks it might be. [1]

[1] https://www.nature.com/articles/s41598-018-36058-z

[codesushi42]

Complexity in what terms? For a classical computer?

Besides, the empirical data shows otherwise. It takes 12 qubits to factor 15. We're up to 53 now.

With quantum annealing, a 20 bit number has been factored with 97 qubits. Not on a real quantum computer yet, of course.

So I have no idea what you are talking about.

[scottlocklin]

> Not on a real quantum computer yet, of course...

Erm, OK. I guess we agree that nobody has factored the number 15 on a quantum computer yet.

Maybe you should read the paper I helpfully linked you above.

[codesushi42]

Yes they have. You are spreading lies and FUD: https://www.google.com/amp/s/phys.org/news/2016-03-quantum-f...

I was referring to the quantum annealing example, because no 97 qubit quantum computer exists yet.

[scottlocklin]

I'm not spreading FUD; I am correcting misinformation from muppets whose understanding doesn't go beyond press releases. Nobody has yet done a Shor factorization of the number 15; the end, and even if someone's press release says so there is no scalable way of factoring large integers.

[codesushi42]

There is. Quantum annealing. I think you're just trolling at this point. Or do you not care for much reading?