Zhang Jinliang, Chen Tian, Deng Wenyuan, Tong Xiaoxue, Zhang Xiangdong
Key Laboratory of Advanced Optoelectronic Quantum Architecture and Measurements of Ministry of Education, Beijing Key Laboratory of Nanophotonics & Ultrafine Optoelectronic Systems, School of Physics, Beijing Institute of Technology, 100081 Beijing, China.
Research (Wash D C). 2024 Sep 30;7:0480. doi: 10.34133/research.0480. eCollection 2024.
Game theory problems are widely applied in many research areas such as computer science and finance, with the key issue being how to quickly make decisions. Here, we present a novel quantum algorithm for game theory problems based on a continuous quantum walk. Our algorithm exhibits quantum advantage compared to classical game algorithms. Furthermore, we exploit the analogy between the wave function of the Schrödinger equation and the voltage in Kirchhoff's law to effectively translate the design of quantum game trees into classical circuit networks. We have theoretically simulated the quantum game trees and experimentally validated the quantum functionality speedup on classical circuit networks. Due to the robust scalability and stability inherent in classical circuit networks, quantum game trees implemented within this framework hold promise for addressing more intricate application scenarios.
博弈论问题在计算机科学和金融等许多研究领域中得到了广泛应用，关键问题在于如何快速做出决策。在此，我们提出了一种基于连续量子行走的用于博弈论问题的新型量子算法。与经典博弈算法相比，我们的算法展现出量子优势。此外，我们利用薛定谔方程的波函数与基尔霍夫定律中的电压之间的类比，有效地将量子博弈树的设计转化为经典电路网络。我们在理论上模拟了量子博弈树，并在经典电路网络上通过实验验证了量子功能加速。由于经典电路网络固有的强大可扩展性和稳定性，在此框架内实现的量子博弈树有望解决更复杂的应用场景。
