Disentangling the facts from the hype of quantum computing

Re:Disentangling the facts from the hype of quantum computing by orlp on Tuesday September 20, 2022 @08:29PM (#32919590)

This paper [1] claims that with their implementation they can get an AQFT (approximate QFT) with sufficient precision to factor RSA-2048 with < 0.01% error probability using 2083 qubits, 364,510 CNOT gates and 196,234 T gates, both of which can be error corrected.

[1] https://www.nature.com/articles/s41534-020-0257-5

Just because textbook QFT requires ever increasingly precise gates does not mean that this can't be worked around. If you want to do useful quantum computation you have to embrace error bounds, precision loss and probabilistic computing, which makes it quite difficult. But not impossible.

[ Parent | on HN ]

Re:Disentangling the facts from the hype of quantum computing by mikewarot on Tuesday September 20, 2022 @08:51PM (#32919715)

I looked at their source code[1], which is indeed a listing of quantum gates, but no actual code that I could run. I'd be interested to see this run in simulation even on a very small N with realistic levels of errors.

[1] https://github.com/y-nam/QFT

[ Parent | on HN ]