11
collaborators
2018–2022
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
1 Talk
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Experimental Gaussian-modulated continuous-variable quantum key distribution with composable keys | QCRYPT 2021 | regular | Nitin Jain, Hou-Man Chin, Dino Solar Nikolic, Cosmo Lupo, Stefano Pirandola, Matthias Kolb, Christoph Pacher, Ulrik Lund Andersen, Tobias Gehring |
Continuous-variable quantum key distribution offers a practical way for doing secure key exchange by means of broadband modulators and coherent detectors operating in the telecom band. Recent advances in theory and practice have improved the security and eased the system implementation. These include composable security with a finite number of distributed Gaussian-modulated coherent states and the use of pilot/reference signals and a real local oscillator for sharing the phase reference across the communicating parties. Here we report the first prepare-and-measure continuous-variable quantum key distribution experiment that can produce composable keys in the finite-size regime with security against collective attacks. Through novel improvements in the existing security proofs and a fast, yet low-noise and highly stable system operation, we obtain a secret key rate $>$5 Mbps over a 20 km long fiber channel. Our demonstration verifies the security of practical continuous-variable quantum key distribution when used for encryption or other cryptographic tasks. |
|||
5 Posters
| Title | Conference | Co-authors |
|---|---|---|
| Modulation leakage-free continuous-variable quantum key distribution | QCRYPT 2022 | Adnan A.E. Hajomer, Nitin Jain, Hou-Man Chin, Ulrik Lund Andersen, Tobias Gehring |
| Code efficiency, frame error rate and secure key rate | QCRYPT 2021 | Tobias Gehring, Ulrik Lund Andersen, Bernhard Ömer, Christoph Pacher |
See the short abstract in the attached file. In this poster, we present the finite length efficiency of some of our codes and show how it can improve the secret key rate. For this, the FER performance of some of these codes is plotted versus the efficiency and then we plot the secret key rate versus distance by replacing our codes with other existing codes in the literature. |
||
| Two MET-LDPC codes designed for long distance CV-QKD | QCRYPT 2020 | Bernhard Ömer, Ulrik Lund Andersen, Tobias Gehring, Christoph Pacher |
Here in this poster we present two new MET-LDPC codes designed for rates 0.02 and 0.01 with even higher efficiency: β = 99.2% and β = 98.7% , respectively. We will present simulation results to demonstrate their performance. The presented codes can be used by different reconciliation strategies to increase the distance of CV-QKD. |
||
| Algorithmic Approach to Design Highly Efficient MET-LDPC Codes with Cascade Structure | QCRYPT 2019 | Tobias Gehring, Christoph Pacher, Ulrik Lund Andersen |
| An Approximation Method for Analysis and Design of Multi-Edge Type LDPC Codes | QCRYPT 2018 | Tobias Gehring, Christoph Pacher, Ulrik Lund Andersen |
Collaborators
| Co-author | Joint talks |
|---|---|
| Tobias Gehring | 6 |
| Ulrik Lund Andersen | 6 |
| Christoph Pacher | 5 |
| Bernhard Ömer | 2 |
| Hou-Man Chin | 2 |
| Nitin Jain | 2 |
| Adnan A.E. Hajomer | 1 |
| Cosmo Lupo | 1 |
| Dino Solar Nikolic | 1 |
| Matthias Kolb | 1 |
| Stefano Pirandola | 1 |