Efficient quantum voting with information-theoretic security

Abstract

Efficient quantum voting with information-theoretic security is provided. A tally quantum node generates a first plurality of ballot quantum states encoding a first bit string, each of the first plurality of ballot quantum states comprising a plurality of qubits. Each of the first plurality of ballot quantum states are distributed to exactly one of a plurality of voter quantum nodes via a quantum network. At least one of the plurality of voter quantum nodes: performs a projective measurement of its one of the first plurality of ballot quantum states, and thereby determining a parity of a random pair of bits of the first bit string; reads a vote; computes a first encoded vote based on the parity and vote; broadcasts the first encoded vote and an identifier of the pair of bits to each other of the plurality of voter quantum nodes. The first bit string is provided to decode the first encoded vote.