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

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

Constraining the doability of relativistic quantum tasks (2019)

Generalises the port-based attack to more general quantum tasks and spacetime circuits. Finds that the coarse causal structure of the task is the relevant property determining whether the task is doable non-locally

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