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.

翻译：量子投票协议旨在利用量子力学的物理保证（而非仅依赖计算复杂性）来提供选票保密性与公开可验证的计票结果。本文探讨此类量子投票协议是否具备实用性。我们首先概述核心数学概念，如叠加原理、不可克隆定理与量子纠缠。随后定义通用系统与威胁模型，明确关键参与方、信任假设及安全目标。文中回顾了代表性协议族，包括基于纠缠的中心化计票方案、可实现公开验证的自计票设计，以及通过可观测关联性认证非可信设备的极简化权威方案。最后，我们评估了实施挑战，包括损耗、噪声、设备缺陷、可扩展性与抗胁迫性，并讨论了适用于小规模选举的现实近期部署场景。