"Pretending to factor large numbers on a quantum computer (2013)"
"Of course this should not be considered a serious demonstration of Shor’s algorithm. It does, however,
illustrate the danger in “compiled” demonstrations of Shor’s algorithm. To varying degrees,
all previous factorization experiments have benefited from this artifice. While there is no objection
to having a classical compiler help design a quantum circuit (indeed, probably all quantum
computers will function in this way), it is not legitimate for a compiler to know the answer to the
problem being solved. To even call such a procedure compilation is an abuse of language."
https://arxiv.org/abs/1301.7007
"Pretending to factor large numbers on a quantum computer (2013)"
"Of course this should not be considered a serious demonstration of Shor’s algorithm. It does, however, illustrate the danger in “compiled” demonstrations of Shor’s algorithm. To varying degrees, all previous factorization experiments have benefited from this artifice. While there is no objection to having a classical compiler help design a quantum circuit (indeed, probably all quantum computers will function in this way), it is not legitimate for a compiler to know the answer to the problem being solved. To even call such a procedure compilation is an abuse of language."
More references:
https://crypto.stackexchange.com/questions/59795/largest-int...