利用量子交替算子求解离散Rosenthal拥塞博弈的最优Nash均衡
Finding the optimal Nash equilibrium in a discrete Rosenthal congestion game using the Quantum Alternating Operator Ansatz
摘要:
本文建立了使用门模型量子计算机找到最优纳什均衡以及最优社会解的离散拥塞博弈的易处理性。这个游戏是罗森塔尔在20世纪70年代最初提出的类型。为了找到最优的纳什均衡,我们制定了一个优化问题编码的基础上潜在的功能和路径选择的限制,并解决它使用量子交替算子Answer。我们比较这个配方,它的前身,量子近似优化算法。我们实现了我们的解决方案上的门模型量子计算机的理想化模拟器,并证明了一个小的两人游戏的易处理性。这项工作为将来将量子近似优化应用于量子机器学习问题提供了基础,例如使用势函数有效训练生成对抗网络。
英文摘要:
This paper establishes the tractability of finding the optimal Nash equilibrium, as well as the optimal social solution, to a discrete congestion game using a gate-model quantum computer. The game is of the type originally posited by Rosenthal in the 1970's. To find the optimal Nash equilibrium, we formulate an optimization problem encoding based on potential functions and path selection constraints, and solve it using the Quantum Alternating Operator Ansatz. We compare this formulation to its predecessor, the Quantum Approximate Optimization Algorithm. We implement our solution on an idealized simulator of a gate-model quantum computer, and demonstrate tractability on a small two-player game. This work provides the basis for future endeavors to apply quantum approximate optimization to quantum machine learning problems, such as the efficient training of generative adversarial networks using potential functions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。