Advanced search
1 file | 454.63 KB

Consensus for quantum networks: from symmetry to gossip iterations

Author
Organization
Abstract
This paper extends the consensus framework, widely studied in the literature on distributed computing and control algorithms, to networks of quantum systems. We define consensus situations on the basis of invariance and symmetry properties, finding four different generalizations of classical consensus states. This new viewpoint can be directly used to study consensus for probability distributions, as these can be seen as a particular case of quantum statistical states: in this light, our analysis is also relevant for classical problems. We then extend the gossip consensus algorithm to the quantum setting and prove it converges to symmetric states while preserving the expectation of permutation-invariant global observables. Applications of the framework and the algorithms to estimation and control problems on quantum networks are discussed.
Keywords
ALGORITHMS, MULTIAGENT SYSTEMS, DYNAMICS, STATES, Consensus, distributed algorithms, Markov processes, quantum information and control

Downloads

  • mst tac2015.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 454.63 KB

Citation

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

Chicago
Mazzarella, Luca, Alain Sarlette, and Francesco Ticozzi. 2015. “Consensus for Quantum Networks: From Symmetry to Gossip Iterations.” Ieee Transactions on Automatic Control 60 (1): 158–172.
APA
Mazzarella, L., Sarlette, A., & Ticozzi, F. (2015). Consensus for quantum networks: from symmetry to gossip iterations. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 60(1), 158–172.
Vancouver
1.
Mazzarella L, Sarlette A, Ticozzi F. Consensus for quantum networks: from symmetry to gossip iterations. IEEE TRANSACTIONS ON AUTOMATIC CONTROL. IEEE; 2015;60(1):158–72.
MLA
Mazzarella, Luca, Alain Sarlette, and Francesco Ticozzi. “Consensus for Quantum Networks: From Symmetry to Gossip Iterations.” IEEE TRANSACTIONS ON AUTOMATIC CONTROL 60.1 (2015): 158–172. Print.
@article{6857888,
  abstract     = {This paper extends the consensus framework, widely studied in the literature on distributed computing and control algorithms, to networks of quantum systems. We define consensus situations on the basis of invariance and symmetry properties, finding four different generalizations of classical consensus states. This new viewpoint can be directly used to study consensus for probability distributions, as these can be seen as a particular case of quantum statistical states: in this light, our analysis is also relevant for classical problems. We then extend the gossip consensus algorithm to the quantum setting and prove it converges to symmetric states while preserving the expectation of permutation-invariant global observables. Applications of the framework and the algorithms to estimation and control problems on quantum networks are discussed.},
  author       = {Mazzarella, Luca and Sarlette, Alain and Ticozzi, Francesco},
  issn         = {0018-9286},
  journal      = {IEEE TRANSACTIONS ON AUTOMATIC CONTROL},
  keywords     = {ALGORITHMS,MULTIAGENT SYSTEMS,DYNAMICS,STATES,Consensus,distributed algorithms,Markov processes,quantum information and control},
  language     = {eng},
  number       = {1},
  pages        = {158--172},
  publisher    = {IEEE},
  title        = {Consensus for quantum networks: from symmetry to gossip iterations},
  url          = {http://dx.doi.org/10.1109/TAC.2014.2336351},
  volume       = {60},
  year         = {2015},
}

Altmetric
View in Altmetric
Web of Science
Times cited: