Constraining the doability of relativistic quantum tasks (2019)

Relating non-local quantum computation to information theoretic cryptography (2023)

Connects $f$-routing to topics in classical cryptography, in particular conditional disclosure of secrets. Shows a sub-exponential upper bound for attacks for any $f$ and finds an $f$ that is believed to be outside of $\mathsf{P}$ (with pre-processing), but efficiently attacked

On the role of quantum communication and loss in attacks on quantum position verification (2022)

Shows that any QPV protocol that can be broken unentangled with quantum communication, but is secure against classical communication attacks, can be transformed into one that is secure against quantum communication attacks. Also notes that if the signal loss is high enough any QPV protocol can be attacked efficiently by a trivial teleportation attack

A complexity theory for non-local quantum computation (2025)

Finds relations between a wide range of different NLQC tasks, including showing that $f$-routing and $f$-BB84 are equivalent, with a constant-overhead reduction between them

Quantum tasks in Minkowski space (2012)

Considers more general quantum tasks than QPV