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

Rank lower bounds on non-local quantum computation (2024)

Provides a lower bound in terms of the Schmidt-rank of the resource state for perfect attacks. Gives linear lower bounds for some concrete functions

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

A single-qubit position verification protocol that is secure against multi-qubit attacks (2022)

Shows a robust linear lower bound on the dimension of the attack resource state