Quantum physics is surprising in many ways. One surprise is the threat to locality implied by Bell’s Theorem. Another surprise is the capacity of quantum computation, which poses a threat to the complexity-theoretic Church-Turing thesis. In both cases, the surprise may be due to taking for granted a strict arrow-of-time assumption whose applicability may be limited to the classical domain. This possibility has been noted repeatedly in the context of Bell’s Theorem. The argument concerning quantum computation is described here. Further development of models which violate this strong arrow-of-time assumption, replacing it by a weaker arrow which is yet to be identified, is called for.
Algorithm for quantum computation of particle decays