Yeah, except when your "2048-bit" numbers are guaranteed to have factors that differ by exactly two bits, you can factor them with any computer you want.

The D-wave also isn't capable of Shor's algorithm or any other quantum-accelerated version of this problem.

▲

westurner 4 days ago | parent | next [-]

Have you or anyone else proven that there is no annealing implementation of Shor's?

Why are you claiming superiority in ignorance?

▲

maratc 5 days ago | parent | prev [-]

I was at a lecture by a professor who's working in the field, his main argument was that quantum computers are physically impossible to scale.

He presented us with a picture of him and a number of other very important scientists in this field, none of them sharing his attitude. We then joked that there is a quantum entanglement of Nobel prize winners in the picture.

	▲	westurner 4 days ago \| parent [-]
		I don't think that that professor was correct. The universe is constantly doing large, scaled quantum computations. The number of error-corrected qubits per QC will probably increase at an exponential rate. Whether there is a problem decomposition strategy for RSA could change. Oh, entanglement and the prize! Adherence to Bell's is abstruse and obtuse. Like attaching to a student of Minkowkski's who served as an honorable patent examiner in Europe who moved to America. We might agree that there are many loopholes by which information sharing through entanglement is possible; that Bell's theorem is not a real limit to communications or QC because there are many "loopholes to"