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

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

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

Quantum tasks in Minkowski space (2012)

Considers more general quantum tasks than QPV