Efficient Quantum Multi‐Party Summation Based on Shift Operations

ABSTRACT

Private computation has become an increasingly important trend. It can be achieved either through traditional methods, such as homomorphic encryption, or by implementing various quantum protocols. Most existing protocols for quantum multiparty summation rely on quantum Fourier transforms and the generation of high‐dimensional entangled states. This paper presents a highly efficient quantum multiparty summation protocol that requires only shift operations applied to ‐level quantum systems (qudits), significantly simplifying its implementation. Furthermore, the number of values that each participant can express scales with the number of photons, without requiring higher‐dimensional quantum states. This study adopts a circular model for quantum transmission to ensure that no participant gains an advantage regarding information leakage based on the order of participation.