Lloyd et al.'s 2010 postselected-closed-timelike-curve paper cites Aharonov's weak-value paper and Aaronson's postselection result in the same argument

quantum-foundationsretrocausalityclosed-timelike-curvespostselectionaharonovaaronsoncomputational-complexity

Lloyd, Maccone, Garcia-Patron, Giovannetti, Shikano, Pirandola, Rozema, Darabi, Soudagar, Shalm, and Steinberg's 2010 paper "Closed timelike curves via post-selection: theory and experimental demonstration" proposes postselected closed timelike curves (P-CTCs), built on quantum-teleportation-with-postselection, as a physically distinct alternative to David Deutsch's 1991 quantum model of closed timelike curves (D-CTCs). In motivating the P-CTC construction, the paper states that P-CTCs "share some properties with the weak value interpretation of quantum mechanics," citing Aharonov, Albert, and Vaidman's 1988 paper that introduced the weak value (the companion concept to Yakir Aharonov's two-state vector formalism; see claim-aharonov-1988-weak-value-origin-disturbance-scales-epsilon-squared). In a separate, later paragraph — on the computational power of CTCs, about a page further on — the paper invokes Scott Aaronson's 2005 result on the computational power of postselection to establish that P-CTCs can efficiently solve problems in the complexity class PP.

This is the documented point of contact between Aharonov's retrocausal/postselection program and computer-science complexity theory: not a direct citation between Aharonov and a computer scientist, but a third paper's argument that cites both — in two different paragraphs about a page apart, each hanging off the same premise, that P-CTCs rest on post-selection — to motivate why postselection-based time travel is computationally powerful. The citation chain continues in claim-brun-wilde-2012-extends-p-ctc-aaronson-postselection-citation-chain-to-factoring.