6 citations · 12 across the 6 of their papers we have counts for
Showing 2023 · quant-phShow all
2 papers · 2 filters
quant-ph2023★ 2 cited
Algebra of Nonlocal Boxes and the Collapse of Communication Complexity
Pierre Botteron, Anne Broadbent, Reda Chhaibi +2
Communication complexity quantifies how difficult it is for two distant computers to evaluate a function f(X,Y), where the strings X and Y are distributed to the first and second c…
quant-ph2023★ 3 cited
Uncloneable Quantum Advice
Anne Broadbent, Martti Karvonen, Sébastien Lord
The famous no-cloning principle has been shown recently to enable a number of uncloneable functionalities. Here we address for the first time unkeyed quantum uncloneablity, via the…