Quantum Voting Protocols

• Quantum Voting Protocols are advanced cryptographic schemes that use quantum principles like entanglement, superposition, and the no-cloning theorem to guarantee ballot privacy, integrity, and verifiability.
• They employ various methodologies including centralized traveling ballots, distributed GHZ-based voting, and self-tallying schemes that integrate quantum and classical verification to mitigate cheating and eavesdropping.
• Experimental implementations on photonic and superconducting platforms demonstrate promising fidelity and error rates, though challenges in scalability, noise robustness, and resource efficiency remain.

Quantum voting protocols utilize fundamental quantum information principles—including entanglement, superposition, and the no-cloning theorem—to realize voting schemes with strong privacy, integrity, and verifiability guarantees that can surpass those attainable in classical cryptography. Quantum voting has evolved into a rich field, encompassing protocols for both binary and multi-candidate elections, self-tallying and centrally tallied schemes, and contributions addressing both theoretical security models and practical photonic or superconducting hardware realizations.

1. Quantum Cryptographic Primitives and Basic Structures

Quantum voting protocols are built on the ability to encode, transmit, and measure quantum states in ways that physically enforce security objectives:

• Entanglement: Multiparty entangled states (e.g., GHZ states, cluster states, Bell pairs) serve as the backbone of both binary and multi-candidate voting protocols, enabling quantum correlations that are inaccessible classically.
• Superposition and phase encoding: Ballots are often cast by encoding local phase rotations or amplitude weights, which become meaningful only when measured in concert with the global entangled state.
• No-cloning and monogamy: The no-cloning theorem ensures that ballot states cannot be copied undetectably, and monogamy of entanglement is used to detect eavesdropping or ballot manipulation, especially in distributed settings.
• Anonymous transmission and masking: Protocols achieve anonymity through randomization (e.g., basis randomization, anonymous permutation of ballot shares) and quantum masking (using superpositions or entangled masking bits).

Key families of states and operations include maximally entangled states used in traveling and distributed ballots (Bonanome et al., 2011), n-party GHZ states as in many recent self-tallying and authority-free protocols (Marcellino et al., 3 Dec 2025, Laurent-Puig et al., 3 Dec 2025), and phase-encoded or amplitude-encoded quantum ballots (for approval voting or multi-candidate elections) (Sakhuja et al., 2024, Aydin et al., 17 Oct 2025). Protocols also often leverage classical authenticated bulletin boards, quantum blockchain, and auxiliary randomization/free permutations to augment quantum resources (Sun et al., 2018, Wang et al., 2016).

2. Protocol Methodologies: Centralized, Distributed, and Self-Tallying Designs

Quantum voting protocols can be organized by the structure of control and tallying:

Centralized Authority-Based Protocols

• Traveling Ballot: A maximally entangled two-qudit state is prepared by the authority; one half (“ballot qudit”) is passed sequentially among voters, each applying a unitary corresponding to “yes” or “no,” and finally returned for measurement. The authority learns only the final tally, not individual votes. Vulnerable to certain man-in-the-middle attacks unless augmented with teleportation or decoy states (Bonanome et al., 2011).
• Distributed Ballot: The authority prepares an N-qudit GHZ-like state, distributing one qudit to each voter. Each applies a local phase gate according to their vote, and all qudits are returned for a global measurement that reveals only the total “yes” count. Enhanced variants include teleportation-based security against multi-vote cheating and pairwise projective checks for eavesdropping resilience (Bonanome et al., 2011).

Self-Tallying and Authority-Free Protocols

• GHZ-Based Parity-XOR Schemes: Voters share a multipartite entangled state, with each encoding their bit (often in an anonymously assigned order), and broadcast masked bits such that only the global XOR (parity) can be computed, not individual votes (Marcellino et al., 3 Dec 2025, Centrone et al., 2021).
• Approval and Multi-Candidate Quantum Voting: Amplitude or phase-encoded quantum ballots allow for multi-candidate approval voting using n = ⌈log₂N⌉ qubits, with vote superpositions entangled with “signature” qubits to prevent forgery and enable public verification on quantum blockchains (Sakhuja et al., 2024).
• Self-Tallying via Entangled Ballot States: Voters receive and measure shares from entangled “ballot-box” and antisymmetric “index” states, combine these with their vote, broadcast the masked result, and jointly compute the tally with verifiability and non-reusability, but without any central tallyman (Wang et al., 2016).

Anonymous Veto and Special-Purpose Protocols

• Quantum Anonymous Veto (QAV) Schemes: Optimized schemes using iterative phase-kickback with Bell pairs, or deterministic single-round multipartite dense coding, facilitate cryptographically strong, scalable anonymous veto functionality—motivated by scenarios such as the UN Security Council (Kumar et al., 2021, Mishra et al., 2021).
• Dining Cryptographers Networks: Single-photon flying particle approaches generalize the DC-net to quantum settings, allowing anonymous broadcast and commitment with unconditional privacy and collision-resistance (Hameedi et al., 2017).

3. Security Guarantees and Adversarial Models

The formal security goals of quantum voting extend and refine classical desiderata:

• Ballot Privacy/Anonymity: No party, including authorities or coalitions of voters, can link a ballot to a specific voter beyond what is leaked by the tally. Achieved (ideally) through maximal local mixedness of reduced density matrices and randomized basis selection (Bonanome et al., 2011, Khabiboulline et al., 2021, Jha et al., 24 Jan 2026).
• Integrity (Eligibility, Non-reusability, One-Vote-Per-Voter): Enforced by resource distribution (unique ballot indices, classical authentication, quantum key distribution), quantum masking, and verifiability of opening and commitments (Zhou et al., 2013, Mahmoud et al., 3 Oct 2025).
• Verifiability and Universal Verifiability: Protocols employ publicly readable classical bulletin boards or blockchains, random test rounds for entanglement or phase correlations, and compatibility checks allowing any observer to confirm inclusion and correctness of all ballots (Laurent-Puig et al., 3 Dec 2025, Marcellino et al., 3 Dec 2025, Centrone et al., 2021).
• Resistance to Cheating/Eavesdropping: Security arguments rely on the no-cloning theorem and monogamy of entanglement to prevent undetected interception, with protocols featuring decoy states, test rounds, and explicit detection of manipulation via cut-and-choose methods or stabilizer correlations (Aydin et al., 17 Oct 2025, Laurent-Puig et al., 3 Dec 2025, Sun et al., 2018).
• Scalability and Noise Robustness: Protocols are evaluated for resilience to typical quantum noise channels (phase damping, amplitude damping, depolarizing, bit-flip), resource requirements (number of qubits, rounds), and circuit depth—affecting their practical deployment in current NISQ-era devices (Kumar et al., 2021, Marcellino et al., 3 Dec 2025, Laurent-Puig et al., 3 Dec 2025).

4. Experimental Realizations and Performance Metrics

Significant experimental progress demonstrates feasibility for small-to-medium voter sets:

• Photonic GHZ-State Voting: Four-voter, two-candidate quantum voting was experimentally realized with telecom-wavelength photons and measured GHZ fidelities ≈89%, and vote encoding success ≈87% (Marcellino et al., 3 Dec 2025, Laurent-Puig et al., 3 Dec 2025). Experimental designs implement cut-and-choose state verification, neural-network-based tomography, and fiber optical synchronization.
• Superconducting Qubit Experiments: Quantum anonymous-veto and voting protocols using Bell, GHZ, and cluster states have been implemented on IBM devices (e.g., ibmq_manila, ibmq_casablanca) with Bell-based schemes reaching fidelities >95% under realistic noise, while cluster/GHZ schemes are more sensitive to noise and circuit-depth scaling (Kumar et al., 2021, Kumar, 13 Jul 2025).
• Quantum-Enhanced Approval Voting: Demonstrations on IBM hardware showed less than 1.2% error in a four-candidate protocol with entangled and signed amplitude-encoded ballots, validating the approach’s low error rate and compatibility with blockchain-style classical integration (Sakhuja et al., 2024).
• Performance Metrics: Measured quantities include fidelity via tomography, per-run error probabilities, throughput (Hz or per-minute voting rate), and resilience curves for various decoherence models (Marcellino et al., 3 Dec 2025, Kumar et al., 2021, Kumar, 13 Jul 2025).

5. Security Models, Formalism, and Attacks

Analyses have revealed both successes and deficiencies in prior proposals:

• Formal Security Definitions: Recent work systematically formulates quantum-verifiability, quantum-privacy, and quantum-integrity security games, adopting models with locally held quantum registers, classical public bulletin boards, and adaptive adversarial control (Arapinis et al., 2018).
• Attack Classes: Notably, some protocols fail under “cut-and-choose” attacks, colluding voter attacks, d-transfer (tally-shifting) attacks, and ballot manipulation attacks. Unconditional security is only achieved in protocols provably indistinguishable from an ideal functionality even in the presence of quantum polynomial-time adversaries (Arapinis et al., 2018, Bonanome et al., 2011).
• Recommendations: Robust quantum voting protocols combine quantum authentication codes, information-theoretic anonymous channels, non-malleable ballot encodings, and rigorous composable security frameworks, often supplemented with classical cryptographic accountability and public verifiability (Arapinis et al., 2018, Jha et al., 24 Jan 2026).

6. Scalability and Practical Deployment Considerations

Current limitations and prospective deployments are shaped by technological and architectural constraints:

• Resource Efficiency: Leading protocols scale qubit and gate resources logarithmically in the number of candidates or voters (e.g., n = ⌈log₂N⌉ for N candidates in approval voting, O(N) qubits for N voters in GHZ-based voting) (Sakhuja et al., 2024, Aydin et al., 17 Oct 2025).
• Noise and Loss: Quantum channels are challenged by photon loss, detector dark counts, polarization and phase drift in optical platforms, and decoherence and two-qubit gate errors in superconducting platforms. Protocols interleave verification and test rounds, with abort thresholds set by measured QBER or stabilizer correlations, to bound the effect of noise (Kumar et al., 2021, Marcellino et al., 3 Dec 2025).
• Scalability Limits: While small-scale (n ≲ 10–20) implementations are within reach—e.g., board-level elections, committee votes—scaling to national-scale elections is constrained by entanglement distribution limits, the need for quantum repeaters, and the cost/complexity of high-fidelity entanglement sources and quantum memories (Jha et al., 24 Jan 2026, Laurent-Puig et al., 3 Dec 2025).
• Integration: Hybrid designs (quantum ballots + classical blockchain, or QKD-backed authentication + classical receipts) can bridge the gap, integrating quantum privacy guarantees with the auditability and operational flexibility of established cryptographic infrastructure (Mahmoud et al., 3 Oct 2025, Sun et al., 2018, Sakhuja et al., 2024).
• Pilot Proposals: Well-controlled pilot elections (committee-scale, campus-wide) employing fiber-based quantum channels and authenticated bulletin boards are an immediate near-term goal, with cost estimates on the order of $100k–$200k for a 10-voter deployment (Jha et al., 24 Jan 2026).

7. Advances, Open Challenges, and Outlook

Quantum voting protocols have evolved from early GHZ- and traveling ballot motifs into sophisticated, multi-round, authority-free or blockchain-backed paradigms with information-theoretic guarantees:

• Functional Expansion: Protocols have broadened to support group product computation, anonymous broadcast, approval voting with logarithmic scaling, and advanced collusion resistance (Bonanome et al., 2011, Sakhuja et al., 2024, Wang et al., 2016).
• Efficiency and Robustness: Dense coding-based, iterative phase-kickback, and probabilistic key-distribution-based veto schemes enable trade-offs between resource efficiency, noise robustness, and simplicity (Mishra et al., 2021, Kumar et al., 2021).
• Security Formalization: Modern quantum voting research emphasizes composable, game-based security, avoidance of malleability and cut-and-choose vulnerabilities, and hybridization with classical verifiability tools (Arapinis et al., 2018, Laurent-Puig et al., 3 Dec 2025, Sun et al., 2018).
• Remaining Open Problems: Scaling beyond 20–100 voters, handling coercion-resistance, devising fair, fault-tolerant multi-candidate and multi-winner protocols, and practical photonic or matter-based implementation at metropolitan or national scales remain active areas of research (Jha et al., 24 Jan 2026, Laurent-Puig et al., 3 Dec 2025, Marcellino et al., 3 Dec 2025).

Quantum voting continues to define rigorous interfaces between quantum information theory, cryptographic security, and real-world socio-technical requirements, with ongoing experimental progress and advancing cryptographic sophistication marking its development as a distinctive domain in both quantum computation and secure communication.