| Abstract: | Security and privacy issues have attracted the attention of researchers in the field of IoT as the information processing scale grows in sensor networks. Quantum computing, theoretically known as an absolutely secure way to store and transmit information as well as a speed-up way to accelerate local or distributed classical algorithms that are hard to solve with polynomial complexity in computation or communication. In this paper, we focus on the phase estimation method that is crucial to the realization of a general multi-party computing model, which is able to be accelerated by quantum algorithms. A novel multi-party phase estimation algorithm and the related quantum circuit are proposed by using a distributed Oracle operator with iterations. The proved theoretical communication complexity of this algorithm shows it can give the phase estimation before applying multi-party computing efficiently without increasing any additional complexity. Moreover, a practical problem of multi-party dating investigated shows it can make a successful estimation of the number of solution in advance with zero communication complexity by utilizing its special statistic feature. Sufficient simulations present the correctness, validity and efficiency of the proposed estimation method. |
