Comment Selective values, pre-computation, and more lies (Score 1) 1
Using the answer to generate a compiled Shor's Algorithm for 15 and 21 with a classical computer, failing for 35.
Picking numbers with lots of 0s in binary to get large values that are easy to factor.
Picking 2 numbers that are within 2-3 bits difference, using a square root and iterating to get the factors.
None of these are valid cases for quantum factorization. The entire fact that no quantum factorization has ever been successful, yet the news is full of these trick success stories.
There needs to be a closer look into these "success" stories, showing how the numbers used are valid, the methods used are not smoke and mirrors!
This needs to become a new headline: "Quantum Computers can't break into anything" or "Quantum Computing is still a toy" or "All our crypto is safe from quantum computing". Then we need to revisit the need to add expense to our existing systems with larger key sizes and post-quantum cryptography.