https://hackerpaper.kaipfister.de/p/quant-ph_9907007/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=8235572urn:hackerpapers:mention:quant-ph_9907007:8235572Thu, 28 Aug 2014 01:48:21 GMT<p>The term you&#x27;re looking for is counterfactual computation [1]: &gt; We show that &quot;interaction-free&quot; measurements can be regarded as counterfactual computations, and our results then imply that N [the number of times that the computer is not run] must be large if the probability of interaction is to be close to zero. Finally, we consider some ways in which our formulation of counterfactual computation can be generalised. 1: http://arxiv.org/abs/quant-ph/9907007</p><p><a href="https://hackerpaper.kaipfister.de/p/quant-ph_9907007/">Paper and discussion history</a>. A mention is not an endorsement.</p>quant-ph