Quantum Vote Based on Quantum Logical Operators

Soroush Rafiee Rad, Elahe Shirinkalam, Sonja Smets

Xin Sun, Feifei He, Daowen Qiu +3 more

We designed two rules of binary quantum computed vote: Quantum Logical Veto (QLV) and Quantum Logical Nomination (QLN). The conjunction and disjunction from quantum computational logic are used to define QLV and QLN, respectively. Compared to classical vote, quantum computed vote is fairer, more democratic and has stronger expressive power. Since the advantage of quantum computed vote is neither the speed of computing nor the security of communication, we believe it opens a new battlefield in the second quantum revolution. Compared to other rules of quantum computed vote, QLV and QLN have better scalability. Both QLV and QLN can be implemented by the current technology and the difficulty of implementation does not grow with the increase of the number of voters.

Yong-Ping Xu, De-Zhi Gao, Xiang-Qian Liang +1 more

Kashvi Rita, Prisha Desai, Kashvi Mahetaliya +1 more

The expansion of quantum computing puts classical cryptographic systems at risk, and thus there is a need for quantum-resistant solutions to secure messaging and e-voting. This paper introduces a two-in-one application developed with Flask (backend), Firebase (database), and IBM Quantum (live QKD operations), secured by the BB84 Quantum Key Distribution (QKD) protocol. The messaging module uses BB84 to produce unbreakable encryption keys by way of photon polarization, and the evoting system encrypts votes using quantum keys, providing end-to-end security. Firebase stores user information and anonymous votes securely, and Flask oversees serverside logic, including real-time quantum key generation through IBM Quantum’s cloud-based quantum processors. The incorporation of IBM Quantum’s Qiskit framework allows for real-time simulation and running of BB84, with error rates below 3% in quantum channel tests. Tamper-evident logs and decentralized verification are used in place of centralized databases for e-voting, which reduces fraud vulnerabilities. Real-world implementation shows that the system can scale, as Firebase supports 1,000+ concurrent users and IBM Quantum provides sub-second latency for key generation. This paper tackles weaknesses of traditional systems by combining quantum cryptography with contemporary full-stack technologies, offering a solid, deployable solution for electoral integrity and secure communication.

Xu-Feng Niu, Jian-Zhong Zhang, Shu-Cui Xie +1 more

Daowen Qiu