Efficient Quantum Voting with Information-Theoretic Security

arXiv:2112.14242 · quant-ph, cs.CC, cs.CR · Submitted 2021-12-28 · Read on arXiv

quant-ph, cs.CC, cs.CR

Submitted: 2021-12-28

Updated: 2026-09-17

Comments: 12 + 24 pages, 4 + 1 figures. Updated anonymous protocols

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Fidelity — 18× in this paper · explained in 2 episodes
• Entanglement — 11× in this paper · explained in 3 episodes
• Accountability — 9× in this paper · explained in 2 episodes
• Verifiability — 5× in this paper · explained in 2 episodes
• Robustness — 3× in this paper · explained in 5 episodes
• Decode — 2× in this paper · explained in 2 episodes
• Hamming Distance — 2× in this paper · explained in 2 episodes
• Verification — 2× in this paper · explained in 2 episodes
• Adaptive Strategy — 1× in this paper · explained in 1 episode
• Generalization — 1× in this paper · explained in 13 episodes
• Trace — 1× in this paper · explained in 2 episodes
• Verifier — 1× in this paper · explained in 2 episodes

Sources

• Quantum protocol for electronic voting without election authorities

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity