activity
20122015
most citedFinite-time and Asymptotic Convergence of Distributed Averaging and Maximizing Algorithms

17 citations · 35 across the 6 of their papers we have counts for

collaborators

6 papers

quant-ph2015

Forgetting in the Synchronization of Quantum Networks

Shuangshuang Fu, Guodong Shi, Ian R. Petersen

In this paper, we study the decoherence property of synchronization master equation for networks of qubits interconnected by swapping operators. The network Hamiltonian is assumed…

cs.SI2014

Emergent Behaviors over Signed Random Dynamical Networks: Relative-State-Flipping Model

Guodong Shi, Alexandre Proutiere, Mikael Johansson +2

We study asymptotic dynamical patterns that emerge among a set of nodes interacting in a dynamically evolving signed random network, where positive links carry out standard consens…

quant-ph201410 cited

Feedback Policies for Measurement-based Quantum State Manipulation

Shuangshuang Fu, Guodong Shi, Alexandre Proutiere +1

In this paper, we propose feedback designs for manipulating a quantum state to a target state by performing sequential measurements. In light of Belavkin's quantum feedback control…

quant-ph20144 cited

Reaching Quantum Consensus with Directed Links: Missing Symmetry and Switching Interactions

Guodong Shi, Shuangshuang Fu, Ian R. Petersen

In this paper, we study consensus seeking of quantum networks under directed interactions defined by a set of permutation operators among a network of qubits. The state evolution o…

cs.DC201217 cited

Finite-time and Asymptotic Convergence of Distributed Averaging and Maximizing Algorithms

Guodong Shi, Karl Henrik Johansson

In this paper, we formulate and investigate a generalized consensus algorithm which makes an attempt to unify distributed averaging and maximizing algorithms considered in the lite…

cs.IT20124 cited

Randomized Gossip Algorithm with Unreliable Communication

Guodong Shi, Mikael Johansson, Karl Henrik Johansson

In this paper, we study an asynchronous randomized gossip algorithm under unreliable communication. At each instance, two nodes are selected to meet with a given probability. When…