Related Experiment Video
Updated: Nov 12, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Relaxed Schrödinger bridges and robust network routing
Yongxin Chen1, Tryphon T Georgiou2, Michele Pavon3
1School of Aerospace Engineering, Georgia Institute of Technology, Atlanta, GA 30332.
Abstract:
We seek network routing towards a desired final distribution that can mediate possible random link failures. In other words, we seek a routing plan that utilizes alternative routes so as to be relatively robust to link failures. To this end, we provide a mathematical formulation of a relaxed transport problem where the final distribution only needs to be close to the desired one. The problem is cast as a maximum entropy problem for probability distributions on paths with an added terminal cost. The entropic regularizing penalty aims at distributing the choice of paths amongst possible alternatives. We prove that the unique solution may be obtained by solving a generalized Schrödinger system of equations. An iterative algorithm to compute the solution is provided. Each iteration of the algorithm contracts the distance (in the Hilbert metric) to the optimal solution by more than 1/2, leading to extremely fast convergence.
More Related Videos
Related Concept Videos
IP3/DAG Signaling Pathway
Network Function of a Circuit
¹H NMR: Long-Range Coupling
In alkenes, spin information is communicated via σ–π overlap, as seen in allylic (four-bond) and homoallylic (five-bond) couplings. These coupling interactions are stronger when the σ bond is parallel to the alkene...
Diels–Alder Reaction Forming Bridged Bicyclic Products: Stereochemistry
Short-distance Transport of Resources
Fast Decoupled and DC Powerflow

