This paper considers the source coding problem with broadcast side information. The side information is sent to two receivers through a noisy broadcast channel. We provide an outer bound of the rate--distortion--bandwidth (RDB) quadruples and achievable RDB quadruples when the helper uses a separation-based scheme. Some special cases with full characterization are also provided. We then compare the separation-based scheme with the uncoded scheme in the quadratic Gaussian case.

We present an information-theoretic framework for secure storage and message identification utilizing fully quantum physically unclonable functions (QPUFs). Extending prior models rooted in classical and hybrid classical-quantum PUFs, we propose a fully quantum setting that enables robust identification protocols in the presence of a powerful quantum wiretapper holding correlated side information. We derive achievable second-order identification rates under stringent privacy leakage constraints and show that secure identification is feasible whenever a positive secret key rate can be extracted from the QPUF output—establishing a quantum analogue of the classical dichotomy theorem. Furthermore, we demonstrate that augmenting the system with an auxiliary public quantum source enhances identification capacity without increasing privacy leakage. Our results provide a rigorous theoretical foundation for quantum-secure identification and storage, with implications for next-generation communication systems and adversarial environments requiring low-latency, energy-efficient quantum-secure storage protocols.

This paper assesses the impact on the performance that information-theoretic physical layer security (IT-PLS) introduces when integrated into a 5G New Radio (NR) system. For this, we implement a wiretap code for IT-PLS based on a modular coding scheme that uses a universal-hash function in its security layer. The main advantage of this approach lies in its flexible integration into the lower layers of the 5G NR protocol stack without affecting the communication's reliability. Specifically, we use IT-PLS to secure the transmission of downlink control information by integrating an extra pre-coding security layer as part of the physical downlink control channel (PDCCH) procedures, thus not requiring any change of the 3GPP 38 series standard. We conduct experiments using a real-time open-source 5G NR standalone implementation and use software-defined radios for over-the-air transmissions in a controlled laboratory environment. The overhead added by IT-PLS is determined in terms of the latency introduced into the system, which is measured at the physical layer for an end-to-end (E2E) connection between the gNB and the user equipment.

The expansion of Fiber-To-The-Home (FTTH) networks creates high costs due to expensive excavation procedures. Optimizing the planning process and minimizing the cost of the earth excavation work therefore lead to large savings. Mathematically, the FTTH network problem can be described as a minimum Steiner Tree problem. Even though the Steiner Tree problem has already been investigated intensively in the last decades, it might be further optimized with the help of new computing paradigms and emerging approaches. This work studies upcoming technologies, such as Quantum Annealing, Simulated Annealing and nature-inspired methods like Evolutionary Algorithms or slime-mold-based optimization. Additionally, we investigate partitioning and simplifying methods. Evaluated on several real-life problem instances, we could outperform a traditional, widely-used baseline (NetworkX Approximate Solver) on most of the domains. Prior partitioning of the initial graph and the presented slime-mold-based approach were especially valuable for a cost-efficient approximation. Quantum Annealing seems promising, but was limited by the number of available qubits.

With the increasing speed in the development of quantum computers, secure communication is at risk. A promising candidate to replace existing cryptographic patterns with quantum-secure variants is Post-Quantum Cryptography (PQC). This paper presents an empirical analysis of how Post-Quantum Cryptography affects real-world performance compared to classical cryptography. Therefore we analyze the Transport Layer Security (TLS) handshake performance showing that Post-Quantum Cryptography can be as fast or even faster than classical cryptography, depending on the specific encryption and signature algorithms used.

The growing demand in broadband and data networks is a tremendous driver for innovation and investment. Efficient usage of resources and reliable operations are key objectives for network management. Optimization plays a pivotal role to make the best decisions in limited time. To tackle such difficult and elaborate (typically NP-hard) computational problems the latest developments in Quantum Computing are coming into focus. Successes with models for road traffic, logistics or financial industry have already demonstrated the applicability of these new methods to real-world problems. In this paper we formulate a model for resource assignment for transporting data over networks. For applicability in existing network management environments the model was designed on top of Segment Routing (SR) concepts. The validity of the model is proven for different cost and reliability targets. Based on a Digital Annealer (DA) as quantum-inspired hardware and an appropriate decomposition approach realistic data sets of a tier-1 provider can be processed. The quality of the results is comparable to classical optimization methods while the new approaches outperform those in computation time and have potential for a higher number of demands. An end-to-end comparison of quadratic model creation and solving on large data sets versus a processing as linear integer problem is presented. This shows that quantum approaches and algorithms are not only a preparation for a more distant future of fully functional quantum computers but can generate business advantages even today.

Mobile autonomous transport systems are a crucial part of flexible factory logistics enabling an adaptable industrial production. Whereas connectivity of these mobile robots is still mostly covered through Wifi, applicators suffer from interferences and unreliableness due to the harsh environmental conditions. We present a case study using 4G campus networks applying network slicing technology and edge computing in order to realize a distributed control scenario. Control algorithms are offloaded to the edge following a navigation as a service approach. Basic safety functions remain onboard while self-localization and mapping as well as motion planning run on either a factory edge, a nearby edge or on a public cloud. We present an evaluation of the overall architecture and focus on effects of offloading control functions towards the edge. Finally, we provide an outlook towards the usage of 5G.