Foundation of Quantum Optimal Transport and Applications

Abstract

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.

16 pages, 1 figure

References in corpus (1)

• Application of Quantum Annealing to Nurse Scheduling Problem

Cited by in corpus (17)

• The Quantum Wasserstein Distance of Order 1
• Learning quantum data with the quantum Earth Mover's distance
• Theory of Quantum Games and Quantum Economic Behavior
• Quantum Monge-Kantorovich problem and transport distance between density matrices
• Infinitely Repeated Quantum Games and Strategic Efficiency
• Long-range quantum energy teleportation and distribution on a hyperbolic quantum network
• Quantum Optimal Transport
• Monotonicity of the quantum 2-Wasserstein distance
• Optimal quantum channels
• Quantum Protocol for Decision Making and Verifying Truthfulness among $N$-quantum Parties: Solution and Extension of the Quantum Coin Flipping Game
• Improving the speed of variational quantum algorithms for quantum error correction
• Quantum Extensive Form Games
• Quantum Volunteer's Dilemma
• The Wasserstein distance of order 1 for quantum spin systems on infinite lattices
• Wasserstein distance between noncommutative dynamical systems
• Classical shadows meet quantum optimal mass transport
• Two-player quantum games: When player strategies are via directional choices