Although there are at present many occupations that require a good deal of skill and training in advanced mathematics, mathematics itself is still often regarded as a curious profession demanding singular talents and a singular personality. My own character – apart from a certain tolerance of solitude, even a preference for it – has always seemed to me to be quite ordinary and although, as a ch...

Many real-world networks are inherently decentralized. For example, in social networks, each user maintains a local view of graph, such as list friends and her profile. It is typical to collect these views graphs conduct graph learning tasks. However, over can raise privacy concerns often contain sensitive information. In this paper, we seek ensure private on decentralized network graph. Toward...

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 par...