Consensus in non-commutative spaces

Abstract

Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. Tsitsiklis Lyapunov function is shown to be the Hilbert distance to consensus in log coordinates. Birkhoff theorem, which proves contraction of the Hilbert metric for any positive homogeneous monotone map, provides an early yet general convergence result for consensus algorithms. Because Birkhoff theorem holds in arbitrary cones, we extend consensus algorithms to the cone of positive definite matrices. The proposed generalization finds applications in the convergence analysis of quantum stochastic maps, which are a generalization of stochastic maps to non-commutative probability spaces.

Submitted

References in corpus (1)

• Tight estimates for convergence of some non-stationary consensus algorithms

Cited by in corpus (8)

• Learning-based Quantum Robust Control: Algorithm, Applications and Experiments
• Reaching a Quantum Consensus: Master Equations that Generate Symmetrization and Synchronization
• Consensus for Quantum Networks: From Symmetry to Gossip Iterations
• Positive contraction mappings for classical and quantum Schrodinger systems
• Exponential convergence of a dissipative quantum system towards finite-energy grid states of an oscillator
• Monotonicity on homogeneous spaces
• Hypergraph conditions for the solvability of the ergodic equation for zero-sum games
• Macroscopic limit of a Fokker-Planck model of swarming rigid bodies