Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1705.02608

Multiparty Quantum Telecommunication Using Quantum Fourier Transforms

Do Ngoc Diep

Published May 7, 2017• 5 citations
arXivHTMLPDF

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

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

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•1 citation

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

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

Quantum communication

In this chapter, we show that the basic properties of quantum mechanics can be put to practical use in the transmission of information. The most spectacular application is in the field of cryptography, the art of secret communication. After a short overview of classical cryptography, we discuss the unique contribution of quantum mechanics to cryptography. Quantum cryptography enables two communicating parties, named Alice (the sender ) and Bob (the receiver ), to detect whether the transmitted message has been intercepted by Eve (an eavesdropper ). This is a consequence of a basic property of quantum mechanics, the “no-cloning theorem”: an unknown quantum state cannot be cloned. Then we illustrate two remarkable applications of quantum mechanics: dense coding and quantum teleportation. Dense coding uses entanglement to enhance the communication of classical information. If Alice and Bob share an entangled EPR pair of qubits, Alice can operate on her member of the pair and then send it to Bob: this single qubit carries two bits of classical information. Quantum teleportation again exploits entanglement and allows Alice to transmit a quantum bit to Bob by sending him only classical bits. Finally, after providing the necessary background, we discuss the extension of quantum cryptography from discrete to continuous variables, and hence from finite to infinite dimensional Hilbert spaces.

WORLD SCIENTIFIC eBooks•Dec 1, 2018•0 citations

Quantum entanglement and teleportation assisted by multiple parties

Hayashida, Takeshi

Quantum teleportation can be performed if and only if a message is combined with a maximally entangled state. Bennett et al. originally claimed this feasibility condition. In this paper, I give a proof of that condition. Moreover, I specify the condition for teleportation when a single-qubit message is combined with a three-qubit state distributed among three parties. I also consider the situation that a single-qubit message is combined with an $n$-qubit state distributed among $n$ parties.

arXiv:1212.2294•Dec 11, 2012•0 citations
Consider the problem: Alice wishes to send the same key to n−1n-1n−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 nnn entangled qubits, in place of Hadamard gates. The result is more natural for arbitrary nnn qudits.
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 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.
In this chapter, we show that the basic properties of quantum mechanics can be put to practical use in the transmission of information. The most spectacular application is in the field of cryptography, the art of secret communication. After a short overview of classical cryptography, we discuss the unique contribution of quantum mechanics to cryptography. Quantum cryptography enables two communicating parties, named Alice (the sender ) and Bob (the receiver ), to detect whether the transmitted message has been intercepted by Eve (an eavesdropper ). This is a consequence of a basic property of quantum mechanics, the “no-cloning theorem”: an unknown quantum state cannot be cloned. Then we illustrate two remarkable applications of quantum mechanics: dense coding and quantum teleportation. Dense coding uses entanglement to enhance the communication of classical information. If Alice and Bob share an entangled EPR pair of qubits, Alice can operate on her member of the pair and then send it to Bob: this single qubit carries two bits of classical information. Quantum teleportation again exploits entanglement and allows Alice to transmit a quantum bit to Bob by sending him only classical bits. Finally, after providing the necessary background, we discuss the extension of quantum cryptography from discrete to continuous variables, and hence from finite to infinite dimensional Hilbert spaces.
Quantum teleportation can be performed if and only if a message is combined with a maximally entangled state. Bennett et al. originally claimed this feasibility condition. In this paper, I give a proof of that condition. Moreover, I specify the condition for teleportation when a single-qubit message is combined with a three-qubit state distributed among three parties. I also consider the situation that a single-qubit message is combined with an nnn-qubit state distributed among nnn parties.