Experimental Quantum Electronic Voting
- URL: http://arxiv.org/abs/2512.03924v1
- Date: Wed, 03 Dec 2025 16:21:32 GMT
- Title: Experimental Quantum Electronic Voting
- Authors: Nicolas Laurent-Puig, Matilde Baroni, Federico Centrone, Eleni Diamanti,
- Abstract summary: We present an information-theoretically secure and efficient electronic voting protocol that does not rely on election authorities.<n>Our experiment is based on a high-performance source of Greenberger-Horne-Zeilinger (GHZ) states.<n>The protocol is well-suited for secure board-level elections within organizations or small-scale governmental contexts.
- Score: 0.27998963147546146
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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.
Related papers
- Experimental quantum voting using photonic GHZ states [0.0]
Quantum communication protocols seek to leverage the unique properties of quantum systems for coordination or communication tasks.<n>We experimentally implement a recently proposed election protocol, where no one, including a potential central authority, can know the preferred candidate of any voter other than themself.<n>We conduct a four-party election, generating and distributing four-partite GHZ states with $approx 89%$ fidelity and successfully recording voters' intentions.
arXiv Detail & Related papers (2025-12-03T10:47:21Z) - Quantum Voting Protocol for Centralized and Distributed Voting Based on Phase-Flip Counting [0.0]
We introduce a novel quantum voting protocol that leverages quantum superposition and entanglement to achieve secure, anonymous voting.<n>Our approach utilizes phase-flip encoding on entangled candidate states, where votes are recorded as controlled phase operations conditioned on voter identity registers.<n>The protocol ensures voter anonymity through quantum superposition, prevents double-voting through entanglement mechanisms, and can offer speedup potential for large-scale elections.
arXiv Detail & Related papers (2025-10-17T02:14:54Z) - A Quantum-Secure Voting Framework Using QKD, Dual-Key Symmetric Encryption, and Verifiable Receipts [0.4511923587827302]
We introduce a quantum-secure voting framework that integrates Quantum Key Distribution (QKD), Dual-Key Symmetric Encryption, and verifiable receipt mechanisms.<n>The framework enables voters to establish encryption keys securely, cast encrypted ballots, and verify their votes through receipt-based confirmation.<n>Results demonstrate that the system can process large numbers of votes efficiently with low latency and minimal error rates.
arXiv Detail & Related papers (2025-10-03T20:13:30Z) - Efficient Lower Bounding of Single Transferable Vote Election Margins [56.12949230611067]
Single transferable vote (STV) is a system of preferential proportional voting employed in multi-seat elections.<n>The margin of victory, or simply'margin', is the smallest number of ballots that need to be manipulated to alter the set of winners.<n>Lower bounds on the margin can also be used for this purpose, in cases where exact margins are difficult to compute.
arXiv Detail & Related papers (2025-01-24T13:39:23Z) - ElectionSim: Massive Population Election Simulation Powered by Large Language Model Driven Agents [70.17229548653852]
We introduce ElectionSim, an innovative election simulation framework based on large language models.
We present a million-level voter pool sampled from social media platforms to support accurate individual simulation.
We also introduce PPE, a poll-based presidential election benchmark to assess the performance of our framework under the U.S. presidential election scenario.
arXiv Detail & Related papers (2024-10-28T05:25:50Z) - Adaptively Weighted Audits of Instant-Runoff Voting Elections: AWAIRE [61.872917066847855]
Methods for auditing instant-runoff voting (IRV) elections are either not risk-limiting or require cast vote records (CVRs), the voting system's electronic record of the votes on each ballot.
We develop an RLA method that uses adaptively weighted averages of test supermartingales to efficiently audit IRV elections when CVRs are not available.
arXiv Detail & Related papers (2023-07-20T15:55:34Z) - Private Multi-Winner Voting for Machine Learning [48.0093793427039]
We propose three new DP multi-winner mechanisms: Binary, $tau$, and Powerset voting.
Binary voting operates independently per label through composition.
$tau$ voting bounds votes optimally in their $ell$ norm for tight data-independent guarantees.
Powerset voting operates over the entire binary vector by viewing the possible outcomes as a power set.
arXiv Detail & Related papers (2022-11-23T20:06:46Z) - Secure Order Based Voting Using Distributed Tallying [5.407319151576265]
One of the main challenges in e-voting systems is to certify that the computed results are consistent with the cast ballots.<n>We propose a secure voting protocol for elections governed by order-based voting rules.<n>Our protocol, in which the tallying task is distributed among several independent talliers, offers perfect ballot secrecy.
arXiv Detail & Related papers (2022-05-21T12:17:21Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Quantum protocol for electronic voting without election authorities [3.4806267677524896]
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 Detail & Related papers (2021-07-30T15:43:48Z) - Experimental multi-state quantum discrimination through a Quantum
network [63.1241529629348]
We have experimentally implemented two discrimination schemes in a minimum-error scenario based on a receiver featured by a network structure and a dynamical processing of information.
The first protocol achieves binary optimal discrimination, while the second one provides a novel approach to multi-state quantum discrimination, relying on the dynamical features of the network-like receiver.
arXiv Detail & Related papers (2021-07-21T09:26:48Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.