## Connections between Quantum Key Distribution and Quantum Data Hiding

Research output: Book/Report › Ph.D. thesis › Research

#### Standard

**Connections between Quantum Key Distribution and Quantum Data Hiding.** / Frand-Madsen, Mads Friis.

Research output: Book/Report › Ph.D. thesis › Research

#### Harvard

*Connections between Quantum Key Distribution and Quantum Data Hiding*. Department of Mathematical Sciences, Faculty of Science, University of Copenhagen.

#### APA

*Connections between Quantum Key Distribution and Quantum Data Hiding*. Department of Mathematical Sciences, Faculty of Science, University of Copenhagen.

#### Vancouver

#### Author

#### Bibtex

}

#### RIS

TY - BOOK

T1 - Connections between Quantum Key Distribution and Quantum Data Hiding

AU - Frand-Madsen, Mads Friis

PY - 2023

Y1 - 2023

N2 - We consider a classical communication setup with two spatially separated parties sharing a quantum system. In such a setup, entanglement is considered a valuable resource useful for a plethora of undertakings; for one, the generation of secret key, which is the primary concern of our work. In 2004, Horodecki et al., showed that the amount of secret key that can be extracted from noisy bipartite quantum states may exceed the amount of distillable maximally entangled quantum bits. Their work was based on the intuition of quantum data hiding, but did not offer a quantitative relationship to this phenomenon. More recently, the connection between quantum key distribution and quantum data hiding was further developed upon by Christandl and Ferrara [1], who also used the connection as a tool to bound the rate at which secret key can be distributed in a network scenario. In this thesis, we consider the question of distinguishability of quantum states given an imperfect quantum memory. We define a rate at which secure classical data can be extracted from partially secure data with respect to an eavesdropper with imperfect quantum memory. We prove an upper bound and a lower bound on this rate under general assumptions in terms of entropic quantities. Finally, we introduce a rate at which classical data can be hidden from an eavesdropper with imperfect quantum memory, and we relate this back to the notion of quantum data hiding. In a one-way classical communication scenario for quantum key distribution, we prove a lower bound on the distillable key of a generic state in terms of correlation and orthogo- nality of related quantum states. We elaborate on this by showing that the security of a key can be understood in terms of orthogonality of related quantum states. Finally, we also consider the problem of extending the distance of quantum key distribution through intermediate stations, a setting referred to as a quantum key repeater. Here, we exhibit situations, where we can lower bound the performance of the optimal key repeater strat- egy in terms of local state discrimination. This strategy outperforms the naive approach of first distilling maximally entangled states between the individual parties followed by entanglement swapping in certain special cases. Finally, we consider the current practical implications of the gap between distinguishabil- ity of quantum states given perfect or imperfect quantum memory. In 2006, a large gap between the theoretical performance of an eavesdropper with classical or quantum side information was shown in a randomness extraction protocol [2]. Using current commer- cially available quantum hardware, we were, however, not able to achieve an advantage using a quantum protocol when comparing with an error-free classical protocol in this scenario.

AB - We consider a classical communication setup with two spatially separated parties sharing a quantum system. In such a setup, entanglement is considered a valuable resource useful for a plethora of undertakings; for one, the generation of secret key, which is the primary concern of our work. In 2004, Horodecki et al., showed that the amount of secret key that can be extracted from noisy bipartite quantum states may exceed the amount of distillable maximally entangled quantum bits. Their work was based on the intuition of quantum data hiding, but did not offer a quantitative relationship to this phenomenon. More recently, the connection between quantum key distribution and quantum data hiding was further developed upon by Christandl and Ferrara [1], who also used the connection as a tool to bound the rate at which secret key can be distributed in a network scenario. In this thesis, we consider the question of distinguishability of quantum states given an imperfect quantum memory. We define a rate at which secure classical data can be extracted from partially secure data with respect to an eavesdropper with imperfect quantum memory. We prove an upper bound and a lower bound on this rate under general assumptions in terms of entropic quantities. Finally, we introduce a rate at which classical data can be hidden from an eavesdropper with imperfect quantum memory, and we relate this back to the notion of quantum data hiding. In a one-way classical communication scenario for quantum key distribution, we prove a lower bound on the distillable key of a generic state in terms of correlation and orthogo- nality of related quantum states. We elaborate on this by showing that the security of a key can be understood in terms of orthogonality of related quantum states. Finally, we also consider the problem of extending the distance of quantum key distribution through intermediate stations, a setting referred to as a quantum key repeater. Here, we exhibit situations, where we can lower bound the performance of the optimal key repeater strat- egy in terms of local state discrimination. This strategy outperforms the naive approach of first distilling maximally entangled states between the individual parties followed by entanglement swapping in certain special cases. Finally, we consider the current practical implications of the gap between distinguishabil- ity of quantum states given perfect or imperfect quantum memory. In 2006, a large gap between the theoretical performance of an eavesdropper with classical or quantum side information was shown in a randomness extraction protocol [2]. Using current commer- cially available quantum hardware, we were, however, not able to achieve an advantage using a quantum protocol when comparing with an error-free classical protocol in this scenario.

M3 - Ph.D. thesis

BT - Connections between Quantum Key Distribution and Quantum Data Hiding

PB - Department of Mathematical Sciences, Faculty of Science, University of Copenhagen

ER -

ID: 359248303