Replication of Quantum Factorisation Records with an 8-bit Home Computer, an Abacus, and a Dog (https://eprint.iacr.org/2025/1237.pdf) Since all demonstrations of quantum factorisation to date have involved either sleight-of-hand numbers, sleight-of-hand preprocessing on a computer, or both, we propose the following standard evaluation criteria for future claims of quantum factorisation. - The factors are of a nontrivial size, 64 or 128 bits. This makes the problem space large enough that the solution can’t be found through simple search techniques unrelated to factorisation. - The factors are two prime values with a large difference between them and containing a 50:50 mix of 0 and 1 bits, randomly distributed. This prevents the construction of sleight-of-hand numbers that are readily amenable to factorisation via physics experiments. - No preprocessing of the value to be factorised using a computer is permitted. This prevents the problem from being transformed into a different, easily-solved sleight-ofhand problem before the physics experiment even begins. - The factors are unknown to the experimenters. This prevents the current practice of short-circuiting the factorisation process by taking advantage of knowing the answer before the process has even begun. - The factorisation is performed on ten different values with the properties given above. This demonstrates repeatability of the process. https://fountain.fm/episode/fRkg022wzHHlxPipQaZM
