Diner’s dilemma is a problem of interest to both economics and game theory. Here, we solve this problem for n = 4 (where n is the number of players) with quantum rules. 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. Quantum superposition and entanglement is used as a resource which gave the 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.

中文翻译：

---

在IBM Quantum Simulator上解决Diner的困境游戏，电路实现和验证

迪纳的困境是经济学和博弈论都关心的问题。在这里，我们用量子规则解决了n = 4（其中n是玩家数）的问题。我们能够消除食客在帕累托最优和纳什均衡点之间的困境。我们发现了一种量子策略，该策略可在不影响其他人的收益和策略的情况下为每个晚餐提供最大的收益。量子叠加和纠缠被用作一种资源，它可以超越任何经典策略。我们介绍游戏的电路实现，在IBM量子模拟器上进行设计，并验证量子模型中的策略。