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...Show MoreMetadata
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.
Published in: 52nd IEEE Conference on Decision and Control
Date of Conference: 10-13 December 2013
Date Added to IEEE Xplore: 10 March 2014
ISBN Information:
Print ISSN: 0191-2216