text: 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 @math rounds if every party initially has the common knowledge of an upper bound @math on the number of parties. This implies that all solvable problems can be solved in @math rounds on average without error (i.e., with zero-sided error) on the network. As a generalization, a quantum algorithm that works in @math rounds is obtained for the problem of exactly computing any symmetric Boolean function, over @math distributed input bits, which is constant over all the @math bits whose sum is larger than @math for @math . All these algorithms work with the bit complexities bounded by a polynomial in @math .
  @cite_0: Quantum computing combines the framework of quantum mechanics with that of computer science. In this paper we give a short introduction to quantum computing and survey the results in the area of distributed quantum computing and its applications to physics.
  @cite_10: We present a brief survey of results where quantum information processing is useful to solve distributed computation tasks. We describe problems that are impossible to solve using classical resources but that become feasible with the help of quantum mechanics. We also give examples where the use of quantum information significantly reduces the need for communication. The main focus of the survey is on communication complexity but we also address other distributed tasks.
  @cite_25: 
summary: See the surveys @cite_25 @cite_0 @cite_10 and the references therein for more work on distributed quantum computing.