Quantum Anonymous Veto with Hardy Paradox
Ramij Rahaman, Marcin Wieśniak, Marek Żukowski · arXiv (Cornell University) · 2013
The Anonymous Veto (or dining cryptographers) problem, which allows a voting party in a jury to anonymously veto a decision, which is to be approved unanimously, has a classical solution in form of a protocol, security of which is guaranteed only by computational hardness. We present a generalization to a multi qu$D$it case of Hardy's argument against local realism, which avoids statistical inequalities, and show that generalized Hardy-type correlations allow a simple quantum solution of the problem. This is possible because Hardy-type conditions for correlations precisely determine a specific genuine multipartite entangled state, which can satisfy them.