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

Entanglement and Quantum Cryphtography

Joonwoo Bae

Published Apr 12, 2007• 0 citations
OpenAlex

Abstract

Quantum cryptography is one of the most important quantum information applications. The present thesis covers several topics on quantum cryptography, such as the security analysis of quantum channels for key distribution protocols and the study of quantum cloning. First, we introduce a general formalism to characterize the cryptographic properties of quantum channels in the realistic scenario where the two honest parties employ prepare and measure protocols and the known two-way communication reconciliation techniques. We derive a necessary and sufficient condition to distill a secret key using this type of schemes for arbitrary bipartite quantum systems of finite dimension. The obtained results suggest that there may exist weakly entangling channels useless for key distribution using prepare and measure schemes. Next, we consider Gaussian states and Gaussian operations for cryptographic tasks and derive a new security condition. As it happens for quantum systems of finite dimension, our results suggest that there may also exist weakly entangled Gaussian states useless for key distribution, using Gaussian operations. Finally, we study the connection between cloning and state estimation. It was a long-standing problem to show whether state estimation becomes equivalent to quantum cloning in the asymptotic limit of an infinite number of clones. The equivalence is proven here using two known results in quantum information theory, the monogamy of quantum states and the properties of entanglement-breaking channels.

Related papers

Key distillation from quantum channels using two-way communication protocols

Joonwoo Bae, Antonio Acín

We provide a general formalism to characterize the cryptographic properties of quantum channels in the realistic scenario where the two honest parties employ prepare and measure protocols and the known two-way communication reconciliation techniques. We obtain a necessary and sufficient condition to distill a secret key using this type of schemes for Pauli qubit channels and generalized Pauli channels in higher dimension. Our results can be applied to standard protocols such as Bennett-Brassard 1984 or six-state, giving a critical error rate of 20% and 27.6%, respectively. We explore several possibilities to enlarge these bounds, without any improvement. These results suggest that there may exist weakly entangling channels useless for key distribution using prepare and measure schemes.

arXiv:quant-ph/0610048•Physical Review A•Jan 26, 2007•82 citations

Quantum Cryptography Beyond Qubits

Frédéric Bouchard

Over the last few decades, quantum cryptography has been one of the most important quantum technologies developed. It holds the promise of communicating secure information over untrusted channels. In particular, quantum cryptography is immune to the eventual threats posed by large-scale quantum computers, which is not the case for our current classical cryptography infrastructures. In a world where information, communication and privacy are of paramount importance, the development of secure quantum communication infrastructures becomes imperative. So far, most of the quantum cryptographic systems developed to date are based on two-dimensional encoding schemes, analogous to classical bits, known as qubits. Nevertheless, other than for the polarization of light, photonic degrees of freedom, i.e. position, momentum, time and frequency, naturally occur as high-dimensional quantum systems. Moreover, by considering high-dimensional encoding schemes beyond qubits, advantages in terms of information capacity and noise tolerance are predicted in theory. In this thesis, the basic components of a high-dimensional quantum cryptographic system are investigated. We begin by reviewing important developments in quantum cryptography and high-dimensional quantum information. As a starting point, two different quantum information tasks, i.e. optimal quantum cloning and quantum metrology, are experimentally investigated for high-dimensional quantum systems in order to demonstrate the numerous advantages of performing quantum tasks beyond qubits. The photonic degree of freedom used in these experiments, known as transverse spatial modes, is obtained by combining the position and momentum photonics degrees of freedom. Thus, we develop a novel method to measure high-dimensional quantum states encoded in arbitrary spatial modes. Using a similar characterization technique, several high-dimensional quantum communication channels are characterized to perform high-dimensional quantum cryptography. The tools developed in the laboratory are then brought to realistic conditions in order to test the feasibility of high-dimensional quantum cryptography. Two different types of quantum channels are experimentally investigated, namely an intra-city 300 m long free-space link and a short 3 m outdoor underwater link. Finally, we investigate and compare novel high-dimensional protocols to overcome current limitations.

•Oct 17, 2019•0 citations

Secrecy properties of quantum channels

Antonio Acín, Joonwoo Bae, E. Bagán +3 more

We identify those properties of a quantum channel that are relevant for cryptography. We focus on general key distribution protocols that use prepare and measure schemes and the existing classical reconciliation techniques, as these are the protocols feasible with current technology. Given a channel, we derive an easily computable necessary condition of security for such protocols. In spite of its simplicity, this condition is shown to be tight for the Bennett-Brassard 1984 and six-state protocols. We show that the condition becomes also sufficient in the event of a so-called collective attack.

arXiv:quant-ph/0411092•Physical Review A•Jan 20, 2006•37 citations

Efficiency in Quantum Key Distribution Protocols with Entangled Gaussian States

Carles Rodó, Oriol Romero‐Isart, K. Eckert +1 more

Quantum key distribution (QKD) refers to specific quantum strategies which permit the secure distribution of a secret key between two parties that wish to communicate secretly. Quantum cryptography has proven unconditionally secure in ideal scenarios and has been successfully implemented using quantum states with finite (discrete) as well as infinite (continuous) degrees of freedom. Here, we analyze the efficiency of QKD protocols that use as a resource entangled gaussian states and gaussian operations only. In this framework, it has already been shown that QKD is possible [1] but the issue of its efficiency has not been considered. We propose a figure of merit (the efficiency E) to quantify the number of classical correlated bits that can be used to distill a key from a sample of N entangled states. We relate the efficiency of the protocol to the entanglement and purity of the states shared between the parties.

arXiv:quant-ph/0611277•Open Systems & Information Dynamics•Mar 1, 2007•12 citations

Quantum Cryptography in d-dimensional Hilbert spaces

Anita Eusebi

The topic of this thesis is Quantum Cryptography. Based on the laws of Quantum Mechanics, this allows two parties to share a secure key, by using quantum states to carry classical information. Namely, the Quantum Key Distribution (QKD) process, completed with the classical algorithm One Time Pad, leads to an unconditionally secure cryptosystem. Most QKD protocols, like the famous BB84, are realized on unidirectional quantum channels and have probabilistic character. Recently, a new protocol, named LM05, has been proposed, which works on bidirectional quantum channels and in a deterministic way. This thesis is mainly concerned with protocols extending LM05 from binary to d-ary alphabets (dmajor2), by using multi-level quantum systems in d-dimensional Hilbert spaces. The construction of such protocols relies on the notion of Mutually Unbiased Bases (MUB). But the total number of MUB in a Hilbert space of dimension d is known only if d is a prime power. Accordingly, the new protocols are realized under this assumption. As a preliminary step, an explicit expression for MUB encompassing powers of both even and odd primes is discussed. The first proposed extension, called EM09, uses shift operators on MUB to encode information and the usual quantum measurement to realize the control procedure. This guarantees maximal security for dimension d=3 against a powerful individual attack. The second extension, named EM11, is characterized by an innovative control strategy based on a suitable unitary transformation rather than on quantum measurement. Such protocol only works for d an odd prime power, due to the particular choice of the control operator, which is proved to be the only possible with the required properties. The EM11 protocol leads to a relevant improvement. In fact, the security against the same attack is much better than in the EM09 and it increases in terms of the dimension d. Some partial results are also obtained about the possible extensions of the probabilistic protocol called SARG04 to higher dimensions. Finally, it is considered the use of the EM09 and EM11 protocols in the Quantum Direct Communication, where the meaningful message is transmitted without any encryption, as allowed by their deterministic character. In this context, the asymptotic security turns out to be optimal in dimension d=2 for EM09 and in dimension d=3 for EM11.

•Oct 13, 2011•0 citations

Entropy Bounds via Hypothesis Testing and Its Applications to Two-Way Key Distillation in Quantum Cryptography

Rutvij Bhavsar, Junguk Moon, Joonwoo Bae

Quantum key distribution (QKD) achieves information-theoretic security for a shared secret key, using distributed quantum states. To establish secret bits, two honest parties apply key distillation protocols to the resulting measurement outcomes. In this work, we establish a rigorous connection between the key rate achievable by applying two-way key distillation, such as advantage distillation, and quantum hypothesis testing, via an integral representation of the conditional entropy in terms of the error probabilities of binary state discrimination. This connection significantly improves bounds on key rates at finite blocklengths relative to existing fidelity-based bounds. Moreover, in an important special case, it closes the gap between the known sufficient and conjectured necessary conditions for key generation in the large-blocklength limit. More generally, it establishes a matching asymptotic necessary condition, leaving the corresponding finite-blocklength result open. More broadly, our work shows how results in quantum hypothesis testing can directly sharpen the security analysis of QKD.

quant-pharXiv:2602.05870•Feb 6, 2026•1 citation
Quantum cryptography is one of the most important quantum information applications. The present thesis covers several topics on quantum cryptography, such as the security analysis of quantum channels for key distribution protocols and the study of quantum cloning. First, we introduce a general formalism to characterize the cryptographic properties of quantum channels in the realistic scenario where the two honest parties employ prepare and measure protocols and the known two-way communication reconciliation techniques. We derive a necessary and sufficient condition to distill a secret key using this type of schemes for arbitrary bipartite quantum systems of finite dimension. The obtained results suggest that there may exist weakly entangling channels useless for key distribution using prepare and measure schemes. Next, we consider Gaussian states and Gaussian operations for cryptographic tasks and derive a new security condition. As it happens for quantum systems of finite dimension, our results suggest that there may also exist weakly entangled Gaussian states useless for key distribution, using Gaussian operations. Finally, we study the connection between cloning and state estimation. It was a long-standing problem to show whether state estimation becomes equivalent to quantum cloning in the asymptotic limit of an infinite number of clones. The equivalence is proven here using two known results in quantum information theory, the monogamy of quantum states and the properties of entanglement-breaking channels.
We provide a general formalism to characterize the cryptographic properties of quantum channels in the realistic scenario where the two honest parties employ prepare and measure protocols and the known two-way communication reconciliation techniques. We obtain a necessary and sufficient condition to distill a secret key using this type of schemes for Pauli qubit channels and generalized Pauli channels in higher dimension. Our results can be applied to standard protocols such as Bennett-Brassard 1984 or six-state, giving a critical error rate of 20% and 27.6%, respectively. We explore several possibilities to enlarge these bounds, without any improvement. These results suggest that there may exist weakly entangling channels useless for key distribution using prepare and measure schemes.
Over the last few decades, quantum cryptography has been one of the most important quantum technologies developed. It holds the promise of communicating secure information over untrusted channels. In particular, quantum cryptography is immune to the eventual threats posed by large-scale quantum computers, which is not the case for our current classical cryptography infrastructures. In a world where information, communication and privacy are of paramount importance, the development of secure quantum communication infrastructures becomes imperative. So far, most of the quantum cryptographic systems developed to date are based on two-dimensional encoding schemes, analogous to classical bits, known as qubits. Nevertheless, other than for the polarization of light, photonic degrees of freedom, i.e. position, momentum, time and frequency, naturally occur as high-dimensional quantum systems. Moreover, by considering high-dimensional encoding schemes beyond qubits, advantages in terms of information capacity and noise tolerance are predicted in theory. In this thesis, the basic components of a high-dimensional quantum cryptographic system are investigated. We begin by reviewing important developments in quantum cryptography and high-dimensional quantum information. As a starting point, two different quantum information tasks, i.e. optimal quantum cloning and quantum metrology, are experimentally investigated for high-dimensional quantum systems in order to demonstrate the numerous advantages of performing quantum tasks beyond qubits. The photonic degree of freedom used in these experiments, known as transverse spatial modes, is obtained by combining the position and momentum photonics degrees of freedom. Thus, we develop a novel method to measure high-dimensional quantum states encoded in arbitrary spatial modes. Using a similar characterization technique, several high-dimensional quantum communication channels are characterized to perform high-dimensional quantum cryptography. The tools developed in the laboratory are then brought to realistic conditions in order to test the feasibility of high-dimensional quantum cryptography. Two different types of quantum channels are experimentally investigated, namely an intra-city 300 m long free-space link and a short 3 m outdoor underwater link. Finally, we investigate and compare novel high-dimensional protocols to overcome current limitations.
We identify those properties of a quantum channel that are relevant for cryptography. We focus on general key distribution protocols that use prepare and measure schemes and the existing classical reconciliation techniques, as these are the protocols feasible with current technology. Given a channel, we derive an easily computable necessary condition of security for such protocols. In spite of its simplicity, this condition is shown to be tight for the Bennett-Brassard 1984 and six-state protocols. We show that the condition becomes also sufficient in the event of a so-called collective attack.
Quantum key distribution (QKD) refers to specific quantum strategies which permit the secure distribution of a secret key between two parties that wish to communicate secretly. Quantum cryptography has proven unconditionally secure in ideal scenarios and has been successfully implemented using quantum states with finite (discrete) as well as infinite (continuous) degrees of freedom. Here, we analyze the efficiency of QKD protocols that use as a resource entangled gaussian states and gaussian operations only. In this framework, it has already been shown that QKD is possible [1] but the issue of its efficiency has not been considered. We propose a figure of merit (the efficiency E) to quantify the number of classical correlated bits that can be used to distill a key from a sample of N entangled states. We relate the efficiency of the protocol to the entanglement and purity of the states shared between the parties.
The topic of this thesis is Quantum Cryptography. Based on the laws of Quantum Mechanics, this allows two parties to share a secure key, by using quantum states to carry classical information. Namely, the Quantum Key Distribution (QKD) process, completed with the classical algorithm One Time Pad, leads to an unconditionally secure cryptosystem. Most QKD protocols, like the famous BB84, are realized on unidirectional quantum channels and have probabilistic character. Recently, a new protocol, named LM05, has been proposed, which works on bidirectional quantum channels and in a deterministic way. This thesis is mainly concerned with protocols extending LM05 from binary to d-ary alphabets (dmajor2), by using multi-level quantum systems in d-dimensional Hilbert spaces. The construction of such protocols relies on the notion of Mutually Unbiased Bases (MUB). But the total number of MUB in a Hilbert space of dimension d is known only if d is a prime power. Accordingly, the new protocols are realized under this assumption. As a preliminary step, an explicit expression for MUB encompassing powers of both even and odd primes is discussed. The first proposed extension, called EM09, uses shift operators on MUB to encode information and the usual quantum measurement to realize the control procedure. This guarantees maximal security for dimension d=3 against a powerful individual attack. The second extension, named EM11, is characterized by an innovative control strategy based on a suitable unitary transformation rather than on quantum measurement. Such protocol only works for d an odd prime power, due to the particular choice of the control operator, which is proved to be the only possible with the required properties. The EM11 protocol leads to a relevant improvement. In fact, the security against the same attack is much better than in the EM09 and it increases in terms of the dimension d. Some partial results are also obtained about the possible extensions of the probabilistic protocol called SARG04 to higher dimensions. Finally, it is considered the use of the EM09 and EM11 protocols in the Quantum Direct Communication, where the meaningful message is transmitted without any encryption, as allowed by their deterministic character. In this context, the asymptotic security turns out to be optimal in dimension d=2 for EM09 and in dimension d=3 for EM11.
Quantum key distribution (QKD) achieves information-theoretic security for a shared secret key, using distributed quantum states. To establish secret bits, two honest parties apply key distillation protocols to the resulting measurement outcomes. In this work, we establish a rigorous connection between the key rate achievable by applying two-way key distillation, such as advantage distillation, and quantum hypothesis testing, via an integral representation of the conditional entropy in terms of the error probabilities of binary state discrimination. This connection significantly improves bounds on key rates at finite blocklengths relative to existing fidelity-based bounds. Moreover, in an important special case, it closes the gap between the known sufficient and conjectured necessary conditions for key generation in the large-blocklength limit. More generally, it establishes a matching asymptotic necessary condition, leaving the corresponding finite-blocklength result open. More broadly, our work shows how results in quantum hypothesis testing can directly sharpen the security analysis of QKD.