Quantum-Enhanced Secure Approval Voting Protocol

TL;DR

This paper proposes a quantum-enhanced voting protocol combining quantum mechanics, blockchain, and digital signatures to improve security and verifiability in approval voting, tested successfully on IBM quantum hardware.

Contribution

It introduces a novel quantum voting protocol leveraging entanglement and superposition, addressing security vulnerabilities of classical cryptography in elections.

Findings

Achieved low error rate of 1.17% on IBM quantum hardware

Supports approval voting with n candidates using $ ext{log}_2 n$ qubits

Ensures security features like anonymity and verifiability

Abstract

In a world where elections touch every aspect of society, the need for secure voting is paramount. Traditional safeguards, based on classical cryptography, rely on complex math problems like factoring large numbers. However, quantum computing is changing the game. Recent advances in quantum technology suggest that classical cryptographic methods may not be as secure as we thought. This paper introduces a quantum voting protocol, a blend of quantum principles (entanglement and superposition), blockchain technology, and digital signatures, all powered by $\log_2{n}$ qubits, and designed for approval voting with n candidates. The result is a symphony of security features - binding, anonymity, non-reusability, verifiability, eligibility, and fairness - that chart a new course for voting security. The real world beckons, as we tested this protocol on IBM quantum hardware, achieving impressively low error rates of just 1.17% in a four-candidate election.