Consensus And Information Redistribution In Quantum Networks
Abstract
Consensus algorithms are mechanisms driving nodes of a network to agreement. In quantum networks they also redistribute information encoded in the global quantum state, allowing global properties to be inferred from local measurements without reconstructing the global state. Motivated by this, we investigate decentralized quantum consensus in qudit networks governed by discrete random unitary dynamics. We characterize the analytic asymptotic dynamics, identify global information preserved by the evolution, and derive conditions for which different notions of quantum consensus emerge. A general theorem is derived that establishes a unified framework for extracting globally encoded information from local measurements beyond consensus states. First, we analyze CNOT networks and determine which global information can be recovered by individual nodes and which requires joint measurements on cooperating nodes. The CNOT model is well understood and presents a case with entanglement creation - a characteristic quantum feature of networks worth analyzing in detail. Second, we identify the complete class of two-qubit interactions that asymptotically achieve consensus on the average number of excitations, thereby establishing a quantum analogue of classical average consensus. We further show that joint measurements on k cooperating nodes recover exactly the first k moments of the excitation-number distribution.
Related
- Information flow control in hybrid quantum networks
- Distinct Modes of Quantum Information Transfer in Power-Law Long-Range Spin Networks
- Interaction order controls stochastic-resonance enhancement and redistribution in delayed multiplex neural networks
- Bondi Four-Momentum Balance in Quantum NSF Classical matching, DKL supermomentum, and quantum energy redistribution
- Amorphization-Depth-Dependent Bismuth Redistribution and Activation in Silicon for Quantum Devices
BibTeX
@misc{novotny2026consensus,
title = {{Consensus And Information Redistribution In Quantum Networks}},
author = {J. Novotný and D. Štěrba and I. Jex and H. -H. Kowalski and A. Abedi},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.36391},
eprint = {2610.36391},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.36391},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Consensus And Information Redistribution In Quantum Networks
AU - J. Novotný
AU - D. Štěrba
AU - I. Jex
AU - H. -H. Kowalski
AU - A. Abedi
PY - 2026
DA - 2026/10/26
PB - arXiv
DO - 10.48550/arxiv.2610.36391
UR - https://arxiv.org/abs/2610.36391
AB - Consensus algorithms are mechanisms driving nodes of a network to agreement. In quantum networks they also redistribute information encoded in the global quantum state, allowing global properties to be inferred from local measurements without reconstructing the global state. Motivated by this, we investigate decentralized quantum consensus in qudit networks governed by discrete random unitary dynamics. We characterize the analytic asymptotic dynamics, identify global information preserved by the evolution, and derive conditions for which different notions of quantum consensus emerge. A general theorem is derived that establishes a unified framework for extracting globally encoded information from local measurements beyond consensus states. First, we analyze CNOT networks and determine which global information can be recovered by individual nodes and which requires joint measurements on cooperating nodes. The CNOT model is well understood and presents a case with entanglement creation - a characteristic quantum feature of networks worth analyzing in detail. Second, we identify the complete class of two-qubit interactions that asymptotically achieve consensus on the average number of excitations, thereby establishing a quantum analogue of classical average consensus. We further show that joint measurements on k cooperating nodes recover exactly the first k moments of the excitation-number distribution.
ER -