Advanced search
1 file | 320.36 KB

A new perspective on gossip iterations: from symmetrization to quantum consensus

Author
Organization
Project
Interuniversity Attraction Poles Programme DYSCO
Abstract
This paper extends the gossip algorithm, widely studied in the literature on distributed computing and control algorithms, to networks of quantum systems. In doing so, we reinterpret the classical algorithm and the average consensus task as a symmetrization problem with respect to the action of the permutation group. This allows us to extend in a natural way the gossip consensus algorithm to the quantum setting and prove its convergence properties to symmetric states while preserving the expectation of permutation-invariant global observables.
Keywords
ALGORITHMS, SYSTEMS

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 320.36 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Mazzarella, Luca, Alain Sarlette, and Francesco Ticozzi. 2013. “A New Perspective on Gossip Iterations: From Symmetrization to Quantum Consensus.” In IEEE Conference on Decision and Control, 250–255. IEEE.
APA
Mazzarella, L., Sarlette, A., & Ticozzi, F. (2013). A new perspective on gossip iterations: from symmetrization to quantum consensus. IEEE Conference on Decision and Control (pp. 250–255). Presented at the 52nd IEEE Annual Conference on Decision and Control (CDC), IEEE.
Vancouver
1.
Mazzarella L, Sarlette A, Ticozzi F. A new perspective on gossip iterations: from symmetrization to quantum consensus. IEEE Conference on Decision and Control. IEEE; 2013. p. 250–5.
MLA
Mazzarella, Luca, Alain Sarlette, and Francesco Ticozzi. “A New Perspective on Gossip Iterations: From Symmetrization to Quantum Consensus.” IEEE Conference on Decision and Control. IEEE, 2013. 250–255. Print.
@inproceedings{4293121,
  abstract     = {This paper extends the gossip algorithm, widely studied in the literature on distributed computing and control algorithms, to networks of quantum systems. In doing so, we reinterpret the classical algorithm and the average consensus task as a symmetrization problem with respect to the action of the permutation group. This allows us to extend in a natural way the gossip consensus algorithm to the quantum setting and prove its convergence properties to symmetric states while preserving the expectation of permutation-invariant global observables.},
  author       = {Mazzarella, Luca and Sarlette, Alain and Ticozzi, Francesco},
  booktitle    = {IEEE Conference on Decision and Control},
  isbn         = {9781467357166},
  issn         = {0191-2216},
  keywords     = {ALGORITHMS,SYSTEMS},
  language     = {eng},
  location     = {Firenze, Italy},
  pages        = {250--255},
  publisher    = {IEEE},
  title        = {A new perspective on gossip iterations: from symmetrization to quantum consensus},
  year         = {2013},
}

Web of Science
Times cited: