Distributed Quantum Vote Based on Quantum Logical Operators, a New Battlefield of the Second Quantum Revolution
This work addresses the need for more democratic and expressive voting mechanisms in quantum computing, though it appears incremental as it builds on existing quantum computational logic concepts.
The authors tackled the problem of designing fair and scalable voting systems by introducing two binary quantum computed vote rules, Quantum Logical Veto (QLV) and Quantum Logical Nomination (QLN), which are based on quantum logical operators and offer better scalability without increasing implementation difficulty as voter numbers grow.
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.