Claudia Linnhoff-Popien

Claudia Linnhoff-Popien

Auto-generated profile, based on publicly available information

Claudia Linnhoff-Popien

Mobile and Distributed Systems Group LMU Munich Germany

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 September 2023
Verified
Conference Paper
Closed access
JSJonas Korbinian Stein
Jonas Korbinian Stein
ICIvo Christ
Ivo Christ
NKNicolas Kraus
Nicolas Kraus
MMMaximilian Balthasar Mansky
Maximilian Balthasar Mansky
RMRobert Müller
Robert Müller
CLClaudia Linnhoff-Popien
Claudia Linnhoff-Popien
As an application domain where the slightest qualitative improvements can yield immense value, finance is a promising candidate for early quantum advantage. Focusing on the rapidly advancing field of Quantum Natural Language Processing (QNLP), we explore the practical applicability of the two central approaches DisCoCat (Distributional Compositional Categorical) and Quantum-Enhanced Long Short-Term Memory (QLSTM) to the problem of sentiment analysis in finance. Utilizing a novel ChatGPT-based data generation approach, we conduct a case study with more than 1000 realistic sentences and find that QLSTMs can be trained substantially faster than DisCoCat while also achieving close to classical results for their available software implementations.

15 July 2023
Verified
Conference Paper
Open access
JSJonas Korbinian Stein
Jonas Korbinian Stein
FCFarbod Chamanian
Farbod Chamanian
MZMaximilian Zorn
Maximilian Zorn
JNJonas Nüßlein
Jonas Nüßlein
SZSebastian Zielinski
Sebastian Zielinski
CLClaudia Linnhoff-Popien
Claudia Linnhoff-Popien
Quantum computing provides powerful algorithmic tools that have been shown to outperform established classical solvers in specific optimization tasks. A core step in solving optimization problems with known quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) is the problem formulation. While quantum optimization has historically centered around Quadratic Unconstrained Optimization (QUBO) problems, recent studies show, that many combinatorial problems such as the TSP can be solved more efficiently in their native Polynomial Unconstrained Optimization (PUBO) forms. As many optimization problems in practice also contain continuous variables, our contribution investigates the performance of the QAOA in solving continuous optimization problems when using PUBO and QUBO formulations. Our extensive evaluation on suitable benchmark functions, shows that PUBO formulations generally yield better results, while requiring less qubits. As the multi-qubit interactions needed for the PUBO variant have to be decomposed using the hardware gates available, i.e., currently single- and two-qubit gates, the circuit depth of the PUBO approach outscales its QUBO alternative roughly linearly in the order of the objective function. However, incorporating the planned addition of native multi-qubit gates such as the global Mølmer-Sørenson gate, our experiments indicate that PUBO outperforms QUBO for higher order continuous optimization problems in general.

6 March 2020 in International Journal on Software Tools for Technology Transfer
Verified
Journal Article
Open access
PDF file
TGThomas Gabor
Thomas Gabor
ASAndreas Sedlmeier
Andreas Sedlmeier
TPThomy Phan
Thomy Phan
FRFabian Ritz
Fabian Ritz
MKMarie Kiermeier
Marie Kiermeier
CLClaudia Linnhoff-Popien
Claudia Linnhoff-Popien
Systems are becoming increasingly more adaptive, using techniques like machine learning to enhance their behavior on their own rather than only through human developers programming them. We analyze the impact the advent of these new techniques has on the discipline of rigorous software engineering, especially on the issue of quality assurance. To this end, we provide a general description of the processes related to machine learning and embed them into a formal framework for the analysis of adaptivity, recognizing that to test an adaptive system a new approach to adaptive testing is necessary. We introduce scenario coevolution as a design pattern describing how system and test can work as antagonists in the process of software evolution. While the general pattern applies to large-scale processes (including human developers further augmenting the system), we show all techniques on a smaller-scale example of an agent navigating a simple smart factory. We point out new aspects in software engineering for adaptive systems that may be tackled naturally using scenario coevolution. This work is a substantially extended take on Gabor et al. (International symposium on leveraging applications of formal methods, Springer, pp 137–154, 2018).

15 July 2023
Verified
Conference Paper
Open access
SZSebastian Zielinski
Sebastian Zielinski
JNJonas Nüßlein
Jonas Nüßlein
JSJonas Korbinian Stein
Jonas Korbinian Stein
TGThomas Gabor
Thomas Gabor
CLClaudia Linnhoff-Popien
Claudia Linnhoff-Popien
SFSebastian Feld
Sebastian Feld
To solve 3sat instances on quantum annealers they need to be transformed to an instance of Quadratic Unconstrained Binary Optimization (QUBO). When there are multiple transformations available, the question arises whether different transformations lead to differences in the obtained solution quality. Thus, in this paper we conduct an empirical benchmark study, in which we compare four structurally different QUBO transformations for the 3sat problem with regards to the solution quality on D-Wave's Advantage_system4.1. We show that the choice of QUBO transformation can significantly impact the number of correct solutions the quantum annealer returns. Furthermore, we show that the size of a QUBO instance (i.e., the dimension of the QUBO matrix) is not a sufficient predictor for solution quality, as larger QUBO instances may produce better results than smaller QUBO instances for the same problem. We also empirically show that the number of different quadratic values of a QUBO instance, combined with their range, can significantly impact the solution quality.

13 July 2025
Verified
Conference Paper
Open access
LSLeo Sünkel
Leo Sünkel
PAPhilipp Altmann
Philipp Altmann
MKMichael Kölle
Michael Kölle
GSGerhard Stenzel
Gerhard Stenzel
TGThomas Gabor
Thomas Gabor
CLClaudia Linnhoff-Popien
Claudia Linnhoff-Popien

13 July 2025
Verified
Conference Paper
Open access
MKMichael Kölle
Michael Kölle
TBTom Bintener
Tom Bintener
MZMaximilian Zorn
Maximilian Zorn
GSGerhard Stenzel
Gerhard Stenzel
LSLeo Sünkel
Leo Sünkel
CLClaudia Linnhoff-Popien
Claudia Linnhoff-Popien