Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1911.00803 · Annales Henri Poincaré

Quantum Optimal Transport with Quantum Channels

Giacomo De Palma, Dario Trevisan

Published Mar 19, 2021• 76 citations
arXivHTMLPDF
DOI
10.1007/s00023-021-01042-3

Related papers

Quantum Optimal Transport: Quantum Channels and Qubits

Giacomo De Palma, Dario Trevisan

arXiv:2307.16268•Bolyai Society mathematical studies•Jan 1, 2024•15 citations

Optimal quantum channels

Rocco Duvenhage

A method to optimize the cost of a quantum channel is developed. The goal is to determine the cheapest channel that produces prescribed output states for a given set of input states. This is essentially a quantum version of optimal transport. To attach a clear conceptual meaning to the cost, channels are viewed in terms of what we call elementary transitions, which are analogous to point-to-point transitions between classical systems. The role of entanglement in optimization of cost is emphasized. We also show how our approach can be applied to theoretically search for channels performing a prescribed set of tasks on the states of a system, while otherwise disturbing the state as little as possible.

arXiv:2010.09519•Physical Review A•Sep 7, 2021•19 citations

On Quantum Optimal Transport

Sam Cole, Michał Eckstein, Shmuel Friedland +1 more

arXiv:2105.06922•Mathematical Physics Analysis and Geometry•Jun 1, 2023•44 citations

Strong Kantorovich duality for quantum optimal transport with generic cost and optimal couplings on quantum bits

Gergely Bunth, József Pitrik, Tamás Titkos +1 more

We prove Kantorovich duality for a linearized version of a recently proposed non-quadratic quantum optimal transport problem, where quantum channels realize the transport. As an application, we determine optimal solutions of both the primal and the dual problem using this duality in the case of quantum bits and distinguished cost operators, with certain restrictions on the states involved. Finally, keeping the same restrictions regarding the states involved, we use this information on optimal solutions to give an analytical proof of the triangle inequality even for the square of the induced quantum Wasserstein divergences.

arXiv:2510.26326•Linear Algebra and its Applications•Apr 1, 2026•6 citations

Foundation of quantum optimal transport and applications

Kazuki Ikeda

arXiv:1906.09817•Quantum Information Processing•Nov 29, 2019•39 citations

Routing subcarrier wave quantum key distribution through a metropolitan optical transport network

Angelina Tarabrina, Irina Vorontsova, Sergey Kynev +2 more

Subject of study. This study investigates a method of finding a sequence of nodes in a metropolitan optical transport network to connect a sender and receiver through a quantum channel propagating in the same optical fiber as the information channels to maximize the secret key generation rate. Aim of the work. The purpose of this work is to route the subcarrier wave quantum key distribution in a metropolitan optical transport network to maximize the secret key generation rate. Method. A metropolitan optical transport network is represented as a graph, where the vertices are the network nodes and the edges are the fiber optic lines connecting them. The weight of an edge corresponds to the secret key generation rate on the respective segment of the fiber optic line. The final key generation rate is limited by the slowest section of the path. The desired optimal route can be found by solving the graph bottleneck problem. A brute force algorithm is used. Main results. The optimal paths connecting two given nodes via a quantum channel for different network topologies are found. The results demonstrate the need for a more efficient algorithm when considering a larger number of nodes. Practical significance. The findings of this study could be used in the integration of quantum communications in existing metropolitan optical transport networks.

Journal of Optical Technology•Jun 1, 2023•1 citation
A method to optimize the cost of a quantum channel is developed. The goal is to determine the cheapest channel that produces prescribed output states for a given set of input states. This is essentially a quantum version of optimal transport. To attach a clear conceptual meaning to the cost, channels are viewed in terms of what we call elementary transitions, which are analogous to point-to-point transitions between classical systems. The role of entanglement in optimization of cost is emphasized. We also show how our approach can be applied to theoretically search for channels performing a prescribed set of tasks on the states of a system, while otherwise disturbing the state as little as possible.
We prove Kantorovich duality for a linearized version of a recently proposed non-quadratic quantum optimal transport problem, where quantum channels realize the transport. As an application, we determine optimal solutions of both the primal and the dual problem using this duality in the case of quantum bits and distinguished cost operators, with certain restrictions on the states involved. Finally, keeping the same restrictions regarding the states involved, we use this information on optimal solutions to give an analytical proof of the triangle inequality even for the square of the induced quantum Wasserstein divergences.
Subject of study. This study investigates a method of finding a sequence of nodes in a metropolitan optical transport network to connect a sender and receiver through a quantum channel propagating in the same optical fiber as the information channels to maximize the secret key generation rate. Aim of the work. The purpose of this work is to route the subcarrier wave quantum key distribution in a metropolitan optical transport network to maximize the secret key generation rate. Method. A metropolitan optical transport network is represented as a graph, where the vertices are the network nodes and the edges are the fiber optic lines connecting them. The weight of an edge corresponds to the secret key generation rate on the respective segment of the fiber optic line. The final key generation rate is limited by the slowest section of the path. The desired optimal route can be found by solving the graph bottleneck problem. A brute force algorithm is used. Main results. The optimal paths connecting two given nodes via a quantum channel for different network topologies are found. The results demonstrate the need for a more efficient algorithm when considering a larger number of nodes. Practical significance. The findings of this study could be used in the integration of quantum communications in existing metropolitan optical transport networks.