2 citations · 4 across the 3 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
quant-ph2025
Magic and communication complexity
Uma Girish, Alex May, Natalie Parham +1
We establish novel connections between magic in quantum circuits and communication complexity. In particular, we show that functions computable with low magic have low communicatio…
quant-ph2025★ 2 cited
Comparing classical and quantum conditional disclosure of secrets
Uma Girish, Alex May, Leo Orshansky +1
The conditional disclosure of secrets (CDS) setting is among the most basic primitives studied in information-theoretic cryptography. Motivated by a connection to non-local quantum…