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.
Related
- Social networks, confirmation bias and shock elections
- The Geometry of Alliances: Vote Transfer Modelling in French Two-Round Elections
- ProtocolMatch: Protocol-Dependent Model Selection for Scientific Dynamics Forecasting
- Anonymous Equal-Amplitude Composite-Wave Model: Basic Axiom System v3
- A Linkable Anonymous and Verifiable Sealed-Bid Auction Scheme for Consortium Blockchain
BibTeX
@misc{xu2026selftallying,
title = {{A self-tallying quantum anonymous voting protocol for multiple-selection elections}},
author = {Guang-Bao Xu and Meng-Na Li and Yu-Guang Yang and Dong-Huan Jiang},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.39835},
eprint = {2609.39835},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.39835},
}
RIS
TY - UNPB
TI - A self-tallying quantum anonymous voting protocol for multiple-selection elections
AU - Guang-Bao Xu
AU - Meng-Na Li
AU - Yu-Guang Yang
AU - Dong-Huan Jiang
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2609.39835
UR - https://arxiv.org/abs/2609.39835
AB - 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.
ER -