Secure multiparty quantum aggregating protocol (pp0245-0256)
           Kartick Sutradhar
           doi: https://doi.org/10.26421/QIC23.3-4-4 
Abstracts: Secure multiparty quantum computation is an important and essential paradigm of quantum computing. All the existing aggregating protocols are $(n, n)$ threshold approaches, where $n$ represents the total number of players. If one player is dishonest, the aggregation protocols cannot aggregate efficiently. In this paper, we propose a $(t, n)$ threshold-based aggregating protocol, where $t$ represents the threshold number of players. This protocol uses Shamir's secret sharing, quantum state, SUM gate, quantum Fourier transform, blind matrix, and Pauli operator. This protocol can perform the aggregation securely and efficiently. In this protocol, we simulate this aggregating protocol using the IBM quantum processor to verify the correctness and feasibility.
Key Words: Quantum Cryptography, Quantum Computation, Information security, Aggregating Protocol, Quantum Circuit