https://hackerpaper.kaipfister.de/p/1111.3633/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=20492890urn:hackerpapers:mention:1111.3633:20492890Sun, 21 Jul 2019 18:35:15 GMT<p>On point 1: I did not get your argument about NP hardness and equivalence to graph isomorphism. On the contrary, algorithms for efficiently simulating non-trivial QFTs on a non-relativistic quantum computers exist: https://arxiv.org/abs/1111.3633 Point 2: If &quot;there is nothing fundamental about measuring&quot; in the QFT case, I do not see what is so special about the QM case (you just take a partial trace over the &quot;environment&quot;). I (admittedly with humility as I am not as well versed in QFT) really do not see how your answer is any different from this (and I do not see how the path integral gives…</p><p><a href="https://hackerpaper.kaipfister.de/p/1111.3633/">Paper and discussion history</a>. A mention is not an endorsement.</p>quant-ph