activity
20242026
most citedLinear gate bounds against natural functions for position-verification

3 citations · 4 across the 8 of their papers we have counts for

collaborators

8 papers

quant-ph2026

Lower bounds on non-local computation from controllable correlation

Richard Cleve, Alex May

Understanding entanglement cost in non-local quantum computation (NLQC) is relevant to complexity, cryptography, gravity, and other areas. This entanglement cost is largely unchara…

quant-ph2025

Entanglement sharing schemes

Zahra Khanian, Dongjin Lee, Debbie Leung +7

We ask how quantum correlations can be distributed among many subsystems. To address this, we define entanglement sharing schemes (ESS) where certain pairs of subsystems allow enta…

quant-ph2025

Secure quantum ranging

Yunkai Wang, Graeme Smith, Alex May

Determining and verifying an object's position is a fundamental task with broad practical relevance. We propose a secure quantum ranging protocol that combines quantum ranging with…

quant-ph2025

A complexity theory for non-local quantum computation

Andreas Bluhm, Simon Höfer, Alex May +3

Non-local quantum computation (NLQC) replaces a local interaction between two systems with a single round of communication and shared entanglement. Despite many partial results, it…

cs.FL2024

Illustrating Finite Automata with Grail+ and TikZ

Alastair May, Taylor J. Smith

In this article, we discuss a new software tool that interacts with Grail+, a library of automata-theoretic command-line utilities. Our software, the Grail+ Visualizer, takes the t…

quant-ph2024★ 1 cited

Conditional disclosure of secrets with quantum resources

Vahid R. Asadi, Kohdai Kuroiwa, Debbie Leung +3

The conditional disclosure of secrets (CDS) primitive is among the simplest cryptographic settings in which to study the relationship between communication, randomness, and securit…

quant-ph2024★ 3 cited

Linear gate bounds against natural functions for position-verification

Vahid Asadi, Richard Cleve, Eric Culf +1

A quantum position-verification scheme attempts to verify the spatial location of a prover. The prover is issued a challenge with quantum and classical inputs and must respond with…

quant-ph2024

Rank lower bounds on non-local quantum computation

Vahid R. Asadi, Eric Culf, Alex May

A non-local quantum computation (NLQC) replaces an interaction between two quantum systems with a single simultaneous round of communication and shared entanglement. We study two c…