© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:1705.02608

Multiparty Quantum Telecommunication Using Quantum Fourier Transforms

Do Ngoc Diep

Published May 7, 2017• 4 citations

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.

DOI: 10.48550/arxiv.1705.02608

Related papers

Multiparty Quantum Secret Sharing Using Quantum Fourier Transform

Huang, Da-Zu, Chen +3 more

一(n， n ) 多党的量秘密分享的阀值计划古典或量消息基于分离的量 Fourier 变换被建议。在我们的建议计划，仅当所有参加者在音乐会工作，秘密消息，被使用前面的量 Fourier 变换编码并且由使用颠倒译码，以如此的一个方法被切开并且分享，它能在他们之中被重建。而且，我们也讨论这个协议怎么必须小心地为改正错误或一个不诚实的参加者被设计。安全分析证明我们的计划是安全的。另外，这个计划有它与量计算完全兼容的一个优点并且更容易在分布式的量认识到安全计算。

理论物理通讯：英文版•Jan 1, 2009•7 citations

On Simultaneously Generating Multiple Keys in a Joint Source-Channel Model

Wenwen Tu, Mario Goldenbaum, Lifeng Lai +1 more

In this paper, the problem of simultaneously generating multiple keys over a cascade of a noiseless channel and a wiretap channel is considered. The problem consists of three legitimate parties (i.e., Alice, Bob, and Carol) and an eavesdropper (Eve), where Alice and Bob wish to agree with Carol on independent secret keys, both of which should be kept secret from Eve. Alice and Bob are connected via a noiseless channel, and Bob is connected with Carol via a wiretap channel, while there is no direct connection between Alice and Carol. To Alice and Carol, Bob acts as a relay. Under this model, a full characterization of the secret-key capacity region is provided for the case in which Eve has no side information. This result shows that there exists a tradeoff between the individual secret-key rates. Then, this result is generalized to the case in which Eve has side information, and the corresponding secret-key capacity region is fully characterized.

IEEE Transactions on Information Forensics and Security•Sep 21, 2016•11 citations

Teleportation of Multi-qudit Entangled States

Zhan Xiao-Gui, Hongmei Li, Zeng Hao-Sheng

We propose a method to realize the teleportation of an unknown entangled state that consists of many qudits through a partially entangled-qudit quantum channel with the help of 2log 2 d -bit classical communication. The operations used in the teleportation process include a generalized Bell-state measurement and a series of single-qudit π-measurements performed by Alice, a series of generalized qudit-Pauli gates and two-level unitary gates, as well as a qubit measurement performed by Bob. For a maximally entangled quantum channel, the successful probability of the teleportation becomes unit.

Chinese Physics Letters•Oct 26, 2006•20 citations

Secure Source Coding with a Helper

Ravi Tandon, Şennur Ulukuş, Kannan Ramchandran

We consider a secure source coding problem with a rate-limited helper. In particular, Alice observes an independent and identically distributed (i.i.d.) source X and wishes to transmit this source losslessly to Bob over a rate-limited link. A helper (Helen), observes an i.i.d. correlated source Y and can transmit information to Bob over a separate rate-limited link. A passive eavesdropper (Eve) can observe the coded output of Alice, i.e., the link from Alice to Bob is public. The uncertainty about the source X at Eve, is measured by the conditional entropy of the source given the coded output of Alice. We completely characterize the rate-equivocation region for this secure source coding model, where we show that Slepian-Wolf binning of X with respect to the coded side information received at Bob is optimal. We next consider a modification of this model in which Alice also has access to the coded output of Helen. For the two-sided helper model, we characterize the rate-equivocation region. While the availability of side information at Alice does not reduce the rate of transmission from Alice, it significantly enhances the resulting equivocation at Eve. In particular, the resulting equivocation for the two-sided helper case is shown to be min(H(X),R_y), i.e., one bit from the two-sided helper provides one bit of uncertainty at Eve. From this result, we infer that Slepian-Wolf binning of X is suboptimal and one can further decrease the information leakage to the eavesdropper by utilizing the side information at Alice. We finally generalize these results to the case in which there is additional un-coded side information W available at Bob and characterize the rate-equivocation regions under the assumption that Y-X-W forms a Markov chain.

arXiv:0910.5759•Oct 30, 2009•3 citations

Can we implement this quantum communication ?

Tian-Hai Zeng

Here I design an experimental way of a quantum communication by quantum CNOT gates and single qubit gates without the help of classical communication.

arXiv:physics/0507008•Jul 1, 2005•0 citations

A multiparty quantum proxy group signature scheme for the entangled-state message with quantum Fourier transform

Jinjing Shi, Ronghua Shi, Ying Tang +1 more

Quantum Information Processing•Jan 8, 2011•44 citations

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.

一(n， n ) 多党的量秘密分享的阀值计划古典或量消息基于分离的量 Fourier 变换被建议。在我们的建议计划，仅当所有参加者在音乐会工作，秘密消息，被使用前面的量 Fourier 变换编码并且由使用颠倒译码，以如此的一个方法被切开并且分享，它能在他们之中被重建。而且，我们也讨论这个协议怎么必须小心地为改正错误或一个不诚实的参加者被设计。安全分析证明我们的计划是安全的。另外，这个计划有它与量计算完全兼容的一个优点并且更容易在分布式的量认识到安全计算。

In this paper, the problem of simultaneously generating multiple keys over a cascade of a noiseless channel and a wiretap channel is considered. The problem consists of three legitimate parties (i.e., Alice, Bob, and Carol) and an eavesdropper (Eve), where Alice and Bob wish to agree with Carol on independent secret keys, both of which should be kept secret from Eve. Alice and Bob are connected via a noiseless channel, and Bob is connected with Carol via a wiretap channel, while there is no direct connection between Alice and Carol. To Alice and Carol, Bob acts as a relay. Under this model, a full characterization of the secret-key capacity region is provided for the case in which Eve has no side information. This result shows that there exists a tradeoff between the individual secret-key rates. Then, this result is generalized to the case in which Eve has side information, and the corresponding secret-key capacity region is fully characterized.

We propose a method to realize the teleportation of an unknown entangled state that consists of many qudits through a partially entangled-qudit quantum channel with the help of 2log 2 d -bit classical communication. The operations used in the teleportation process include a generalized Bell-state measurement and a series of single-qudit π-measurements performed by Alice, a series of generalized qudit-Pauli gates and two-level unitary gates, as well as a qubit measurement performed by Bob. For a maximally entangled quantum channel, the successful probability of the teleportation becomes unit.

We consider a secure source coding problem with a rate-limited helper. In particular, Alice observes an independent and identically distributed (i.i.d.) source X and wishes to transmit this source losslessly to Bob over a rate-limited link. A helper (Helen), observes an i.i.d. correlated source Y and can transmit information to Bob over a separate rate-limited link. A passive eavesdropper (Eve) can observe the coded output of Alice, i.e., the link from Alice to Bob is public. The uncertainty about the source X at Eve, is measured by the conditional entropy of the source given the coded output of Alice. We completely characterize the rate-equivocation region for this secure source coding model, where we show that Slepian-Wolf binning of X with respect to the coded side information received at Bob is optimal. We next consider a modification of this model in which Alice also has access to the coded output of Helen. For the two-sided helper model, we characterize the rate-equivocation region. While the availability of side information at Alice does not reduce the rate of transmission from Alice, it significantly enhances the resulting equivocation at Eve. In particular, the resulting equivocation for the two-sided helper case is shown to be min(H(X),R_y), i.e., one bit from the two-sided helper provides one bit of uncertainty at Eve. From this result, we infer that Slepian-Wolf binning of X is suboptimal and one can further decrease the information leakage to the eavesdropper by utilizing the side information at Alice. We finally generalize these results to the case in which there is additional un-coded side information W available at Bob and characterize the rate-equivocation regions under the assumption that Y-X-W forms a Markov chain.