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

Chinese Physics B

Anonymous voting for multi-dimensional CV quantum system

Ronghua Shi, Yi Xiao, Jinjing Shi, Ying Guo, Moon-Ho Lee

Published Jun 1, 2016• 3 citations
Publisher

Abstract

We investigate the design of anonymous voting protocols, CV-based binary-valued ballot and CV-based multi-valued ballot with continuous variables (CV) in a multi-dimensional quantum cryptosystem to ensure the security of voting procedure and data privacy. The quantum entangled states are employed in the continuous variable quantum system to carry the voting information and assist information transmission, which takes the advantage of the GHZ-like states in terms of improving the utilization of quantum states by decreasing the number of required quantum states. It provides a potential approach to achieve the efficient quantum anonymous voting with high transmission security, especially in large-scale votes.

DOI
10.1088/1674-1056/25/6/060301

Related papers

Experimental demonstration of a two-voter quantum anonymous voting prototype with continuous variables

Piao Tan, Peng Huang, Qijun Zhang +6 more

Classical electronic voting is increasingly being adopted for Internet-based elections, requiring system designs that ensure fairness, legitimacy, verifiability, and voter anonymity-thereby preserving ballot confidentiality, uniqueness, and integrity. Quantum voting can provide information-theoretic security against repudiation and forgery in such systems. However, compared to classical voting protocols, current quantum voting protocols often suffer from limited efficiency, high cost, and implementation complexity. Here, we introduce a streamlined and efficient quantum voting architecture that simplifies the process by eliminating the privacy amplification step in the voting phase while incorporating authority-assisted anonymity, while maintaining full voter authentication, voting, and tallying capabilities. In an experimental demonstration of a quantum voting network, two voters achieved authentication rates of 336 and 406 times per second over 50 km of single-mode fiber, and signed voting files of 25.02 kbit and 56.29 kbit at a quantum signing rate of 966 times per second, resulting in total voting rates of 244 and 279 times per second, respectively. This work represents the first experimental implementation of a continuous-variable (CV)-based quantum anonymous voting prototype. The architecture is designed to be compatible with existing coherent optical communication networks and provides a practical quantum-enhanced building block toward future voting systems.

npj Quantum Information•Jun 6, 2026•0 citations

Quantum anonymous voting for continuous variables

Lang Jiang, Guangqiang He, Ding Nie +2 more

A series of quantum voting protocols of continuous variables is proposed. Three methods are employed to ensure that the quantum voting obeys some desirable rules. Entanglement is used to keep voters away from the voting results. We enable voters to operate identically to represent the same vote to prevent the tallyman from gaining information about individual voters. We also propose an effective scheme to prevent voters from voting more than once. In both two-valued and multivalued ballot protocols, several specific constraints are set to meet the rules.

Physical Review A•Apr 9, 2012•70 citations

Efficient Quantum Voting with Information-Theoretic Security

Emil T. Khabiboulline, Juspreet Singh Sandhu, Marco Ugo Gambetta +2 more

Ensuring security and integrity of elections constitutes an important challenge with wide-ranging societal implications. Classically, security guarantees can be ensured based on computational complexity, which may be challenged by quantum computers. We show that the use of quantum networks can enable information-theoretic security for the desirable aspects of a distributed voting scheme in a resource-efficient manner. In our approach, ballot information is encoded in quantum states that enable an exponential reduction in communication complexity compared to classical communication. In addition, we provide an efficient and secure anonymous queuing protocol based on a distributed secure sum. As a result, our scheme only requires modest quantum memories with size scaling logarithmically with the number of voters. This intrinsic efficiency together with certain noise-robustness of our protocol paves the way for its physical implementation in realistic quantum networks.

arXiv:2112.14242•Dec 28, 2021•4 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

Experimental Quantum Electronic Voting

Nicolas Laurent-Puig, Matilde Baroni, Federico Centrone +1 more

Quantum information protocols offer significant advantages in properties such as security, anonymity, and privacy for communication and computing tasks. An application where guaranteeing the highest possible security and privacy is critical for democratic societies is electronic voting. As computational power continues to evolve, classical voting schemes may become increasingly vulnerable to information leakage. In this work, we present the experimental demonstration of an information-theoretically secure and efficient electronic voting protocol that, crucially, does not rely on election authorities, leveraging the unique properties of quantum states. Our experiment is based on a high-performance source of Greenberger-Horne-Zeilinger (GHZ) states and realizes a proof-of-principle implementation of the protocol in two scenarios: a configuration with four voters and two candidates employing privacy enhancement techniques and an election scenario supporting up to eight voters and sixteen candidates. The latter is particularly well-suited for secure board-level elections within organizations or small-scale governmental contexts.

quant-pharXiv:2512.03924•Physical Review Letters•Dec 4, 2025•3 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
We investigate the design of anonymous voting protocols, CV-based binary-valued ballot and CV-based multi-valued ballot with continuous variables (CV) in a multi-dimensional quantum cryptosystem to ensure the security of voting procedure and data privacy. The quantum entangled states are employed in the continuous variable quantum system to carry the voting information and assist information transmission, which takes the advantage of the GHZ-like states in terms of improving the utilization of quantum states by decreasing the number of required quantum states. It provides a potential approach to achieve the efficient quantum anonymous voting with high transmission security, especially in large-scale votes.
Classical electronic voting is increasingly being adopted for Internet-based elections, requiring system designs that ensure fairness, legitimacy, verifiability, and voter anonymity-thereby preserving ballot confidentiality, uniqueness, and integrity. Quantum voting can provide information-theoretic security against repudiation and forgery in such systems. However, compared to classical voting protocols, current quantum voting protocols often suffer from limited efficiency, high cost, and implementation complexity. Here, we introduce a streamlined and efficient quantum voting architecture that simplifies the process by eliminating the privacy amplification step in the voting phase while incorporating authority-assisted anonymity, while maintaining full voter authentication, voting, and tallying capabilities. In an experimental demonstration of a quantum voting network, two voters achieved authentication rates of 336 and 406 times per second over 50 km of single-mode fiber, and signed voting files of 25.02 kbit and 56.29 kbit at a quantum signing rate of 966 times per second, resulting in total voting rates of 244 and 279 times per second, respectively. This work represents the first experimental implementation of a continuous-variable (CV)-based quantum anonymous voting prototype. The architecture is designed to be compatible with existing coherent optical communication networks and provides a practical quantum-enhanced building block toward future voting systems.
A series of quantum voting protocols of continuous variables is proposed. Three methods are employed to ensure that the quantum voting obeys some desirable rules. Entanglement is used to keep voters away from the voting results. We enable voters to operate identically to represent the same vote to prevent the tallyman from gaining information about individual voters. We also propose an effective scheme to prevent voters from voting more than once. In both two-valued and multivalued ballot protocols, several specific constraints are set to meet the rules.
Ensuring security and integrity of elections constitutes an important challenge with wide-ranging societal implications. Classically, security guarantees can be ensured based on computational complexity, which may be challenged by quantum computers. We show that the use of quantum networks can enable information-theoretic security for the desirable aspects of a distributed voting scheme in a resource-efficient manner. In our approach, ballot information is encoded in quantum states that enable an exponential reduction in communication complexity compared to classical communication. In addition, we provide an efficient and secure anonymous queuing protocol based on a distributed secure sum. As a result, our scheme only requires modest quantum memories with size scaling logarithmically with the number of voters. This intrinsic efficiency together with certain noise-robustness of our protocol paves the way for its physical implementation in realistic quantum networks.
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.
Quantum information protocols offer significant advantages in properties such as security, anonymity, and privacy for communication and computing tasks. An application where guaranteeing the highest possible security and privacy is critical for democratic societies is electronic voting. As computational power continues to evolve, classical voting schemes may become increasingly vulnerable to information leakage. In this work, we present the experimental demonstration of an information-theoretically secure and efficient electronic voting protocol that, crucially, does not rely on election authorities, leveraging the unique properties of quantum states. Our experiment is based on a high-performance source of Greenberger-Horne-Zeilinger (GHZ) states and realizes a proof-of-principle implementation of the protocol in two scenarios: a configuration with four voters and two candidates employing privacy enhancement techniques and an election scenario supporting up to eight voters and sixteen candidates. The latter is particularly well-suited for secure board-level elections within organizations or small-scale governmental contexts.
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.