arXiv subjects

Jan Krause

Publications and source records attributed to Jan Krause.

8 recordsLinked to original sources

arXiv2026

An Adaptive Variable Neighborhood Search for a Family of Set Covering Routing Problems with an Application in Disaster Relief Operations

This paper studies a variant of the Set Covering Routing Problem (SCRP) motivated by post-disaster humanitarian logistics. We consider a hybrid distribution concept in which the majority of transportation is performed by helicopters, while ground transport is limited to the last mile, addressing severe accessibility constraints in disaster-affected regions. The resulting problem integrates landing site location, routing, and covering decisions, incorporating features of the Multi-Vehicle Covering Tour Problem (m-CTP) and the Vehicle Routing with Demand Allocation Problem (VRDAP) in a facility-capacitated, multi-depot setting. Due to the computational complexity of the problem, we develop an Adaptive Variable Neighborhood Search (AVNS) that combines established routing operators with novel mechanisms for covering decisions. The performance of the proposed approach is evaluated on benchmark instances for the related m-CTP and VRDAP problems, demonstrating competitive solution quality compared to problem-specific state-of-the-art approaches. Furthermore, we apply our AVNS to a real-world case study based on the 2024 flash floods in Afghanistan. The results highlight the practical relevance of the proposed framework and provide managerial insights into effective distribution strategies for disaster response operations.

math.OC↗

arXiv2025

Dynamic rerouting and interruption resilience of quantum communication via single-photon-based resynchronization

We present a resynchronization method for quantum key distribution (QKD) systems that enables rapid and reliable recovery from interruptions of the quantum channel and changes of its optical path length. By periodically transmitting short fixed pulse patterns over the quantum channel, our approach achieves swift clock offset recovery, typically within a few hundred milliseconds. We implemented this method in our time-bin-phase BB84 QKD system, demonstrating successful resynchronization after multi-minute channel interruptions and fiber length changes exceeding 100 km. The method can be retrofitted to existing systems via a software upgrade and without hardware changes, allowing for broad applicability. In total, the resynchronization method significantly enhances QKD system resilience and allows for reliable operation in challenging environments such as dynamically routed optical networks, i.e., software-defined networks, and free-space optical links with mobile nodes.

quant-ph↗

arXiv2025

Exponential-recovery model for free-running SPADs with capacity-induced dead-time imperfections

Current count-rate models for single-photon avalanche diodes (SPADs) typically assume an instantaneous recovery of the quantum efficiency following dead-time, leading to a systematic overestimation of the effective detection efficiency for high photon flux. To overcome this limitation, we introduce a generalized analytical count-rate model for free-running SPADs that models the non-instantaneous, exponential recovery of the quantum efficiency following dead-time. Our model, framed within the theory of non-homogeneous Poisson processes, only requires one additional detector parameter -- the exponential-recovery time constant $\tau_\mathrm{r}$. The model accurately predicts detection statistics deep into the saturation regime, outperforming the conventional step-function model by two orders of magnitude in terms of the impinging photon rate. For extremely high photon flux, we further extend the model to capture paralyzation effects. Beyond photon flux estimation, our model simplifies SPAD characterization by enabling the extraction of quantum efficiency $\eta_0$, dead-time $\tau_\mathrm{d}$, and recovery time constant $\tau_\mathrm{r}$ from a single inter-detection interval histogram. This can be achieved with a simple setup, without the need for pulsed lasers or externally gated detectors. We anticipate broad applicability of our model in quantum key distribution (QKD), time-correlated single-photon counting (TCSPC), LIDAR, and related areas. Furthermore, the model is readily adaptable to other types of dead-time-limited detectors. A Python implementation is provided as supplementary material for swift adoption.

quant-ph↗

arXiv2024

Ad-hoc hybrid-heterogeneous metropolitan-range quantum key distribution network

This paper presents the development and implementation of a versatile ad-hoc metropolitan-range Quantum Key Distribution (QKD) network. The approach presented integrates various types of physical channels and QKD protocols, and a mix of trusted and untrusted nodes. Unlike conventional QKD networks that predominantly depend on either fiber-based or free-space optical (FSO) links, the testbed presented amalgamates FSO and fiber-based links, thereby overcoming some inherent limitations. Various network deployment strategies have been considered, including permanent infrastructure and provisional ad-hoc links to eradicate coverage gaps. Furthermore, the ability to rapidly establish a network using portable FSO terminals and to investigate diverse link topologies is demonstrated. The study also showcases the successful establishment of a quantum-secured link to a cloud server.

quant-ph↗

arXiv2024

An Adaptive Variable Neighborhood Search for a Family of Set Covering Routing Problems with an Application in Disaster Relief Operations

This paper studies a variant of the Set Covering Routing Problem (SCRP) motivated by post-disaster humanitarian logistics. We consider a hybrid distribution concept in which the majority of transportation is performed by helicopters, while ground transport is limited to the last mile, addressing severe accessibility constraints in disaster-affected regions. The resulting problem integrates landing site location, routing, and covering decisions, incorporating features of the Multi-Vehicle Covering Tour Problem (m-CTP) and the Vehicle Routing with Demand Allocation Problem (VRDAP) in a facility-capacitated, multi-depo setting. Due to the computational complexity of the problem, we develop an Adaptive Variable Neighborhood Search (AVNS) that combines established routing operators with novel mechanisms for covering decisions. The performance of the proposed approach is evaluated on benchmark instances for the related m-CTP and VRDAP problems, demonstrating competitive solution quality compared to problem-specific state-of-the-art approaches. Furthermore, we apply our AVNS to a real-world case study based on the 2024 flash floods in Afghanistan. The results highlight the practical relevance of the proposed framework and provide managerial insights into effective distribution strategies for disaster response operations.

math.OC↗

arXiv2024

A consolidated and accessible security proof for finite-size decoy-state quantum key distribution

In recent years, quantum key distribution (QKD) has evolved from a scientific research field to a commercially available security solution, supported by mathematically formulated security proofs. However, since the knowledge required for a full understanding of a security proof is scattered across numerous publications, it has proven difficult to gain a comprehensive understanding of all steps involved in the process and their limitations without considerable effort and attention to detail. Our paper aims to address this issue by providing a rigorous and comprehensive security proof for the finite-size 1-decoy and 2-decoy BB84 protocols against coherent attacks within Renner's entropic uncertainty relation framework. We resolve important technical flaws found in previous works regarding the fixed-length treatment of protocols and the careful handling of acceptance testing. To this end, we provide various technical arguments, including an analysis accounting for the important distinction of the 1-decoy protocol where statistics are computed after error correction, along with a slight improvement of the secure-key length. We also explicitly clarify the aspect of conditioning on events, addressing a technical detail often overlooked and essential for rigorous proofs. We extensively consolidate and unify concepts from many works, thoroughly discussing the underlying assumptions and resolving technical inconsistencies. Therefore, our contribution represents a significant advancement towards a broader and deeper understanding of QKD security proofs.

quant-ph↗

arXiv2024

Clock offset recovery with sublinear complexity enables synchronization on low-level hardware for quantum key distribution

We introduce iQSync, a clock offset recovery method designed for implementation on low-level hardware, such as FPGAs or microcontrollers, for quantum key distribution (QKD). iQSync requires minimal memory, only a simple instruction set (e.g. no floating-point operations), and can be evaluated with sublinear time complexity, typically involving no more than a few thousand iterations of a simple loop. Furthermore, iQSync allows for a precise clock offset recovery within few seconds, even for large offsets, and is well suited for scenarios with high channel loss and low signal-to-noise ratio, irrespective of the prepare-and-measure QKD protocol used. We implemented the method on our QKD platform, demonstrating its performance and conformity with analytically derived success probabilities for channel attenuations exceeding 70 dB.

quant-ph↗

arXiv2019

Nuclear Charge Radii of $^{10,11}$B

The first determination of the nuclear charge radius by laser spectroscopy for a five-electron system is reported. This is achieved by combining high-accuracy ab initio mass-shift calculations and a high-resolution measurement of the isotope shift in the $2s^2 2p\, ^2\mathrm{P}_{1/2} \rightarrow 2s^2 3s\, ^2\mathrm{S}_{1/2}$ ground state transition in boron atoms. Accuracy is increased by orders of magnitude for the stable isotopes $^{10,11}$B and the results are used to extract their difference in the mean-square charge radius $\langle r^2_\mathrm{c}\rangle^{11} - \langle r^2_\mathrm{c}\rangle^{10} = -0.49\,(12)\,\mathrm{fm}^2$. The result is qualitatively explained by a possible cluster structure of the boron nuclei and quantitatively used as a benchmark for new ab initio nuclear structure calculations using the no-core shell model and Green's function Monte Carlo approaches.

physics.atom-ph↗