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:2512.03659 · Physical Review Letters

Experimental quantum voting using photonic GHZ states

Francis Marcellino, Mingsong Wu, Rob Thew

quant-phSubmitted Dec 3, 2025• Announced Dec 4, 2025• 2 citations• Revised Dec 19, 2025 (v2)
v1 · Dec 3, 2025v2 · Dec 19, 2025
arXivHTMLPDF

Abstract

Quantum communication protocols seek to leverage the unique properties of quantum systems for coordination or communication tasks, usually with guarantees of security or anonymity that exceed what is possible classically. One promising domain of application is elections, where strong such guarantees are essential to ensure legitimacy. We experimentally implement a recently proposed election protocol from Centrone et al. such that no one, including a potential central authority, can know the preferred candidate of any voter other than themself. We conduct a four-party election, generating and distributing four-partite GHZ states with $\approx 89\%$ fidelity and successfully recording voters' intentions $\approx 87\%$ of the time.

Comments
6 pages; added appendix with security proof

Related papers

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•Conference on Lasers and Electro-Optics•Dec 4, 2025•3 citations

Experimental quantum voting using photonic GHZ states

Francis Marcellino, Towsif Taher, Mingsong Wu +2 more

We implement a recent proposal for a quantum voting scheme (Centrone 2022, Phys. Rev. Appl. 18, 014005), based on photonic GHZ states, that guarantees anonymity for voters and does not require a trusted election authority.

Quantum 2.0 Conference and Exhibition•Jan 1, 2025•0 citations

Multipartite Quantum Cryptography

Nicolas Laurent-Puig, Laura dos Santos Martins, Matilde Baroni +6 more

Quantum networks provide a powerful platform for implementing protocols that outperform their classical counterparts in both functionality and security. To realize their full potential, however, it is essential to ensure they are secure, efficient, and experimentally viable. Using high-fidelity polarization-encoded 4-qubit GHZ states generated in a compact double-layer Sagnac interferometer, we experimentally implement a privacy-preserving distributed phase estimation protocol, enabling the reconstruction of a global function without revealing the local information of individual network users. Furthermore, we also implement an information-theoretically secure voting protocol that requires no election authorities and extend its functionality to combine privacy and support for multiple candidates and voter pools. Our results showcase versatile quantum protocols that can address key challenges in secure computation, quantum voting, and quantum networks, all within a practical experimental framework.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Apr 6, 2026•0 citations

Quantum Protocol for Electronic Voting without Election Authorities

Federico Centrone, Eleni Diamanti, Iordanis Kerenidis

Electronic voting is a very useful but challenging internet-based protocol that despite many theoretical approaches and various implementations with different degrees of success, remains a contentious topic due to issues in reliability and security. Here we present a quantum protocol that exploits an untrusted source of multipartite entanglement to carry out an election without relying on election authorities, simultaneous broadcasting, or computational assumptions, and whose result is publicly verifiable. The level of security depends directly on the fidelity of the shared multipartite entangled quantum state, and the protocol can be readily implemented for a few voters with state-of-the-art photonic technology.

arXiv:2107.14719•Physical Review Applied•Jul 5, 2022•23 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•5 citations

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 communication protocols seek to leverage the unique properties of quantum systems for coordination or communication tasks, usually with guarantees of security or anonymity that exceed what is possible classically. One promising domain of application is elections, where strong such guarantees are essential to ensure legitimacy. We experimentally implement a recently proposed election protocol from Centrone et al. such that no one, including a potential central authority, can know the preferred candidate of any voter other than themself. We conduct a four-party election, generating and distributing four-partite GHZ states with ≈89%\approx 89\%≈89% fidelity and successfully recording voters' intentions ≈87%\approx 87\%≈87% of the time.
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.
Quantum networks provide a powerful platform for implementing protocols that outperform their classical counterparts in both functionality and security. To realize their full potential, however, it is essential to ensure they are secure, efficient, and experimentally viable. Using high-fidelity polarization-encoded 4-qubit GHZ states generated in a compact double-layer Sagnac interferometer, we experimentally implement a privacy-preserving distributed phase estimation protocol, enabling the reconstruction of a global function without revealing the local information of individual network users. Furthermore, we also implement an information-theoretically secure voting protocol that requires no election authorities and extend its functionality to combine privacy and support for multiple candidates and voter pools. Our results showcase versatile quantum protocols that can address key challenges in secure computation, quantum voting, and quantum networks, all within a practical experimental framework.
Electronic voting is a very useful but challenging internet-based protocol that despite many theoretical approaches and various implementations with different degrees of success, remains a contentious topic due to issues in reliability and security. Here we present a quantum protocol that exploits an untrusted source of multipartite entanglement to carry out an election without relying on election authorities, simultaneous broadcasting, or computational assumptions, and whose result is publicly verifiable. The level of security depends directly on the fidelity of the shared multipartite entangled quantum state, and the protocol can be readily implemented for a few voters with state-of-the-art photonic technology.
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.
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.