A Fast Exact Quantum Algorithm for Solitude Verification

Abstract

Solitude verification is arguably one of the simplest fundamental problems in distributed computing, where the goal is to verify that there is a unique contender in a network. This paper devises a quantum algorithm that exactly solves the problem on an anonymous network, which is known as a network model with minimal assumptions [Angluin, STOC'80]. The algorithm runs in $O(N)$ rounds if every party initially has the common knowledge of an upper bound $N$ on the number of parties. This implies that all solvable problems can be solved in $O(N)$ rounds on average without error (i.e., with zero-sided error) on the network. As a generalization, a quantum algorithm that works in $O(N{\log }_2(\max \{k,2\}))$ rounds is obtained for the problem of exactly computing any symmetric Boolean function, over $n$ distributed input bits, which is constant over all the $n$ bits whose sum is larger than $k$ for $k\in \{0,1,\dots ,N-1\}$. All these algorithms work with the bit complexities bounded by a polynomial in $N$.

26 pages, accepted for publication in Quantum Information and Computation (QIC)

References in corpus (5)

• Experimental demonstration of a quantum protocol for Byzantine agreement and liar detection
• Quantum dice rolling: A multi-outcome generalization of quantum coin flipping
• Can quantum mechanics help distributed computing?
• Multi-partite Quantum Entanglement versus Randomization: Fair and Unbiased Leader Election in Networks
• Quantum Leader Election