量子最优输运的基础及其应用
Foundation of Quantum Optimal Transport and Applications
AI总结:
本文将经典 Monge-Kantorovich 最优输运问题扩展到量子领域,提出量子最优输运框架,并应用于量子游走、量子自动机、量子博弈及囚徒困境重复博弈,展示了该理论的通用性与实用价值。
摘要:
量子最优输运旨在寻找一个算子,使得在输运过程中需满足某些约束的条件下,将一个量子态输运到另一个量子态的总成本最小化。我们通过扩展经典最优输运理论中的 Monge-Kantorovich 问题来表述这一问题,并给出若干应用。作为示例,我们从最优输运的视角处理量子游走、量子自动机和量子博弈。此外,我们明确展示了囚徒困境的民间定理,该定理声称相互合作可以成为重复博弈的一个均衡。一系列示例将展示抽象量子最优输运理论的一般性和实用性优势。
英文摘要:
Quantum optimal transportation seeks an operator which minimizes the total cost of transporting a quantum state to another state, under some constraints that should be satisfied during transportation. We formulate this issue by extending the Monge-Kantorovich problem, which is a classical optimal transportation theory, and present some applications. As examples, we address quantum walk, quantum automata and quantum games from a viewpoint of optimal transportation. Moreover we explicitly show the folk theorem of the prisoners' dilemma, which claims mutual cooperation can be an equilibrium of the repeated game. A series of examples would show generic and practical advantages of the abstract quantum optimal transportation theory.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。