Quantum and Semi-Quantum Lottery: Strategies and Advantages
Sandeep Mishra, Anirban Pathak

TL;DR
This paper introduces quantum and semi-quantum lottery schemes that leverage quantum mechanics to achieve unconditionally secure and fair lotteries, potentially transforming commercial lottery practices with current technology.
Contribution
The paper proposes novel quantum and semi-quantum lottery strategies that ensure unconditional fairness and security, analyzing their advantages and practical feasibility.
Findings
Quantum resources enable unconditionally secure lotteries.
Semi-quantum schemes allow classical users to participate securely.
Proposed schemes are feasible with current technology.
Abstract
Lottery is a game in which multiple players take chances in the hope of getting some rewards in cash or kind. In addition, from the time of the early civilizations, lottery has also been considered as an apposite method to allocate scarce resources. Technically, any scheme for lottery needs to be fair and secure, but none of the classical schemes for lottery are unconditionally secure and fair. As fairness demands complete unpredictability of the outcome of the lottery, it essentially requires perfect randomness. Quantum mechanics not only guarantees the generation of perfect randomness, it can also provide unconditional security. Motivated by these facts, a set of strategies for performing lottery using different type of quantum resources (e.g., single photon states, and entangled states) are proposed here, and it's established that the proposed strategies leads to unconditionally…
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 · Quantum Information and Cryptography · Quantum Mechanics and Applications
