1.2k citations · 3.7k across the 62 of their papers we have counts for
3 papers · 2 filters
Violating the Shannon capacity of metric graphs with entanglement
Jop Briet, Harry Buhrman, Dion Gijswijt
The Shannon capacity of a graph G is the maximum asymptotic rate at which messages can be sent with zero probability of error through a noisy channel with confusability graph G. Th…
Classical simulation of entanglement swapping with bounded communication
Cyril Branciard, Nicolas Brunner, Harry Buhrman +5
Entanglement appears under two different forms in quantum theory, namely as a property of states of joint systems and as a property of measurement eigenstates in joint measurements…
Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
Harry Buhrman, Matthias Christandl, Christian Schaffner
A fundamental task in modern cryptography is the joint computation of a function which has two inputs, one from Alice and one from Bob, such that neither of the two can learn more…