Brun and Wilde's 2012 paper extends the Lloyd et al. P-CTC/Aaronson-postselection citation chain to concrete computational speedups including integer factoring

quantum-foundationsretrocausalityclosed-timelike-curvespostselectionaharonovaaronsoncomputational-complexity

Brun and Wilde's "Perfect state distinguishability and computational speedups with postselected closed timelike curves" builds directly on Lloyd et al.'s 2010 P-CTC-computation result, restating that the computational power of postselected closed timelike curves (P-CTCs) is equivalent to the complexity class PP "by invoking Aaronson's results concerning the power of quantum computation with postselection." The paper then uses this equivalence to construct P-CTC-assisted circuits that efficiently factor integers and solve problems in NP ∩ co-NP and in NP.

The paper does not re-cite Aharonov by name in the passages read, but it is a direct continuation of the citation chain Lloyd et al. established — showing the Aharonov-adjacent weak-value framing recorded in claim-lloyd-et-al-2010-p-ctc-paper-cites-aharonov-weak-value-and-aaronson-postselection is not an isolated citation in one paper but part of an actively extended sub-literature on retrocausality-as-computation, continuing at least through a 2025 experimental follow-up (arXiv:2501.16335, not read in full) not yet checked for whether it re-engages the weak-value framing directly or only inherits it through this chain.