@article{KruegerMauerer, author = {Kr{\"u}ger, Tom and Mauerer, Wolfgang}, title = {Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation}, series = {Quantum}, volume = {9}, journal = {Quantum}, publisher = {Verein zur F{\"o}rderung des Open Access Publizierens in den Quantenwissenschaften}, doi = {10.22331/q-2025-11-06-1903}, pages = {32}, abstract = {The Quantum Approximate Optimisation Algorithm (QAOA) is a widely studied quantum-classical iterative heuristic for combinatorial optimisation. While QAOA targets problems in complexity class NP, the classical optimisation procedure required in every iteration is itself known to be NP-hard. Still, advantage over classical approaches is suspected for certain scenarios, but nature and origin of its computational power are not yet satisfactorily understood. By introducing means of efficiently and accurately approximating the QAOA optimisation landscape from solution space structures, we derive a new algorithmic variant of unit-depth QAOA for two-level Hamiltonians (including all problems in NP): Instead of performing an iterative quantum-classical computation for each input instance, our non-iterative method is based on a quantum circuit that is instance-independent, but problem-specific. It matches or outperforms unit-depth QAOA for key combinatorial problems, despite reduced computational effort. Our approach is based on proving a long-standing conjecture regarding instance-independent structures in QAOA. By ensuring generality, we link existing empirical observations on QAOA parameter clustering to established approaches in theoretical computer science, and provide a sound foundation for understanding the link between structural properties of solution spaces and quantum optimisation.}, language = {de} } @unpublished{SchmidbauerLobeSchaeferetal., author = {Schmidbauer, Lukas and Lobe, Elisabeth and Sch{\"a}fer, Ina and Mauerer, Wolfgang}, title = {It's Quick to be Square: Fast Quadratisation for Quantum Toolchains}, abstract = {Many of the envisioned use-cases for quantum computers involve optimisation processes. While there are many algorithmic primitives to perform the required calculations, all eventually lead to quantum gates operating on quantum bits, with an order as determined by the structure of the objective function and the properties of target hardware. When the structure of the problem representation is not aligned with structure and boundary conditions of the executing hardware, various overheads degrading the computation may arise, possibly negating any possible quantum advantage. Therefore, automatic transformations of problem representations play an important role in quantum computing when descriptions (semi-)targeted at humans must be cast into forms that can be executed on quantum computers. Mathematically equivalent formulations are known to result in substantially different non-functional properties depending on hardware, algorithm and detail properties of the problem. Given the current state of noisy intermediate-scale quantum (NISQ) hardware, these effects are considerably more pronounced than in classical computing. Likewise, efficiency of the transformation itself is relevant because possible quantum advantage may easily be eradicated by the overhead of transforming between representations. In this paper, we consider a specific class of higher-level representations, i.e. polynomial unconstrained binary optimisation problems, and devise novel automatic transformation mechanisms into widely used quadratic unconstrained binary optimisation problems that substantially improve efficiency and versatility over the state of the art. We also identify what influence factors of lower-level details can be abstracted away in the transformation process, and which details must be made available to higher-level abstractions.}, language = {de} } @misc{MintelRamsauerLohmannetal., author = {Mintel, Mario and Ramsauer, Ralf and Lohmann, Daniel and Scherzinger, Stefanie and Mauerer, Wolfgang}, title = {Fork {\`a} la carte f{\"u}r In-Memory-Datenbanken}, series = {Fr{\"u}hjahrstreffen der Fachgruppen Betriebssysteme, Hamburg, 17. M{\"a}rz 2022}, journal = {Fr{\"u}hjahrstreffen der Fachgruppen Betriebssysteme, Hamburg, 17. M{\"a}rz 2022}, language = {de} } @book{Mauerer, author = {Mauerer, Wolfgang}, title = {Textverarbeitung mit LATEX 2e [2 epsilon] unter UNIX}, publisher = {Hanser}, address = {M{\"u}nchen}, isbn = {9783446189096}, language = {de} } @unpublished{OberthuerMauerer, author = {Oberth{\"u}r, S. and Mauerer, Wolfgang}, title = {Sicherheit von Android-Systemen}, language = {de} } @inproceedings{Mauerer, author = {Mauerer, Wolfgang}, title = {A Virtual Computing Platform for the Internet of Things}, series = {Embedded Linux Conference (San Diego), 2016}, booktitle = {Embedded Linux Conference (San Diego), 2016}, language = {de} } @book{Mauerer, author = {Mauerer, Wolfgang}, title = {Linux-Kernelarchitektur : Konzepte Strukturen und Algorithmen von Kernel 2.6}, publisher = {Hanser}, address = {M{\"u}nchen}, isbn = {9783446225664}, language = {de} } @misc{RamsauerKiszkaLohmannetal., author = {Ramsauer, Ralf and Kiszka, Jan and Lohmann, Daniel and Mauerer, Wolfgang}, title = {Implementierung gemischt kritischer Systeme durch statische Hardwarepartitionierung}, series = {Fr{\"u}hjahrstreffen der Fachgruppen Betriebssysteme, Hannover, 2. M{\"a}rz 2018}, journal = {Fr{\"u}hjahrstreffen der Fachgruppen Betriebssysteme, Hannover, 2. M{\"a}rz 2018}, language = {de} } @article{MauererScherzinger, author = {Mauerer, Wolfgang and Scherzinger, Stefanie}, title = {Digitale Forschungswerkzeuge : Nachhaltigkeit f{\"u}r Software und Daten}, series = {Forschung \& Lehre (Forschung und Lehre)}, volume = {28}, journal = {Forschung \& Lehre (Forschung und Lehre)}, number = {10}, publisher = {Zentrum f{\"u}r Wissenschaftsmanagement e.V. (ZWM)
}, organization = {Deutscher Hochschullehrerverband}, pages = {816 -- 817}, abstract = {Die wissenschaftliche Reproduktionskrise hat den Blick auf digitale Forschungswerkzeuge intensiviert. Auch wenn der Mehraufwand f{\"u}r Reproduzierbarkeit und Zug{\"a}nglichkeit zunehmend anerkannt wird, existieren noch Defizite in der Umsetzung, wenn es darum geht, die Datenbasis und Forschungswerkzeuge verf{\"u}gbar zu machen}, language = {de} } @inproceedings{MauererRamsauerLucasetal., author = {Mauerer, Wolfgang and Ramsauer, Ralf and Lucas, Edson R. F. and Scherzinger, Stefanie}, title = {Silentium! Run-Analyse-Eradicate the Noise out of the DB/OS Stack}, series = {Datenbanksysteme f{\"u}r Business, Technologie und Web (BTW 2021): 13.-17. September 2021, Dresden, Deutschland}, booktitle = {Datenbanksysteme f{\"u}r Business, Technologie und Web (BTW 2021): 13.-17. September 2021, Dresden, Deutschland}, publisher = {Gesellschaft f{\"u}r Informatik}, doi = {10.18420/btw2021-21}, pages = {397 -- 421}, abstract = {When multiple tenants compete for resources, database performance tends to suffer. Yet there are scenarios where guaranteed sub-millisecond latencies are crucial, such as in real-time data processing, IoT devices, or when operating in safety-critical environments. In this paper, we study how to make query latencies deterministic in the face of noise (whether caused by other tenants or unrelated operating system tasks). We perform controlled experiments with an in-memory database engine in a multi-tenant setting, where we successively eradicate noisy interference from within the system software stack, to the point where the engine runs close to bare-metal on the underlying hardware. We show that we can achieve query latencies comparable to the database engine running as the sole tenant, but without noticeably impacting the workload of competing tenants. We discuss these results in the context of ongoing efforts to build custom operating systems for database workloads, and point out that for certain use cases, the margin for improvement is rather narrow. In fact, for scenarios like ours, existing operating systems might just be good enough, provided that they are expertly configured. We then critically discuss these findings in the light of a broader family of database systems (e.g., including disk-based), and how to extend the approach of this paper accordingly. Low-latency databases; tail latency; real-time databases; bounded-time query processing; DB-OS co-engineering}, language = {de} }