Saber Jafarizadeh

Learn More
Inspired by the recent developments in the fields of quantum distributed computing, quantum systems are analyzed as networks of quantum nodes to reduce the complexity of the analysis. This gives rise to the distributed quantum consensus algorithms. Focus of this paper is on optimizing the convergence rate of the continuous time quantum consensus algorithm(More)
Motivated by the recent advances in the field of quantum computing, quantum systems are modelled and analyzed as networks of decentralized quantum nodes which employ distributed quantum consensus algorithms for coordination. In the literature, both continuous and discrete time models have been proposed for analyzing these algorithms. This paper aims at(More)
1 effective resistance 2 Abstract Recently, in Refs. [1] and [2], calculation of effective resistances on distance-regular networks was investigated, where in the first paper, the calculation was based on strat-ification and Stieltjes function associated with the network, whereas in the latter one a recursive formula for effective resistances was given(More)
—Solving Fastest Distributed Consensus (FDC) averaging problem over sensor networks with different topologies has received some attention recently and one of the well known topologies in this issue is star-mesh hybrid topology. Here in this work we present analytical solution for the problem of FDC algorithm by means of stratification and semidefinite(More)
the second-largest eigenvalue modulus of the weight matrix) over networks with different topologies is one of the primary areas of research in the field of sensor networks and one of the well known networks in this issue is tree network. Here in this work we present analytical solution for the problem of fastest distributed consensus averaging algorithm by(More)