English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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

Multiparty Quantum Telecommunication Using Quantum Fourier Transforms