Multiparty Quantum Telecommunication Using Quantum Fourier Transforms

Abstract

Consider the problem: Alice wishes to send the same key to $n-1$ users (Bob, Carol,. . . , Nathan), while preventing eavesdropper Eve from acquiring information without being detected. The problem has no solution in the classical cryptography but in quantum telecommunication there are some codes to solve the problem. In the paper \cite{zengetall}, Guo-Jyun Zeng, Kuan-Hung Chen, Zhe-Hua Chang, Yu-Shan Yang, and Yao-Hsin Chou from one side and Cabello in \cite{cabello} from other side, used Hadamard gates, Pauli gates in providing the quantum communication code for two-partity telecommunication with 3 persons and then generalized it to the case of arbitrary number of participants, indicating the position of measurements of participants. We remark that the Hadamard gate with precising the position of measurement is the same as Fourier transform for two qubits and hence use the general Fourier transform for $n$ entangled qubits, in place of Hadamard gates. The result is more natural for arbitrary $n$ qudits.