Searcharxiv⌕ Search

arXiv subjects

Bernhard Ömer

Publications and source records attributed to Bernhard Ömer.

4 recordsLinked to original sources

Composable free-space continuous-variable quantum key distribution using discrete modulation

Continuous-variable (CV) quantum key distribution (QKD) allows for quantum secure communication with the benefit of being close to existing classical coherent communication. In recent years, CV QKD protocols using a discrete number of displaced coherent states have been studied intensively, as the modulation can be directly implemented with real devices with a finite digital resolution. However, the experimental demonstrations until now only calculated key rates in the asymptotic regime. To be used in cryptographic applications, a QKD system has to generate keys with composable security in the finite-size regime. In this paper, we present a CV QKD system using discrete modulation that is especially designed for urban atmospheric channels. For this, we use polarization encoding to cope with the turbulent but non-birefringent atmosphere. This will allow to expand CV QKD networks beyond the existing fiber backbone. In a first laboratory demonstration, we implemented a novel type of security proof allowing to calculate composable finite-size key rates against i.i.d. collective attacks without any Gaussian assumptions. We applied the full QKD protocol including a QRNG, error correction and privacy amplification to extract secret keys. In particular, we studied the impact of frame errors on the actual key generation.

quant-ph↗

Towards metropolitan free-space quantum networks

Quantum communication has seen rapid progress towards practical large-scale networks, with quantum key distribution (QKD) spearheading this development. While fibre based systems have been shown to be well suited for metropolitan scales, suitable fibre infrastructure may not always be in place. Here, we make the case for an entanglement-based free-space quantum network as a practical and efficient alternative for metropolitan applications. We developed a deployable free space QKD system and demonstrated its use in realistic scenarios. For a representative 1.7-km free-space link, we showcase its ad hoc deployability and achieve secure key rates of up to 5.7 kbps, with 2.5 kbps in direct noon sunlight. By extrapolating experimental data, we show that kbps key rates are achievable even for 10-km distances and multi-user scenarios. We anticipate that our work will establish free space networks as a viable solution for metropolitan applications and an indispensable complementary building block in the future global quantum internet.

quant-ph↗

Practical continuous-variable quantum key distribution with composable security

A quantum key distribution (QKD) system must fulfill the requirement of universal composability to ensure that any cryptographic application (using the QKD system) is also secure. Furthermore, the theoretical proof responsible for security analysis and key generation should cater to the number $N$ of the distributed quantum states being finite in practice. Continuous-variable (CV) QKD based on coherent states, despite being a suitable candidate for integration in the telecom infrastructure, has so far been unable to demonstrate composability as existing proofs require a rather large $N$ for successful key generation. Here we report the first Gaussian-modulated coherent state CVQKD system that is able to overcome these challenges and can generate composable keys secure against collective attacks with $N \lesssim 3.5\times10^8$ coherent states. With this advance, possible due to novel improvements to the security proof and a fast, yet low-noise and highly stable system operation, CVQKD implementations take a significant step towards their discrete-variable counterparts in practicality, performance, and security.

quant-ph↗

Saving fractional bits: A practical entropy efficient code for fair die rolls

We give an implementation of an algorithm that uses fair coin flips to simulate fair rolls of an $n$-sided die. A register plays the role of an entropy pool and holds entropy that is generated as a by-product during each die roll and that is usually discarded. The entropy stored in this register is completely reused during the next rolls. Consequently, we can achieve an almost negligible loss of entropy per roll. The algorithm allows to change the number of sides of the die in each round. We prove that the entropy loss is monotone decreasing with increasing entropy pool size (register length).

cs.IT↗