https://hackerpaper.kaipfister.de/p/1111.4147/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=38822718urn:hackerpapers:mention:1111.4147:38822718Sun, 31 Dec 2023 08:58:12 GMT<p>Yes, using the Shor algorithm and this was achieved in... 2012 ([1], from Wikipedia). Larger cases of quantum factorization since then used non-scalable algorithms. [1] https://arxiv.org/abs/1111.4147</p><p><a href="https://hackerpaper.kaipfister.de/p/1111.4147/">Paper and discussion history</a>. A mention is not an endorsement.</p>quant-phhttps://news.ycombinator.com/item?id=5652531urn:hackerpapers:mention:1111.4147:5652531Fri, 03 May 2013 20:39:49 GMT<p>Even if quantum computers do not exist, a theoretical model of them does exist, so we can discuss them the same way we discuss a turring machine. (Although we might need to clarify which model we are talking about). However, that is irrelevant because quantum computers do exist. For example, in 2012, researcher&#x27;s factored the number 21. [1]. However, even the existence of quantum computers is irrelevant, because programming languages designed for them still exist. [2] Not only that, but you can still run programs written in such languages on a classical computer. Of course, you could also do…</p><p><a href="https://hackerpaper.kaipfister.de/p/1111.4147/">Paper and discussion history</a>. A mention is not an endorsement.</p>quant-ph