Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1712.01704 · Scientific Reports

Quantum Clique Gossiping

Bo Li, Shuang Li, Junfeng Wu, Hongsheng Qi

Published Feb 5, 2018• 5 citations
arXivHTMLPDF

Abstract

This paper establishes a framework of quantum clique gossiping by introducing local clique operations to networks of interconnected qubits. Cliques are local structures in complex networks being complete subgraphs, which can be used to accelerate classical gossip algorithms. Based on cyclic permutations, clique gossiping leads to collective multi-party qubit interactions. We show that at reduced states, these cliques have the same acceleration effects as their roles in accelerating classical gossip algorithms. For randomized selection of cliques, such improved rate of convergence is precisely characterized. On the other hand, the rate of convergence at the coherent states of the overall quantum network is proven to be decided by the spectrum of a mean-square error evolution matrix. Remarkably, the use of larger quantum cliques does not necessarily increase the speed of the network density aggregation, suggesting quantum network dynamics is not entirely decided by its classical topology.

DOI
10.1038/s41598-018-21069-7

Related papers

Consensus for Quantum Networks: Symmetry From Gossip Interactions

Luca Mazzarella, Alain Sarlette, Francesco Ticozzi

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.

arXiv:1303.4077•IEEE Transactions on Automatic Control•Sep 25, 2014•54 citations

Consensus for Quantum Networks: Symmetry From Gossip Interactions

Luca Mazzarella, Alain Sarlette, Francesco Ticozzi

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 consen-sus 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. Index Terms—Consensus, distributed algorithms, Markov pro-cesses, quantum information and control. I.

•Dec 3, 2015•58 citations

A new perspective on gossip iterations: From Symmetrization to quantum consensus

Luca Mazzarella, Alain Sarlette, Francesco Ticozzi

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.

IEEE Conference on Decision and Control (CDC)•Dec 1, 2013•6 citations

The Evolution of Network Entropy in Classical and Quantum Consensus Dynamics

Shuangshuang Fu, Guodong Shi, Ian R. Petersen +1 more

In this paper, we investigate the evolution of the network entropy for consensus dynamics in classical or quantum networks. We show that in the classical case, the network entropy decreases at the consensus limit if the node initial values are i.i.d. Bernoulli random variables, and the network differential entropy is monotonically non-increasing if the node initial values are i.i.d. Gaussian. While for quantum consensus dynamics, the network's von Neumann entropy is in contrast non-decreasing. In light of this inconsistency, we compare several gossiping algorithms with random or deterministic coefficients for classical or quantum networks, and show that quantum gossiping algorithms with deterministic coefficients are physically related to classical gossiping algorithms with random coefficients.

arXiv:1503.07621•Mar 26, 2015•0 citations

Finding cliques by quantum adiabatic evolution

Andrew M. Childs, Edward Farhi, Jeffrey Goldstone +1 more

Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the problem of finding the largest clique in a random graph. An n-vertex random graph has each edge included with probability 1/2, and a clique is a completely connected subgraph. There is no known classical algorithm that finds the largest clique in a random graph with high probability and runs in a time polynomial in n. For the small graphs we are able to investigate ($n \le 18$), the quantum algorithm appears to require only a quadratic run time.

Quantum Information and Computation•Apr 1, 2002•81 citations

Blended Dynamics and Emergence in Open Quantum Networks

Qinghao Wen, Zihao Ren, Lei Wang +2 more

In this paper, we develop a blended dynamics framework for open quantum networks with diffusive couplings. The network consists of qubits interconnected through Hamiltonian couplings, environmental dissipation, and consensus-like diffusive interactions. Such networks commonly arise in spontaneous emission processes and non-Hermitian quantum computing, and their evolution follows a Lindblad master equation. Blended dynamics theory is well established in the classical setting as a tool for analyzing emergent behaviors in heterogeneous networks with diffusive couplings. Its key insight is to blend the local dynamics rather than the trajectories of individual nodes. Perturbation analysis then shows that, under sufficiently strong coupling, all node trajectories tend to stay close to those of the blended system over time. We first show that this theory extends naturally to the reduced-state dynamics of quantum networks, revealing classical-like clustering phenomena in which qubits converge to a shared equilibrium or a common trajectory determined by the quantum blended reduced-state dynamics. We then extend the analysis to qubit coherent states using quantum Laplacians and induced graphs, proving orbit attraction of the network density operator toward the quantum blended coherent dynamics, establishing the emergence of intrinsically quantum and dynamically clustering behaviors. Finally, numerical examples validate the theoretical results.

quant-pharXiv:2601.14763•Jan 22, 2026•0 citations
This paper establishes a framework of quantum clique gossiping by introducing local clique operations to networks of interconnected qubits. Cliques are local structures in complex networks being complete subgraphs, which can be used to accelerate classical gossip algorithms. Based on cyclic permutations, clique gossiping leads to collective multi-party qubit interactions. We show that at reduced states, these cliques have the same acceleration effects as their roles in accelerating classical gossip algorithms. For randomized selection of cliques, such improved rate of convergence is precisely characterized. On the other hand, the rate of convergence at the coherent states of the overall quantum network is proven to be decided by the spectrum of a mean-square error evolution matrix. Remarkably, the use of larger quantum cliques does not necessarily increase the speed of the network density aggregation, suggesting quantum network dynamics is not entirely decided by its classical topology.
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.
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 consen-sus 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. Index Terms—Consensus, distributed algorithms, Markov pro-cesses, quantum information and control. I.
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.
In this paper, we investigate the evolution of the network entropy for consensus dynamics in classical or quantum networks. We show that in the classical case, the network entropy decreases at the consensus limit if the node initial values are i.i.d. Bernoulli random variables, and the network differential entropy is monotonically non-increasing if the node initial values are i.i.d. Gaussian. While for quantum consensus dynamics, the network's von Neumann entropy is in contrast non-decreasing. In light of this inconsistency, we compare several gossiping algorithms with random or deterministic coefficients for classical or quantum networks, and show that quantum gossiping algorithms with deterministic coefficients are physically related to classical gossiping algorithms with random coefficients.
Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the problem of finding the largest clique in a random graph. An n-vertex random graph has each edge included with probability 1/2, and a clique is a completely connected subgraph. There is no known classical algorithm that finds the largest clique in a random graph with high probability and runs in a time polynomial in n. For the small graphs we are able to investigate (n≤18n \le 18n≤18), the quantum algorithm appears to require only a quadratic run time.
In this paper, we develop a blended dynamics framework for open quantum networks with diffusive couplings. The network consists of qubits interconnected through Hamiltonian couplings, environmental dissipation, and consensus-like diffusive interactions. Such networks commonly arise in spontaneous emission processes and non-Hermitian quantum computing, and their evolution follows a Lindblad master equation. Blended dynamics theory is well established in the classical setting as a tool for analyzing emergent behaviors in heterogeneous networks with diffusive couplings. Its key insight is to blend the local dynamics rather than the trajectories of individual nodes. Perturbation analysis then shows that, under sufficiently strong coupling, all node trajectories tend to stay close to those of the blended system over time. We first show that this theory extends naturally to the reduced-state dynamics of quantum networks, revealing classical-like clustering phenomena in which qubits converge to a shared equilibrium or a common trajectory determined by the quantum blended reduced-state dynamics. We then extend the analysis to qubit coherent states using quantum Laplacians and induced graphs, proving orbit attraction of the network density operator toward the quantum blended coherent dynamics, establishing the emergence of intrinsically quantum and dynamically clustering behaviors. Finally, numerical examples validate the theoretical results.