Extending robustness and randomization from consensus to symmetrization algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Control and Optimization Année : 2015

Extending robustness and randomization from consensus to symmetrization algorithms

Résumé

This work interprets and generalizes consensus-type algorithms as switching dynam-ics leading to symmetrization of some vector variables with respect to the actions of a finite group.We show how the symmetrization framework we develop covers applications as diverse as consensuson probability distributions (either classical or quantum), uniform random state generation, andopen-loop disturbance rejection by quantum dynamical decoupling. Robust convergence results areexplicitly provided in a group-theoretic formulation, both for deterministic and for randomized dy-namics. This indicates a way to directly extend the robustness and randomization properties ofconsensus-type algorithms to more fields of application.
Fichier principal
Vignette du fichier
mts_siam2015.pdf (251.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01093934 , version 1 (29-12-2015)

Licence

Domaine public

Identifiants

Citer

Luca Mazzarella, Francesco Ticozzi, Alain Sarlette. Extending robustness and randomization from consensus to symmetrization algorithms. SIAM Journal on Control and Optimization, 2015, 53 (4), pp.2076-2099. ⟨10.1137/130945090⟩. ⟨hal-01093934⟩
203 Consultations
109 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More