Distributed Quantum Vote Based on Quantum Logical Operators, a New Battlefield of the Second Quantum Revolution
Xin Sun, Feifei He, Daowen Qiu, Piotr Kulicki, Mirek Sopek, and Meiyun Guo

TL;DR
This paper introduces two quantum voting rules, QLV and QLN, based on quantum logic, which are more democratic, scalable, and feasible with current technology, opening new avenues in the second quantum revolution.
Contribution
The paper proposes two novel quantum voting rules, QLV and QLN, utilizing quantum logical operators, with improved scalability and implementability over existing quantum voting methods.
Findings
Quantum voting rules QLV and QLN are more scalable.
Both rules can be implemented with current technology.
Quantum voting offers enhanced fairness and expressiveness.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
