Space-Efficient and Noise-Robust Quantum Factoring · HackerPapers discussions

Space-Efficient and Noise-Robust Quantum Factoring — mentioned by sgt101

Sun, 28 Apr 2024 10:41:52 GMT

I've been going down this rabbit hole for a few weeks. Here is what I now think. Cai 2023 (https://pages.cs.wisc.edu/~jyc/Shor-Algorithm-with-Noise.pdf) showed that there is a definite noise floor for Shor's and gave a way to determine this. New algorithms are better than Shor's the in that they are smaller in space and time and more resilient to noise. The state of the art is Ragavan et-al https://arxiv.org/abs/2310.00899. The insight in Cai's about the QFT applies to this algorithm but is less damaging as is scales the noise floor at n^3/2 not n^2. It does seem that it is believed that…

Paper and discussion history. A mention is not an endorsement.

Space-Efficient and Noise-Robust Quantum Factoring — mentioned by japanuspus

Mon, 23 Oct 2023 14:10:45 GMT

Quantum factoring may not be quite as far distant as you might think Most importantly, Shor is not the algorithm of choice for first-gen hardware where the central challenge is likely to be circuit depth due to error correction overhead. The current front-runner is a probably proposal by Regev [0] with a space-optimization by Ragavan et al. [1], which factors an n-bit integer with O(n log n) logical qubits and a circuit depth of O(n). What you should be looking for when studying quantum computing press releases is "fault tolerance": A central problem in QC is that the underlying hardware…

Paper and discussion history. A mention is not an endorsement.