arXiv · 2609.39835
A self-tallying quantum anonymous voting protocol for multiple-selection elections
Abstract
Self-tallying quantum anonymous voting (SQAV) has drawn considerable attention since it was proposed. However, constrained by design challenges, all existing protocols only accommodate single-selection voting and cannot support multi-selection voting. In this paper, we propose a SQAV protocol with multi-selection voting functionality. In our protocol, $nm$ $n$-particle entangled states are equally divided into $n$ groups, and the $n$ particles in each entangled state are delivered to $n$ voters, one particle per voter. Each voter obtains $n$ voting vectors by sequentially measuring all his (or her) particles that belong to $n$ different group, and then encodes his or her voting information into the vector corresponding to the secret index. Due to entanglement correlation, each voter can verify whether his or her ballot is correct through computation, while any participant can obtain the vote count for each candidate through computation. Our protocol satisfies self-tallying, nonreusability, verifiability, and fairness.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Guang-Bao Xu, Meng-Na Li, Yu-Guang Yang, Dong-Huan Jiang. 2026-09-30. A self-tallying quantum anonymous voting protocol for multiple-selection elections. https://arxiv.org/abs/2609.39835
Cite the original work for its findings. Save a collection to share your selection of sources.