Optimizing the convergence rate of the quantum consensus: a discrete-time model

DOI10.1016/J.AUTOMATICA.2016.07.029MaRDI QIDQ2409308zbMATH OpenOpenAlexFDO

Authors Saber Jafarizadeh

Publication date 11 October 2017

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.05178

zbMATH Keywords

Aldous' conjecturedistributed consensusoptimal convergence ratequantum networks

Mathematics Subject Classification ID

Quantum control (81Q93) Semidefinite programming (90C22) Decentralized systems (93A14) Discrete-time control/observation systems (93C55)

Abstract: 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 optimizing the convergence rate of the discrete time quantum consensus algorithm over a quantum network with $N$ qudits. The induced graphs are categorized in terms of the partitions of integer $N$ by arranging them as the Schreier graphs. It is shown that the original optimization problem reduces to optimizing the Second Largest Eigenvalue Modulus (SLEM) of the weight matrix. Exploiting the Specht module representation of partitions of $N$, the Aldous' conjecture is generalized to all partitions (except ($N$)) in the Hasse diagram of integer $N$. Based on this result, it is shown that the spectral gap of Laplacian of all induced graphs corresponding to partitions (other than ($N$)) of $N$ are the same, while the spectral radius of the Laplacian is obtained from the feasible least dominant partition in the Hasse diagram of integer $N$. The semidefinite programming formulation of the problem is addressed analytically for $Nleq{d}^2+1$ and a wide range of topologies where closed-form expressions for the optimal results are provided. For a quantum network with complete graph topology, solution of the optimization problem based on group association schemes is provided for all values of $N$.

Recommendations

• Gossip algorithm with nonuniform clock distribution: optimization over classical and quantum networks
• Orbit consensus of quantum networks based on interaction design
• Symmetrizing quantum dynamics beyond gossip-type algorithms
• A dynamic programming approach for distributing quantum circuits by bipartite graphs
• Quantized consensus in Hamiltonian graphs

Cites work

• Consensus optimization on manifolds
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Discrete-time distributed consensus on multiplex networks
• Distributed asynchronous deterministic and stochastic gradient optimization algorithms
• Distributed consensus in multi-vehicle cooperative control. Theory and applications.
• Fast linear iterations for distributed averaging
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2003
• Proof of Aldous' spectral gap conjecture
• States, effects, and operations. Fundamental notions of quantum theory. Lectures in mathematical physics at the University of Texas at Austin. Ed. by A. Böhm, J. D. Dollard and W. H. Wootters
• The representation theory of the symmetric groups
• Unital quantum channels - convex structure and revivals of Birkhoff's theorem

Cited in

(9)

• Orbit consensus of quantum networks based on interaction design
• Distributed estimation in periodically switching sensor networks
• A fully distributed weight design approach to consensus Kalman filtering for sensor networks
• Leader-following-based distributed Kalman filtering in sensor networks with communication delay
• Symmetrizing quantum dynamics beyond gossip-type algorithms
• STUDY OF CONTINUOUS-TIME QUANTUM WALKS ON QUOTIENT GRAPHS VIA QUANTUM PROBABILITY THEORY
• Scalable Quantum Consensus for Crash Failures
• Gossip algorithm with nonuniform clock distribution: optimization over classical and quantum networks
• Weight allocation in Laplacian matrix of random networks based on geodesic distances

This page was built for publication: Optimizing the convergence rate of the quantum consensus: a discrete-time model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409308)