Work

Universal Codes for Broadcast Systems with Physical Layer Security and Their Algorithmic Computability in Quantum Information Theory

Year: 2022
Type: dissertation
Abstract: When implementing communication protocols in the real world, the idealized conditions that are assumed at the theoretical level often do not hold. At the practical level, one is interested in controlling aspects of the communication that might be considered negligible in the mathematical modeling of the protocol. This effect often renders a large class of protocols with such assumptions unreliable in practice. In this thesis, we attempt to address practical questions that undermine known communication protocols, by either re-modeling the protocols in such a way that they would be robust against practical uncertainties, or demonstrating that they face logical or feasibility problems prior to their implementation. There are two categories of such questions that are addressed here. The first one concerns the uncertainty in the communication system parameters and in particular, the communicating channel. This affects security as well as reliability measures. Reliable transmission of messages in protocols that assume the state of the channel to be perfectly known depends on this assumption. On the other hand, secure transmission of messages, depends on the powers ascribed to the eavesdropping and jamming parties. In quantum information theory, these powers are significantly higher. We start by giving results that have destructive implications for some established protocols in quantum key distribution in presence of a quantum jammer. We then offer a remodeling of communication protocols, that makes them robust to attacks at physical layer, as well as robust to system parameter uncertainties. Of particular interest are integrated services that are possible in quantum communication. Time-sharing between known coding strategies to perform multiple tasks is often sub-optimal. We derive universal codes that achieve full capacity regions of the quantum channel for communicating quantum, public and private messages. The notion of privacy or security in this work is an information theoretic one, that is different from its cryptographic counterpart. Here, we consider strategies that are implemented at the physical layer and are therefore only limited by the physical properties of the system. Given that our coding strategies are as mentioned, robust to uncertainties in the physical properties of the system, they offer a significant advantage to cryptographic methods in practice. The second category of practical questions concerns computability of the known protocols. Here, we specifically address the algorithmic computability of capacity functions. When capacity theorems are theoretically derived, a legitimate question is whether or not these functions can be fed to a machine via an algorithm. Asked differently, are optimal protocols that achieve capacities of channels for different communication tasks, implementable through algorithms? The value of these functions is derived from achievability and converse theorems that ideally establish converging computable sequences from below and above the capacity at any given point. A more relaxed requirement is the question of decidability of such problems. We end this thesis by giving examples of protocols that cannot in general be turned into algorithms that can be computed by Turing machines. We further show that the bounds for capacities achieved by these protocols are in general undecidable.
Authors: Saeedinaeeni, Sajad, Boche, Holger 1966-, Technische Universität München
Language: English
Open Access status: green
OpenAlex ID: W7025250268
Cites: 85
Cited by:
Related to: 10