1 citations · 3 across the 4 of their papers we have counts for
4 papers
Feynman Meets Turing: The Curse of Quantum Universality
Yannik N. Böck, Holger Boche, Frank H. P. Fitzek
We consider a formal model of quantum circuit description languages (QCDLs) in which semantically meaningful programs correspond to computable unitary matrices. We show that any se…
Neuromorphic Twins for Networked Control and Decision-Making
Holger Boche, Yannik N. Böck, Christian Deppe +1
We consider the problem of remotely tracking the state of and unstable linear time-invariant plant by means of data transmitted through a noisy communication channel from an algori…
On the Need of Analog Signals and Systems for Digital-Twin Representations
Holger Boche, Ullrich J. Mönich, Yannik N. Böck +1
We consider the task of converting different digital descriptions of analog bandlimited signals and systems into each other, with a rigorous application of mathematical computabili…
On Effective Convergence in Fekete's Lemma and Related Combinatorial Problems in Information Theory
Holger Boche, Yannik Böck, Christian Deppe
Fekete's lemma is a well known result from combinatorial mathematics that shows the existence of a limit value related to super- and subadditive sequences of real numbers. In this…