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

Acta Physica Sinica

Quantum voting protocols based on the non-symmetric quantum channel with controlled quantum operation teleportation

Wang Yu-wu, Wei Xiang-he, Zhu Zhao-Hui

Published Jan 1, 2013• 14 citations
Publisher

Abstract

In the paper, we present a kind of quantum voting protocol, which is based on controlled quantum teleportation of local unitary operations in non-symmetric quantum channel. In this protocol, the umpire CA with zero knowledge proof quantum identity authentication ensures voter’s anonymous identity authentication. The counting institution Bob generates a high-dimensional Greenberger-Horne-Zeilinger entangled state to establish a high-dimensional quantum communication channel. Performing the local unitary operation on their low-dimensional quantum ballot, voter’s quantum vote is teleportated by asymmetric matrix measurement and scrutineer Charlie auxiliary measuring. With the scrutineer Charlie’s help, Bob achieves the voting result by the output of unitary operation. Compared with other general quantum operation teleportation quantum voting protocol, the protocol utilizes the quantum information and transmission of quantum channel, which have different dimensions, so single particle information cannot be stolen, and can prevent forgery. The electoral process is fair and undeniable, owing to Charlie’s supervision. Since the success probability of quantum teleportation of local unitary operations is 1, the quantum voting is reliable.

DOI
10.7498/aps.62.160302

Related papers

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

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

Novel traveling quantum anonymous voting scheme via GHZ states

Wenhao Zhao, Min Jiang

Based on traveling ballot mode, we propose a secure quantum anonymous voting via Greenberger–Horne–Zeilinger (GHZ) states. In this scheme, each legal voter performs unitary operation on corresponding position of particle sequence to encode his/her voting content. The voters have multiple ballot items to choose rather than just binary options “yes” or “no”. After counting votes phase, any participant who is interested in voting results can obtain the voting results. To improve the efficiency of the traveling quantum anonymous voting scheme, an optimization method based on grouping strategy is also presented. Compared with the most existing traveling quantum voting schemes, the proposed scheme is more practical because of its privacy, verifiability and non-repeatability. Furthermore, the security analysis shows that the proposed traveling quantum anonymous voting scheme can prevent various attacks and ensure high security.

Chinese Physics B•Oct 19, 2022•3 citations

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

Guang-Bao Xu, Meng-Na Li, Yu-Guang Yang +1 more

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.

quant-pharXiv:2609.39835•Oct 1, 2026•0 citations

Quantum Distributed Ballot Scheme Based on Entanglement Swapping

Xiaoping Lou, Zhigang Chen

We proposed a novel quantum distributed ballot scheme using swapping quantum entanglement of Bell states. The entanglement is distributed over separated voter's sites; physical inaccessibility of any one site is sufficient to guarantee the anonymity of the votes. The ballot information is encoded by local operations performed on the particles of entangled EPR states, which ensures the security present scheme. The checking phase is designed in detail based on entanglement swapping. The security of these protocols with respect to various kinds of attack is discussed.

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Nov 1, 2011•1 citation

Single particle electronic voting scheme based on quantum ring signature

Zihao Xiong, Aihan Yin

Based on the ring signature approach, this paper proposes a quantum voting protocol using single-particle states where voters can choose their voters from among the candidates without revealing their identities. In this protocol, voters hide their voting information into the envelope prepared by the voting center and the vote-counter through the quantum Fourier transform and the unitary operation, the voting center and the vote-counter will each generate only half of the voter’s identity information, and the voter’s identity information is secured by the mutual supervision of the voting center and the vote-counter. Because the protocol uses single particle states, which effectively reduces the difficulty of implementing this protocol, the security analysis shows that the protocol is secure.

Modern Physics Letters A•Aug 30, 2022•5 citations
In the paper, we present a kind of quantum voting protocol, which is based on controlled quantum teleportation of local unitary operations in non-symmetric quantum channel. In this protocol, the umpire CA with zero knowledge proof quantum identity authentication ensures voter’s anonymous identity authentication. The counting institution Bob generates a high-dimensional Greenberger-Horne-Zeilinger entangled state to establish a high-dimensional quantum communication channel. Performing the local unitary operation on their low-dimensional quantum ballot, voter’s quantum vote is teleportated by asymmetric matrix measurement and scrutineer Charlie auxiliary measuring. With the scrutineer Charlie’s help, Bob achieves the voting result by the output of unitary operation. Compared with other general quantum operation teleportation quantum voting protocol, the protocol utilizes the quantum information and transmission of quantum channel, which have different dimensions, so single particle information cannot be stolen, and can prevent forgery. The electoral process is fair and undeniable, owing to Charlie’s supervision. Since the success probability of quantum teleportation of local unitary operations is 1, the quantum voting is reliable.
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.
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.
Based on traveling ballot mode, we propose a secure quantum anonymous voting via Greenberger–Horne–Zeilinger (GHZ) states. In this scheme, each legal voter performs unitary operation on corresponding position of particle sequence to encode his/her voting content. The voters have multiple ballot items to choose rather than just binary options “yes” or “no”. After counting votes phase, any participant who is interested in voting results can obtain the voting results. To improve the efficiency of the traveling quantum anonymous voting scheme, an optimization method based on grouping strategy is also presented. Compared with the most existing traveling quantum voting schemes, the proposed scheme is more practical because of its privacy, verifiability and non-repeatability. Furthermore, the security analysis shows that the proposed traveling quantum anonymous voting scheme can prevent various attacks and ensure high security.
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.
We proposed a novel quantum distributed ballot scheme using swapping quantum entanglement of Bell states. The entanglement is distributed over separated voter's sites; physical inaccessibility of any one site is sufficient to guarantee the anonymity of the votes. The ballot information is encoded by local operations performed on the particles of entangled EPR states, which ensures the security present scheme. The checking phase is designed in detail based on entanglement swapping. The security of these protocols with respect to various kinds of attack is discussed.
Based on the ring signature approach, this paper proposes a quantum voting protocol using single-particle states where voters can choose their voters from among the candidates without revealing their identities. In this protocol, voters hide their voting information into the envelope prepared by the voting center and the vote-counter through the quantum Fourier transform and the unitary operation, the voting center and the vote-counter will each generate only half of the voter’s identity information, and the voter’s identity information is secured by the mutual supervision of the voting center and the vote-counter. Because the protocol uses single particle states, which effectively reduces the difficulty of implementing this protocol, the security analysis shows that the protocol is secure.