A privacy preserving quantum aggregating technique with simulation

Quantum aggregation is a basic operation of secure multiparty quantum computation. All the existing techniques are based on the (n,n) threshold, where n is the total number of players. If any of them is corrupted then these techniques cannot execute correctly. However, the proposed technique is based on the (t,n) threshold. If the players are honest then this technique can perform the aggregation. This technique is based on the monotone span program, access structure, linear secret sharing, control-NOT gate, quantum Fourier transform, blind matrix, and Pauli operator. The proposed technique can aggregate the secrets securely and efficiently. We also simulate the proposed technique using IBM quantum computer to verify the correctness and feasibility.