4
talks
8
posters
1
committee roles
0
leadership roles
2014–2025
years active
Contributions
QIP QCrypt TQC presenter award · △program ◇steering ○organising □local · filled = chair
Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Composable discrete-modulated continuous-variable QKD and its application to urban atmospheric channels | QCRYPT 2024 | regular | Kevin Jaksch, Thomas Dirmeier, Jan Schreck, Yannick Weiser, Stefan Richter, Ömer Bayraktar, Bastian Hacker, Conrad Rößler, Imran Khan, Andrej Kržič, Markus Rothe, Markus Leipe, Nico Döll, Christopher Spiess, Matthias Goy, Stefan Petscharning, Thomas Grafenauer, Bernhard Ömer, Florian Kanitschar, Twesh Upadhyaya, Jie Lin, Norbert Lütkenhaus, Gerd Leuchs, Christoph Marquardt |
In our work, we developed an optical CVQKD system that uses polarization-based QPSK modulation designed for atmospheric quantum communication and a corresponding post-processing pipeline including error correction and privacy amplification. In a first laboratory experiment, we applied the security statement of a recently published security proof to calculate composable key rates with a total security parameter of ε = 1e-10 in the finite size regime against i.i.d. collective attacks. We also used the post-processing pipeline to study the effect of error correction and frame errors on the actual key extraction in a finite-size system – finding that the common approach of going to high frame errors to increase the ECC efficiency β does not optimize the extractable key length.Furthermore, we deployed the system over an ad-hoc atmospheric channel of 1.7 km in Mai 2023 in the city of Jena, Germany. In a first proof-of-principle study, we were able to apply the full optical and post-processing pipeline to extract pseudo-asymptotic keys and discuss the further steps necessary to move the system to the finite-size regime. To the best of our knowledge, this is the first CVQKD demonstration over a real atmospheric channel combining both the new class of DMCVQKD security proofs without Gaussian optimality and error correction steps. |
|||
| Experimental Gaussian-modulated continuous-variable quantum key distribution with composable keys | QCRYPT 2021 | regular | Nitin Jain, Hou-Man Chin, Hossein Mani, Dino Solar Nikolic, Cosmo Lupo, Stefano Pirandola, Matthias Kolb, Ulrik L. Andersen, Tobias Gehring |
| Pilot-Disciplined CV-QKD with True Local Oscillator | QCRYPT 2017 | regular | Fabian Laudenbach, Bernhard Schrenk, Roland Lieger, Edwin Querasser, Gerhard Humer, Michael Hentschel, Hannes Hübel, Chi-Hang Fred Fung, Andreas Poppe, Momtchil Peev |
| Fundamental Finite Key Limits for Information Reconciliation in Quantum Key Distribution | QCRYPT 2014 | regular | Marco Tomamichel, Jesus Martinez-Mateo, ▸David Elkouss Coronas |
Posters
| Title | Conference | Co-authors |
|---|---|---|
| Security Analysis and Implementation of Finite-Size Multi-User CV-QKD with Discrete Modulation | QCRYPT 2025 | Florian Kanitschar, Adnan Hajomer, Michael Hentschel, Tobias Gehring |
The conventional point-to-point setting of a Quantum Key Distribution (QKD) protocol typically considers two directly connected remote parties that aim to establish secret keys. This work proposes a natural generalization of a well-established point-to-point discrete-modulated continuous-variable (CV) QKD protocol to the point-to-multipoint setting. We explore four different trust levels among the communicating parties and provide secure key rates for the loss-only channel and the lossy & noisy channel both in the asymptotic limit and in the finite-size regime. We experimentally demonstrate the feasibility of our protocols in an access network topology with 10 km-long access links, achieving a key rate of $7.09 \times 10^{-3}$ bits per symbol or of 0.866 Mbit/s.
Our study shows that discrete-modulated CV-QKD is a suitable candidate to connect several dozens of users in a point-to-multipoint network, achieving high rates at a reduced cost, using off-the-shelf components employed in modern communication infrastructure. |
||
| Security of Multi-User Quantum Key Distribution with Discrete Modulation | QCRYPT 2024 | Florian Kanitschar |
The conventional point-to-point setting of Quantum Key Distribution (QKD) typically considers two directly connected remote parties that aim to establish secret keys. However, almost all digital communication tasks involve multiple nodes and complex network architectures. Thus, it is essential to adapt and integrate QKD protocols and their security analyses to accommodate these complex environments and ensure secure communication across interconnected systems. This work proposes a natural generalization of a well-established point-to-point discrete modulated (DM) continuous-variable (CV) QKD protocol to the multi-party setting. We explore four different trust levels among the communicating parties and provide secure key rates in lossy and noisy channels. Our study shows that discrete modulated CV-QKD is a suitable candidate to connect several dozens of users in a point-to-multipoint network, achieving high rates at low cost, using off-the-shelf components employed in modern communication infrastructure. |
||
| Multi-User Continuous-Variable Quantum Key Distribution with Discrete Modulation | QCRYPT 2023 | Florian Kanitschar |
In our work, we explore various multi-user scenarios for Continuous Variable Quantum Key Distribution with discrete modulation. We propose and analyse DM CV-QKD protocols for various different multi-user scenarios such as
* One Alice to $n$ Bobs, where the Bobs do not trust each other,
* One Alice to $n$ Bobs, where $m<n$ Bobs trust each other,
* Conference Key Agreement between one Alice and $n$ Bobs.
One common feature of all protocols that we study is that Alice's source does not need any additional expensive components except state-of-the-art beamsplitters, therefore we call it `cheap source'. This makes the transmitter of our proposed protocols easily implementable in experiments and demonstrations.
In our work, we calculate asymptotic secret key rates for a range of parameters and different trust scenarios and show that in the asymptotic limit multi-user DM CV-QKD is possible for distances relevant for mid-sized urban area networks between at least 16 user. This highlights, that DM CV-QKD can be extended to the multi-user scenario and remains a feasible candidate also for early implementations of Quantum Key Distribution in local networks. |
||
| Demonstration of free-space discrete-modulated continuous-variable QKD using real error correction codes and finite-size effects | QCRYPT 2023 | Kevin Jaksch, Thomas Dirmeier, Yannick Weiser, Stefan Richter, Ömer Bayraktar, Bastian Hacker, Conrad Rößler, Imran Khan, Stefan Petscharning, Thomas Grafenauer, Bernhard Ömer, Florian Kanitschar, Twesh Upadhyaya, Jie Lin, Norbert Lütkenhaus, Gerd Leuchs, Christoph Marquardt |
Besides discrete-variable QKD, where single photon detection is used, continuous-variable (CV) protocols are using homodyne detection and are thus promising to be compatible with existing classical coherent communication technology. Originally, the research on CV QKD protocols mostly focused on Gaussian modulation (see review [1]), where one assumes that Alice can continuously displace coherent states according to a 2D Gaussian distribution. This modulation allows the security proofs to take advance of Gaussian optimality conditions, but experimental implementations can only reach this pattern up to some finite discretization. Another approach is to directly use a discrete-modulated (DM) CV QKD protocol. Here, Alice is required to prepare a finite number of displaced coherent states, aiming for a higher experimental simplicity, with the drawback of higher theoretical complexity. Recently, new security proofs such as [2] and corresponding experiments [3,4] could show the feasibility of systems using quadrature amplitude modulation (QAM) with 64 and 256 displaced states. However, the security proof was limited to the asymptotic regime and since the experiments did not use implemented error correction codes, one could only estimate the achievable key rates, but could not generate the secret key itself.
In this poster, we demonstrate experiments with a protocol with a smaller constellation size of four coherent states that share the same amplitude but are shifted by 90° in phase (QPSK modulation). We exploit a recently published security proof providing tight secret key rates for collective attacks even in the finite size regime [5]. Furthermore, we show that the QPSK data is compatible with our implemented low density parity check (LDPC) codes for binary symmetric channels. This allows us to perform the full QKD protocol from experimental quantum state exchange to classical post processing and to generate a secret key shared between Alice and Bob. For this purpose, we use a laboratory system based on polarization encoding in the Stokes parameters which is equivalent to a QPSK pattern in phase space. This scheme is designed to cope with the challenges of a turbulent atmospheric channel. While the fluctuating nature of such a channel can be targeted by sub-binning the transmission channels [6], the atmosphere is in general non-birefringent, allowing for atmospheric quantum communications [7].
[1] F. Laudenbach et al., Adv. Quantum Technol. 1, 1800011 (2018)
[2] A. Denys et al., Quantum 5, 540 (2021)
[3] F. Roumestan et al., arXiv:2207.11702 (2022)
[4] Y. Pan et al., Optics Letters 47, 3307-3310 (2022)
[5] F. Kanitschar et al., arXiv:2301.08686v1 (2023)
[6] V. Usenko et al., New J. Phys. 14, 093048 (2012)
[7] B. Heim et al., New J. Phys. 16, 113018 (2014) |
||
| Feasibility of distributing composable keys with discrete-modulated continuous variable quantum cryptography | QCRYPT 2023 | Nitin Jain, Florian Kanitschar, Adnan A.E. Hajomer, Ulrik L. Andersen, Tobias Gehring |
Advances in the security analysis of continuous-variable quantum key distribution (CVQKD) protocols with true discrete modulation aim to unlock the same performance as that obtained from `traditional' protocols based on Gaussian modulation. We report a CVQKD experiment using 4 states that utilizes a composable security proof to generate a secret key fraction of $5.6 \times 10^{-3}$ bits/symbol over 10 km channel, while providing security against collective attacks. |
||
| Optimization and CV-QKD Post-Processing in the Open Source AIT QKD Software R10 | QCRYPT 2017 | Oliver Maurhart, Chi-Hang Fred Fung, Momtchil Peev |
| Practical noise models for CV-QKD implementations | QCRYPT 2017 | Fabian Laudenbach, Fred Fung, Momtchil Peev, Andreas Poppe, Hannes Hübel |
| Experimental Continuous-Variable Oblivious Transfer | QCRYPT 2017 | Tobias Gehring, Fabian Furrer, Christian Schaffner, Roman Schnabel, Stephanie Wehner |
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| QCRYPT 2018 | PC | member | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Florian Kanitschar | 6 |
| Tobias Gehring | 4 |
| Momtchil Peev | 3 |
| Andreas Poppe | 2 |
| Bastian Hacker | 2 |
| Bernhard Ömer | 2 |
| Chi-Hang Fred Fung | 2 |
| Christoph Marquardt | 2 |
| Conrad Rößler | 2 |
| Fabian Laudenbach | 2 |
| Gerd Leuchs | 2 |
| Imran Khan | 2 |
| Jie Lin | 2 |
| Kevin Jaksch | 2 |
| Michael Hentschel | 2 |
| Nitin Jain | 2 |
| Norbert Lütkenhaus | 2 |
| Stefan Petscharning | 2 |
| Stefan Richter | 2 |
| Thomas Dirmeier | 2 |