Are Quantum Voting Protocols Practical?

• URL: http://arxiv.org/abs/2601.17514v1
• Date: Sat, 24 Jan 2026 16:25:35 GMT
• Title: Are Quantum Voting Protocols Practical?
• Authors: Nitin Jha, Abhishek Parakh,
• Abstract summary: Quantum voting protocols aim to offer ballot secrecy and publicly verifiable tallies using physical guarantees from quantum mechanics.<n>This article surveys whether such quantum voting protocols are practical.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum voting protocols aim to offer ballot secrecy and publicly verifiable tallies using physical guarantees from quantum mechanics, rather than relying solely on computational hardness. This article surveys whether such quantum voting protocols are practical. We begin by outlining core mathematical ideas such as the superposition principle, the no-cloning theorem, and quantum entanglement. We then define a common system and threat model, identifying key actors, trust assumptions, and security goals. Representative protocol families are reviewed, including entanglement-based schemes with central tallying, self-tallying designs that enable public verification, and authority-minimized approaches that certify untrusted devices through observable correlations. Finally, we evaluate implementation challenges, including loss, noise, device imperfections, scalability, and coercion resistance, and discuss realistic near-term deployment scenarios for small-scale elections.

Related papers

• Verifier-initiated quantum message-authentication via quantum zero-knowledge proofs [38.81686642226027]
  We introduce a new method where the verifier can request authentication only when needed, improving efficiency for quantum networks and blockchain applications.<n>Our approach adapts the concept of zero-knowledge widely used in classical cryptography to quantum settings, ensuring that verification reveals nothing about secret keys.<n>This work delivers the first general verifier-initiated quantum signature scheme with formal security, paving the way for scalable, secure authentication in future quantum infrastructures and decentralized systems.
  arXiv  Detail & Related papers  (2025-12-05T04:40:34Z)
• 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)
• Public-Key Quantum Authentication and Digital Signature Schemes Based on the QMA-Complete Problem [0.0]
  We propose a quantum authentication and digital signature protocol whose security is founded on the Quantum Merlin Arthur(QMA)-completeness of the consistency of local density matrices.<n>We provide a rigorous security analysis, proving the scheme's unforgeability against adaptive chosen-message attacks by quantum adversaries.
  arXiv  Detail & Related papers  (2025-06-20T10:56:50Z)
• Adiabatic echo protocols for robust quantum many-body state preparation [35.31045922824676]
  We introduce the adiabatic echo protocol, a general approach to state preparation designed to suppress the effect of static perturbations.<n>We show that such a protocol emerges naturally in a variety of settings, without requiring assumptions on the form of the control fields.<n>Our results highlight the broad applicability of this protocol, providing a practical framework for reliable many-body state preparation in present-day quantum platforms.
  arXiv  Detail & Related papers  (2025-06-13T18:01:08Z)
• Device-Independent Quantum Key Distribution: Protocols, Quantum Games, and Security [0.0]
  Quantum Key Distribution (QKD) is based on the laws of quantum mechanics to enable provably secure communication.<n>Despite its theoretical security promise, practical QKD systems are vulnerable to serious attacks, including side-channel attacks and detector loopholes.<n> Device-Independent Quantum Key Distribution (DIQKD) overcomes these limitations by relying solely on observed nonlocal correlations.
  arXiv  Detail & Related papers  (2025-05-20T11:52:21Z)
• Faithful and secure distributed quantum sensing under general-coherent attacks [0.0]
  We introduce, theoretically analyze, and experimentally demonstrate single- and two-way protocols for distributed sensing.<n>We introduce a safety-threshold mechanism that allows the protocol to proceed in low-noise cases and quantifying the potential tampering with respect to the ideal estimation procedure.<n>We demonstrate our protocols in a photonic-based implementation, observing that the possibility of guaranteeing a safety threshold may come at a significant price in terms of the estimation bias.
  arXiv  Detail & Related papers  (2025-05-05T12:48:41Z)
• Device-independent secure correlations in sequential quantum scenarios [44.99833362998488]
  Device-independent quantum information is attracting significant attention, particularly for its applications in information security.<n>We propose a systematic approach to designing sequential quantum protocols for device-independent security.<n>We analytically prove that, with this systematic construction, the resulting ideal correlations are secure in the sense that they cannot be reproduced as a statistical mixture of other correlations.
  arXiv  Detail & Related papers  (2025-03-18T16:45:20Z)
• 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)
• Correcting for finite statistics effects in a quantum steering experiment [33.013102271622614]
  We introduce a one-sided device-independent protocol that corrects for apparent signaling effects in experimental probability distributions.<n>Our results show a significantly higher probability of violation than existing state-of-the-art inequalities.<n>This work demonstrates the power of semidefinite programming for entanglement verification and brings quantum networks closer to practical applications.
  arXiv  Detail & Related papers  (2023-05-23T14:39:08Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Reliable Quantum Communications based on Asymmetry in Distillation and Coding [35.693513369212646]
  We address the problem of reliable provision of entangled qubits in quantum computing schemes. We combine indirect transmission based on teleportation and distillation; (2) direct transmission, based on quantum error correction (QEC) Our results show that ad-hoc asymmetric codes give, compared to conventional QEC, a performance boost and codeword size reduction both in a single link and in a quantum network scenario.
  arXiv  Detail & Related papers  (2023-05-01T17:13:23Z)
• 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)
• Experimental quantum key distribution certified by Bell's theorem [0.0]
  cryptographic key exchange protocols traditionally rely on computational conjectures to provide security against eavesdropping attacks. quantum key distribution protocols provide information-theoretic security against such attacks. However, quantum protocols are subject to a new class of attacks exploiting implementation defects in the physical devices involved. We present here the experimental realisation of a complete quantum key distribution protocol immune to these vulnerabilities.
  arXiv  Detail & Related papers  (2021-09-29T17:52: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.