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

• URL: http://arxiv.org/abs/2510.15243v1
• Date: Fri, 17 Oct 2025 02:14:54 GMT
• Title: Quantum Voting Protocol for Centralized and Distributed Voting Based on Phase-Flip Counting
• Authors: Ali Emre Aydin, Ammar Daskin,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: In this paper, we introduce a novel quantum voting protocol that leverages quantum superposition and entanglement to achieve secure, anonymous voting in both centralized and distributed settings. Our approach utilizes phase-flip encoding on entangled candidate states, where votes are recorded as controlled phase operations conditioned on voter identity registers. The protocol employs a simplified tallying mechanism based on candidate register measurements. We provide comprehensive mathematical formulations for a centralized single-machine model suitable for local voting systems, and a distributed quantum channel model enabling remote voting with enhanced security through entanglement verification. The efficiency of the protocol stems from its use of basic quantum gates (Hadamard and controlled-Z) and its ability to count votes through quantum measurements rather than iterative classical counting. We demonstrate the practicality of the protocol through examples with 4 voters (2 candidates) and 8 voters (3 candidates), showing exact probability preservation and correct vote tallying. The protocol ensures voter anonymity through quantum superposition, prevents double-voting through entanglement mechanisms, and can offer speedup potential for large-scale elections.

Related papers

• Characterization-free classification and identification of the environment between two quantum players [33.172938212519774]
  Classifying the causal structure of quantum channels is essential for verifying quantum networks and certifying quantum resources.<n>We introduce a characterization-free protocol enabling two isolated players, Alice and Bob, to classify and identify the definite-order strategy adopted by an unknown environment mediating their channels.<n>We experimentally demonstrate the protocol on an optical platform, reliably distinguishing between several strategies.
  arXiv  Detail & Related papers  (2026-02-24T15:16:01Z)
• Experimental Quantum Electronic Voting [0.27998963147546146]
  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.
  arXiv  Detail & Related papers  (2025-12-03T16:21:32Z)
• 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)
• 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)
• Single-Round Deterministic Quantum Anonymous Veto Using Bell States [0.0]
  Quantum Anonymous Veto (QAV) protocols enable secure and anonymous decision-making.<n>Existing QAV schemes offer strong theoretical guarantees, but face limitations in practical implementation.<n>We propose a novel deterministic QAV protocol that achieves conclusive veto detection in a single round.
  arXiv  Detail & Related papers  (2025-09-19T13:01:43Z)
• Inference Attacks on Encrypted Online Voting via Traffic Analysis [19.653420340564946]
  We examine how adversaries can exploit metadata from encrypted network traffic to uncover sensitive information during online voting.<n>Our analysis reveals that, even without accessing the content, it is possible to infer critical voter actions, such as whether a person votes, the exact moment a ballot is submitted, and whether the ballot is valid or spoiled.<n>We evaluate our attacks on two widely used online voting platforms, one proprietary and one partially open source, achieving classification accuracy as high as 99.5%.
  arXiv  Detail & Related papers  (2025-09-19T07:14:01Z)
• High-rate discrete-modulated continuous-variable quantum key distribution with composable security [17.348175817014234]
  We report a discrete-modulated continuous-variable quantum key distribution system with a composable secret key rate of 18.93 Mbps against collective attacks over a 25 km fiber channel.<n>This record breaking rate is achieved through the probability shaped 16QAM-modulated protocol, which employs semidefinite programming to ensure its composable security.
  arXiv  Detail & Related papers  (2025-03-19T03:59:19Z)
• High-rate discrete-modulated continuous-variable quantum key distribution with composable security [17.348175817014234]
  We report a continuous-variable quantum key distribution system with a composable secret key rate of 18.93 Mbps against collective attacks over a 25 km fiber channel.<n>This record-breaking rate is achieved through the probability shaped 16QAM-modulated protocol, which employs semidefinite programming to ensure its composable security.
  arXiv  Detail & Related papers  (2025-03-14T14:21:08Z)
• Orthogonal-state-based Measurement Device Independent Quantum Communication [32.244698777387995]
  We propose a new protocol of measurement-device-independent quantum secure direct communication and quantum dialogue employing single basis, i.e., Bell basis as decoy qubits for eavesdropping detection. Our protocols leverage fundamentally distinct resources to close the security loopholes linked to measurement devices, while also effectively doubling the distance for secure direct message transmission.
  arXiv  Detail & Related papers  (2024-09-30T15:57:17Z)
• Quantum voting machine encoded with microwave photons [14.028819697729048]
  We propose a simple quantum voting machine using microwave photon qubit encoding. The voting outcome is solely tied to the total number of affirmative votes. Quantum voting machine can be implemented as long as the multi-control single-phase quantum phase gate is realized in other physical systems.
  arXiv  Detail & Related papers  (2024-06-27T13:40:17Z)
• Efficient Device-Independent Quantum Key Distribution [4.817429789586127]
  Device-independent quantum key distribution (DIQKD) is a key distribution scheme whose security is based on the laws of quantum physics. We propose an efficient device-independent quantum key distribution protocol in which one participant prepares states and transmits them to another participant.
  arXiv  Detail & Related papers  (2023-11-16T13:01:34Z)
• 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)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• 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)
• Counterfactual Concealed Telecomputation [22.577469136318836]
  We devise a distributed blind quantum computation protocol to perform a universal two-qubit controlled unitary operation. It is shown that the protocol is valid for general input states and that single-qubit unitary teleportation is a special case of CCT. The protocol becomes deterministic with simplified circuit implementation if the initial composite state of Alice and Bob is a Bell-type state.
  arXiv  Detail & Related papers  (2020-12-09T10:07:58Z)

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.