Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.39835

A self-tallying quantum anonymous voting protocol for multiple-selection elections

Guang-Bao Xu, Meng-Na Li, Yu-Guang Yang, Dong-Huan Jiang

quant-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations
arXivHTMLPDF

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 papers

Resource-efficient self-tallying quantum anonymous voting

Yu‐Guang Yang, Shi Qiu, Yuechao Wang +2 more

Anonymous voting enables no one to link a vote and a voter and it has been widely used in contexts such as governmental elections and decision making in groups. In this paper we propose a resource-efficient self-tallying quantum anonymous voting (SQAV) protocol with two-particle entangled states. Similar to the first SQAV protocol with multipartite entangled states [Phys. Rev. A 94, 022333 (2016)], it possesses the properties of privacy, nonreusability, verifiability, fairness, binding, and self-tallying at the same time. We analyze its performance in a noisy quantum network. Our protocol requires $mn[1+{log}_{2}(n+1)]$ qubits to prepare the information states, and its quantum resource cost is lower than that of the first SQAV protocol, where ${n}^{2}{log}_{2}m+n{log}_{2}n$ qubits are required to prepare the information states. We also prove the optimality of our quantum resource cost. To be more practical, it is further generalized to the case with three kinds of votes including positive votes, negative votes, and abstaining from voting. Our generalized protocol requires $n(2m+1)[1+{log}_{2}(n+1)]$ qubits to prepare the information states, which also has lower quantum resource cost than that of the improved SQAV protocol [IEEE Trans. Inf. Forens. Secur. 17, 3264 (2022)], where ${n}^{2}{log}_{2}(2m+1)+n{log}_{2}n$ qubits are required to prepare the information states. In contrast to multipartite entangled states, two-particle entangled states are relatively easy to prepare, which makes the proposed protocol feasible using current technology.

Physical Review A•Nov 10, 2025•1 citation

Self-tallying quantum anonymous voting

Qingle Wang, Chao‐Hua Yu, Fei Gao +2 more

Anonymous voting is a voting method of hiding the link between a vote and a voter, the context of which ranges from governmental elections to decision making in small groups like councils and companies. In this paper, we propose a quantum anonymous voting protocol assisted by two kinds of entangled quantum states. Particularly, we provide a mechanism of opening and permuting the ordered votes of all the voters in an anonymous manner; any party who is interested in the voting results can acquire a permutation copy and then obtains the voting result through a simple calculation. Unlike all previous quantum works on anonymous voting, our quantum anonymous protocol possesses the properties of privacy, self-tallying, nonreusability, verifiability, and fairness at the same time. In addition, we demonstrate that the entanglement of the quantum states used in our protocol makes an attack from an outside eavesdropper and inside dishonest voters impossible. We also generalize our protocol to execute the task of anonymous multiparty computation, such as anonymous broadcast and anonymous ranking.

arXiv:1605.07942•Physical Review A•Aug 24, 2016•81 citations

Quantum Voting Protocol for Centralized and Distributed Voting Based on Phase-Flip Counting

Aydin, Ali Emre, Ammar Daskin

We introduce a quantum voting protocol that uses superposition and entanglement to enable anonymous voting with trusted voting machines, in a centralized setting with a single machine and in a distributed setting where several machines are linked to a voting center through quantum channels. A voter selects a candidate through a restricted ballot interface; the machine encodes the vote as a phase-flip operation, controlled by the voter's identity register, on an entangled candidate state. Tallying is performed by interference with a reference branch followed by a measurement of the candidate register, which reproduces the vote distribution without iterative classical counting. Because every tallying run consumes the quantum state, the machines store the cast choices classically and replay the voting stage for each run. The protocol uses only basic quantum gates (Hadamard and controlled-Z). We provide analytical examples (4 voters with 2 candidates and 8 voters with 3 candidates) and numerical experiments that simulate ideal conditions, depolarizing, memory, readout, and gate noise, faulty or mistaken ballots, larger instances with confidence intervals, and sampling convergence. The simulations reproduce the theoretical tally probabilities in the ideal case and show how the tally is distorted by noise and by faulty ballots; no error correction or mitigation is applied. Voter anonymity is formalized as the indistinguishability of tallying transcripts under vote permutations, and an identity-dephasing step renders the identity register exactly maximally mixed under the stated trust assumptions. The numbers of protocol runs needed for exact tallying and for winner identification are analyzed explicitly.

arXiv:2510.15243•Oct 17, 2025•0 citations

Are Quantum Voting Protocols Practical?

Nitin Jha, Abhishek Parakh

Quantum voting protocols aim to offer ballot secrecy and publicly verifiable tallies using physical guarantees from quantum mechanics, rather than relying solely on computational hardness. This article surveys whether such quantum voting protocols are practical. We begin by outlining core mathematical ideas such as the superposition principle, the no-cloning theorem, and quantum entanglement. We then define a common system and threat model, identifying key actors, trust assumptions, and security goals. Representative protocol families are reviewed, including entanglement-based schemes with central tallying, self-tallying designs that enable public verification, and authority-minimized approaches that certify untrusted devices through observable correlations. Finally, we evaluate implementation challenges, including loss, noise, device imperfections, scalability, and coercion resistance, and discuss realistic near-term deployment scenarios for small-scale elections.

quant-pharXiv:2601.17514•Jan 27, 2026•0 citations

Quantum anonymous voting protocol based on single-particle

Jiang-Shan Liu, Yuancheng Li, Qing-Le Wang +2 more

Abstract Anonymous voting is often one decision-making choice in many democracies. Facing the security threats from quantum computers, classical anonymous voting protocols based on computational complexity hypothesis have innovated to quantum anonymous voting protocols based on quantum mechanics. In this paper, we propose a quantum anonymous voting protocol by using high-dimension single particles. With the help of EA and T , the construction of our protocol makes each legitimate voter cast only one ballot, and all ballots open in a quite random rearrangement. Each voter can anonymously trace his/her vote by a private position index, thus our protocol achieving the precious properties of eligibility, privacy, no-reusability, verifiability and fairness. We also analyze that the protocol can successfully resist attacks from external eavesdroppers and internal participants, ensuring that our voting protocol is secure under ideal conditions. Designing mature quantum anonymous voting protocols is challenging.

Physica Scripta•Mar 26, 2021•8 citations

Decentralized quantum anonymous veto voting scheme based on measurement-device-independence

Xiaotong Xu, Runhua Shi, Weiyang Ke

Abstract To remove any trusted third party from the voting scheme, a new primitive quantum secure multiparty exclusive OR protocol based on Measurement-Device-Independence (MDI) is presented by utilizing entanglement swapping of Bell states. Based on this primitive protocol of quantum secure multiparty protocol, a novel quantum anonymous veto voting scheme is constructed, which can meet complete security attributes. Especially, this scheme does not need any third party to count the votes, while all voters can tally the voting results by themselves. At the same time, blockchain is introduced for supervision, so that the voters can verify the validity of the voting content under extreme circumstances. The voting scheme takes Bell states as quantum resources and only performs Bell states identification based on the principle of MDI, so it is feasible to implement this scheme with the present quantum information processing technologies. Finally, the proposed voting scheme is simulated in IBM Qiskit, and the simulation results show that this scheme is correct and feasible.

Physica Scripta•Aug 14, 2023•6 citations
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, nmnmnm nnn-particle entangled states are equally divided into nnn groups, and the nnn particles in each entangled state are delivered to nnn voters, one particle per voter. Each voter obtains nnn voting vectors by sequentially measuring all his (or her) particles that belong to nnn 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.
Anonymous voting enables no one to link a vote and a voter and it has been widely used in contexts such as governmental elections and decision making in groups. In this paper we propose a resource-efficient self-tallying quantum anonymous voting (SQAV) protocol with two-particle entangled states. Similar to the first SQAV protocol with multipartite entangled states [Phys. Rev. A 94, 022333 (2016)], it possesses the properties of privacy, nonreusability, verifiability, fairness, binding, and self-tallying at the same time. We analyze its performance in a noisy quantum network. Our protocol requires mn[1+log2(n+1)]mn[1+{log}_{2}(n+1)]mn[1+log2​(n+1)] qubits to prepare the information states, and its quantum resource cost is lower than that of the first SQAV protocol, where n2log2m+nlog2n{n}^{2}{log}_{2}m+n{log}_{2}nn2log2​m+nlog2​n qubits are required to prepare the information states. We also prove the optimality of our quantum resource cost. To be more practical, it is further generalized to the case with three kinds of votes including positive votes, negative votes, and abstaining from voting. Our generalized protocol requires n(2m+1)[1+log2(n+1)]n(2m+1)[1+{log}_{2}(n+1)]n(2m+1)[1+log2​(n+1)] qubits to prepare the information states, which also has lower quantum resource cost than that of the improved SQAV protocol [IEEE Trans. Inf. Forens. Secur. 17, 3264 (2022)], where n2log2(2m+1)+nlog2n{n}^{2}{log}_{2}(2m+1)+n{log}_{2}nn2log2​(2m+1)+nlog2​n qubits are required to prepare the information states. In contrast to multipartite entangled states, two-particle entangled states are relatively easy to prepare, which makes the proposed protocol feasible using current technology.
Anonymous voting is a voting method of hiding the link between a vote and a voter, the context of which ranges from governmental elections to decision making in small groups like councils and companies. In this paper, we propose a quantum anonymous voting protocol assisted by two kinds of entangled quantum states. Particularly, we provide a mechanism of opening and permuting the ordered votes of all the voters in an anonymous manner; any party who is interested in the voting results can acquire a permutation copy and then obtains the voting result through a simple calculation. Unlike all previous quantum works on anonymous voting, our quantum anonymous protocol possesses the properties of privacy, self-tallying, nonreusability, verifiability, and fairness at the same time. In addition, we demonstrate that the entanglement of the quantum states used in our protocol makes an attack from an outside eavesdropper and inside dishonest voters impossible. We also generalize our protocol to execute the task of anonymous multiparty computation, such as anonymous broadcast and anonymous ranking.
We introduce a quantum voting protocol that uses superposition and entanglement to enable anonymous voting with trusted voting machines, in a centralized setting with a single machine and in a distributed setting where several machines are linked to a voting center through quantum channels. A voter selects a candidate through a restricted ballot interface; the machine encodes the vote as a phase-flip operation, controlled by the voter's identity register, on an entangled candidate state. Tallying is performed by interference with a reference branch followed by a measurement of the candidate register, which reproduces the vote distribution without iterative classical counting. Because every tallying run consumes the quantum state, the machines store the cast choices classically and replay the voting stage for each run. The protocol uses only basic quantum gates (Hadamard and controlled-Z). We provide analytical examples (4 voters with 2 candidates and 8 voters with 3 candidates) and numerical experiments that simulate ideal conditions, depolarizing, memory, readout, and gate noise, faulty or mistaken ballots, larger instances with confidence intervals, and sampling convergence. The simulations reproduce the theoretical tally probabilities in the ideal case and show how the tally is distorted by noise and by faulty ballots; no error correction or mitigation is applied. Voter anonymity is formalized as the indistinguishability of tallying transcripts under vote permutations, and an identity-dephasing step renders the identity register exactly maximally mixed under the stated trust assumptions. The numbers of protocol runs needed for exact tallying and for winner identification are analyzed explicitly.
Quantum voting protocols aim to offer ballot secrecy and publicly verifiable tallies using physical guarantees from quantum mechanics, rather than relying solely on computational hardness. This article surveys whether such quantum voting protocols are practical. We begin by outlining core mathematical ideas such as the superposition principle, the no-cloning theorem, and quantum entanglement. We then define a common system and threat model, identifying key actors, trust assumptions, and security goals. Representative protocol families are reviewed, including entanglement-based schemes with central tallying, self-tallying designs that enable public verification, and authority-minimized approaches that certify untrusted devices through observable correlations. Finally, we evaluate implementation challenges, including loss, noise, device imperfections, scalability, and coercion resistance, and discuss realistic near-term deployment scenarios for small-scale elections.
Abstract Anonymous voting is often one decision-making choice in many democracies. Facing the security threats from quantum computers, classical anonymous voting protocols based on computational complexity hypothesis have innovated to quantum anonymous voting protocols based on quantum mechanics. In this paper, we propose a quantum anonymous voting protocol by using high-dimension single particles. With the help of EA and T , the construction of our protocol makes each legitimate voter cast only one ballot, and all ballots open in a quite random rearrangement. Each voter can anonymously trace his/her vote by a private position index, thus our protocol achieving the precious properties of eligibility, privacy, no-reusability, verifiability and fairness. We also analyze that the protocol can successfully resist attacks from external eavesdroppers and internal participants, ensuring that our voting protocol is secure under ideal conditions. Designing mature quantum anonymous voting protocols is challenging.
Abstract To remove any trusted third party from the voting scheme, a new primitive quantum secure multiparty exclusive OR protocol based on Measurement-Device-Independence (MDI) is presented by utilizing entanglement swapping of Bell states. Based on this primitive protocol of quantum secure multiparty protocol, a novel quantum anonymous veto voting scheme is constructed, which can meet complete security attributes. Especially, this scheme does not need any third party to count the votes, while all voters can tally the voting results by themselves. At the same time, blockchain is introduced for supervision, so that the voters can verify the validity of the voting content under extreme circumstances. The voting scheme takes Bell states as quantum resources and only performs Bell states identification based on the principle of MDI, so it is feasible to implement this scheme with the present quantum information processing technologies. Finally, the proposed voting scheme is simulated in IBM Qiskit, and the simulation results show that this scheme is correct and feasible.