pith. sign in

arxiv: 1702.01984 · v1 · pith:S57AX3JUnew · submitted 2017-02-07 · 🪐 quant-ph

Experimental Quantum Solution to the Dining Cryptographers Problem

classification 🪐 quant-ph
keywords quantumcryptographersdiningexperimentalphotonproblemprotocolvoters
0
0 comments X
read the original abstract

Quantum resources such as superposition and entanglement have been used to provide unconditional key distribution, secret sharing and communication complexity reduction. In this letter we present a novel quantum information protocol for dining cryptographers problem and anonymous vote casting by a group of voters. We successfully demonstrate the experimental realization of the protocol using single photon transmission. Our implementation employs a flying particle scheme where a photon passes by the voters who perform a sequence of actions (unitary transformations) on the photonic state at their local stations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.