6 citations · 7 across the 2 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2009★ 6 cited
Optimal quantum strong coin flipping
André Chailloux, Iordanis Kerenidis
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for p…
quant-ph2005★ 1 cited
Quantum multiparty communication complexity and circuit lower bounds
Iordanis Kerenidis
We define a quantum model for multiparty communication complexity and prove a simulation theorem between the classical and quantum models. As a result of our simulation, we show th…