Entangled N-photon states for fair and optimal social decision making
arXiv:2007.09146
Abstract
Situations involving competition for resources among entities can be modeled by the competitive multi-armed bandit (CMAB) problem, which relates to social issues such as maximizing the total outcome and achieving the fairest resource repartition among individuals. In these respects, the intrinsic randomness and global properties of quantum states provide ideal tools for obtaining optimal solutions to this problem. Based on the previous study of the CMAB problem in the two-arm, two-player case, this paper presents the theoretical principles necessary to find polarization-entangled N-photon states that can optimize the total resource output while ensuring equality among players. These principles were applied to two-, three-, four-, and five-player cases by using numerical simulations to reproduce realistic configurations and find the best strategies to overcome potential misalignment between the polarization measurement systems of the players. Although a general formula for the N-player case is not presented here, general derivation rules and a verification algorithm are proposed. This report demonstrates the potential usability of quantum states in collective decision making with limited, probabilistic resources, which could serve as a first step toward quantum-based resource allocation systems.
arXiv comment22 pages and 7 figures, version 1.1 of July 27th 2020
References in corpus (14)
- The Security of Practical Quantum Key Distribution
- A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- Universal Linear Optics
- Quantum Games and Quantum Strategies
- Experimental ten-photon entanglement
- Experimental Verification of Multipartite Entanglement in Quantum Networks
- Quantum machine learning over infinite dimensions
- Single-photon decision maker
- Multiple-Access Quantum Key Distribution Networks
- Experimental implementation of a four-player quantum game
- Experimentally Feasible Security Check for n-qubit Quantum Secret Sharing
- Modular network for high-rate quantum conferencing
- Quantum voting and violation of Arrow's Impossibility Theorem