Boche_Holger

Theoretical Information Technology

Technical University of Munich

TUM School of Computation, Information and Technology

Theresienstrasse 90

80333 Munich

boche[at]tum.de

Research Website

Description

Research focus: quantum communication, quantum information theory, analog quantum computing, Turing quantum computing


At MCQST, we are interested in questions of quantum communication and quantum information theory, and are especially interested in models for analog quantum computing and Turing quantum computing.

In quantum communication and quantum information theory, we focus on:

  • the characterization of channel capacities for transmission of quantum information with and without attackers
  • the role of entanglement for classical and quantum communication
  • finite block length performance for communication protocols
  • resource theory for quantum communication networks
  • computability of capacity formulas


In the areas of analog quantum computing and Turing quantum computing, we focus on:

  • analog quantum computer models
  • quantum Turing machines
  • complexity blow-up behavior of Turing machines
  • advantages of analog quantum computers for physical problems
  • advantages of analog quantum computers for the calculation of performance parameters for quantum communication systems

Publications

Computability of Optimizers

Y. Lee, H. Boche, G. Kutyniok

Ieee Transactions on Information Theory 70 (4), 2967-2983 (2024).

Show Abstract

Optimization problems are a staple of today's scientific and technical landscape. However, at present, solvers of such problems are almost exclusively run on digital hardware. Using Turing machines as a mathematical model for any type of digital hardware, in this paper, we analyze fundamental limitations of this conceptual approach of solving optimization problems. Since in most applications, the optimizer itself is of significantly more interest than the optimal value of the corresponding function, we will focus on computability of the optimizer. In fact, we will show that in various situations the optimizer is unattainable on Turing machines and consequently on digital computers. Moreover, even worse, there does not exist a Turing machine, which approximates the optimizer itself up to a certain constant error. We prove such results for a variety of well-known problems from very different areas, including artificial intelligence, financial mathematics, and information theory, often deriving the even stronger result that such problems are not Banach-Mazur computable, also not even in an approximate sense.

DOI: 10.1109/tit.2023.3347071

On the Need of Neuromorphic Twins to Detect Denial-of-Service Attacks on Communication Networks

H. Boche, R. F. Schaefer, H. V. Poor, F. H. P. Fitzek

Ieee-Acm Transactions on Networking 13 (2024).

Show Abstract

As we become more and more dependent on communication technologies, resilience against any attacks on communication networks is important to guarantee the digital sovereignty of our society. New developments of communication networks approach the problem of resilience through in-network computing approaches for higher protocol layers, while the physical layer remains an open problem. This is particularly true for wireless communication systems which are inherently vulnerable to adversarial attacks due to the open nature of the wireless medium. In denial-of-service (DoS) attacks, an active adversary is able to completely disrupt the communication and it has been shown that Turing machines are incapable of detecting such attacks. As Turing machines provide the fundamental limits of digital information processing and therewith of digital twins, this implies that even the most powerful digital twins that preserve all information of the physical network error-free are not capable of detecting such attacks. This stimulates the question of how powerful the information processing hardware must be to enable the detection of DoS attacks. Therefore, in this paper the need of neuromorphic twins is advocated and by the use of Blum-Shub-Smale machines a first implementation that enables the detection of DoS attacks is shown. This result holds for both cases of with and without constraints on the input and jamming sequences of the adversary.

DOI: 10.1109/tnet.2024.3369018

Message Transmission and Common Randomness Generation Over MIMO Slow Fading Channels With Arbitrary Channel State Distribution

R. Ezzine, M. Wiese, C. Deppe, H. Boche

Ieee Transactions on Information Theory 70 (1), 256-281 (2024).

Show Abstract

We investigate the problem of message transmission and the problem of common randomness (CR) generation over single-user multiple-input multiple-output (MIMO) slow fading channels with average input power constraint, additive white Gaussian noise (AWGN), arbitrary state distribution and with complete channel state information available at the receiver side (CSIR). We derive a lower and an upper bound on the outage transmission capacity of MIMO slow fading channels for arbitrary state distribution and show that the bounds coincide except possibly at points of discontinuity of the outage transmission capacity, of which there are, at most, countably many. Such discontinuity issues might occur because the channel state distribution is arbitrary. We also establish the capacity of a specific compound MIMO Gaussian channel in order to prove the lower bound on the outage transmission capacity. Furthermore, we define the outage CR capacity for a two-source model with unidirectional communication over a MIMO slow fading channel with arbitrary state distribution and establish a lower and an upper bound on it using our bounds on the outage transmission capacity of the MIMO slow fading channel.

DOI: 10.1109/tit.2023.3315377

Accept privacy?

Scroll to top