Solving diner's dilemma game, circuit implementation, and verification on IBMQ simulator
arXiv:2010.12841 · doi:10.1007/s11128-020-02687-5
Abstract
Diners dilemma is one of the most interesting problems in both economic and game theories. Here, we solve this problem for n (number of players) =4 with quantum rules and we are able to remove the dilemma of diners between the Pareto optimal and Nash equilibrium points of the game. We find the quantum strategy that gives maximum payoff for each diner without affecting the payoff and strategy of others. We use the quantum principles of superposition and entanglement that gives supremacy over any classical strategies. We present the circuit implementation for the game, design it on the IBM quantum simulator and verify the strategies in the quantum model.
References in corpus (31)
- Quantum Games and Quantum Strategies
- Quantum strategies
- A Quantum Approach To Static Games Of Complete Information
- Implementing a distance-based classifier with a quantum interference circuit
- Experimental test of Mermin inequalities on a 5-qubit quantum computer
- Bell nonlocality and Bayesian game theory
- Quantum games: a review of the history, current state, and interpretation
- Observation of topological Uhlmann phases with superconducting qubits
- Quantum mechanics gives stability to a Nash equilibrium
- Entanglement Enhanced Multiplayer Quantum Games
- Quantum Artificial Life in an IBM Quantum Computer
- Experimental realization of quantum cheque using a five-qubit quantum computer
- Demonstration of Entanglement Purification and Swapping Protocol to Design Quantum Repeater in IBM Quantum Computer
- Quantum Cooperative Games
- Leggett-Garg test of superconducting qubit addressing the clumsiness loophole
- Design and experimental realization of an optimal scheme for teleportion of an -qubit quantum state
- Experimental Demonstration of Non-local Controlled-Unitary Quantum Gates Using a Five-qubit Quantum Computer
- Algorithmic simulation of far-from-equilibrium dynamics using quantum computer
- Demonstration of entanglement assisted invariance on IBM's Quantum Experience
- Five Experimental Tests on the 5-Qubit IBM Quantum Computer
- Nonlocal correlations: Fair and Unfair Strategies in Bayesian Game
- Protecting quantum memories using coherent parity check codes
- Automated Error Correction in IBM Quantum Computer and Explicit Generalization
- Generalization and Demonstration of an Entanglement Based Deutsch-Jozsa Like Algorithm Using a 5-Qubit Quantum Computer
- Optimization and experimental realization of the quantum permutation algorithm
- Nondestructive discrimination of a new family of highly entangled states in IBM quantum computer
- Experimental demonstration of the violations of Mermin's and Svetlichny's inequalities for W- and GHZ-class of states
- Demonstration of the No-Hiding Theorem on the 5 Qubit IBM Quantum Computer in a Category Theoretic Framework
- Quantum Robots Can Fly; Play Games: An IBM Quantum Experience
- Mini-maximizing two qubit quantum computations
- Nash embedding and equilibrium in pure quantum states