论文标题
在IBMQ模拟器上解决Diner的困境游戏，电路实施和验证
Solving diner's dilemma game, circuit implementation, and verification on IBMQ simulator
论文作者
论文摘要
食客困境是经济和游戏理论中最有趣的问题之一。在这里，我们为N（玩家的数量）= 4解决了使用量子规则的问题，我们能够消除游戏中帕累托最佳和NASH平衡点之间食客的困境。我们发现量子策略可以为每个餐馆提供最大的收益，而不会影响他人的回报和策略。我们使用叠加和纠缠的量子原理，这些原则使任何经典策略具有至高无上的态度。我们介绍了游戏的电路实现，请在IBM量子模拟器上进行设计并验证量子模型中的策略。
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.
