3 papers
quant-ph2026
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…
cs.IT2025
Continuously Ordered Hierarchies of Algorithmic Information in Digital Twinning and Signal Processing
Yannik N. Böck, Holger Boche, Frank H. P. Fitzek
We consider a fractional-calculus example of a continuous hierarchy of algorithmic information in the context of its potential applications in digital twinning. Digital twinning re…
cs.IT2024
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…