TY - CHAP A1 - Schönberger, Manuel A1 - Trummer, Immanuel A1 - Mauerer, Wolfgang T1 - Large-Scale Multiple Query Optimisation with Incremental Quantum(-Inspired) Annealing T2 - Proceedings of the ACM on Management of Data N2 - Multiple-query optimization (MQO) seeks to reduce redundant work across query batches. While MQO offers opportunities for dramatic performance improvements, the problem is NP-hard, limiting the sizes of problems that can be solved on generic hardware. We propose to leverage specialized hardware solvers for optimization, such as Fujitsu's Digital Annealer (DA), to scale up MQO to problem sizes formerly out of reach. We present a novel incremental processing approach that combines classical computation with DA acceleration. By efficiently partitioning MQO problems into sets of partial problems, and by applying a dynamic search steering strategy that reapplies initially discarded information to incrementally process individual problems, our method overcomes capacity limitations, and scales to extremely large MQO instances (up to νm1000 queries). A thorough and comprehensive empirical evaluation finds our method substantially outperforms existing approaches. Our generalisable framework lays the ground for other database use-cases on quantum-inspired hardware, and bridges towards future quantum accelerators. Y1 - 2025 U6 - https://doi.org/10.1145/3749171 VL - 3 IS - 4 PB - ACM ER - TY - INPR A1 - Krüger, Tom A1 - Mauerer, Wolfgang T1 - Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation N2 - 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: 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. Y1 - 2024 N1 - er Aufsatz wurde peer-reviewed veröffentlicht und ist ebenfalls in diesem Repositorium verzeichnet unter: https://opus4.kobv.de/opus4-oth-regensburg/frontdoor/index/index/start/3/rows/10/sortfield/score/sortorder/desc/searchtype/simple/query/out+of+the+loop/docId/8843 ER - TY - CHAP A1 - Mauerer, Wolfgang ED - Ali, Shaukat ED - Barzen, Johanna ED - Delgado, Andrea ED - Müller, Hausi A. ED - Murillo, Juan Manuel T1 - Quantum Software = Quantum minus Software? T2 - Dagstuhl Reports : Quantum Software Engineering : Report from Dagsthul Seminar 24512 N2 - The Dagstuhl Seminar 24512 on "Quantum Software Engineering" was held from December 15 to 20, 2024. It brought together 26 participants from industry and academia from 13 different countries, including senior and junior researchers as well as practitioners in the field of Quantum Software Engineering. The aim of the seminar was to advance software engineering methods and tools for the engineering of hybrid quantum systems by promoting personal interaction and open discussion among researchers who are already working in this emerging area of knowledge. The first day of the seminar was devoted to the topic "When software engineering meets quantum mechanics", while the second day focused on "Quantum software engineering and its challenges." During both days, 16 invited presentations were given. The rest of the seminar was organized into three working groups to address the topics "Quantum Software Design, Modelling and Architecturing", "Adaptive Hybrid Quantum Systems", and "Quantum Software Quality Assurance". The seminar was a very fruitful experience for all participants both in terms of scientific outcomes and in terms of the personal relationships that were generated to jointly address future experiences. Y1 - 2025 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0030-drops-230469 VL - 14 IS - 12 SP - 73 EP - 74 PB - Dagstuhl Publishing ER - TY - GEN A1 - Mauerer, Wolfgang A1 - Joblin, Mitchell A1 - Tamburri, Damian Andrew A1 - Paradis, Carlos A1 - Kazman, Rick A1 - Apel, Sven T1 - In Search of Socio-Technical Congruence: A Large-Scale Longitudinal Study [Data set] Y1 - 2021 U6 - https://doi.org/10.5281/zenodo.4766388 N1 - Archive of the accompanying website including all datasets for "In Search of Socio-Technical Congruence: A Large-Scale Longitudinal Study" (IEEE Transactions on Software Engineering): https://doi.org/10.1109/TSE.2021.3082074 ER - TY - GEN A1 - Mauerer, Wolfgang A1 - Scherzinger, Stefanie T1 - Nullius in Verba - Reproducibility Tutorial [Data set] N2 - Reproduction package (docker image) for the ICDE 2021 tutorial "Nullius in Verba". Y1 - 2021 U6 - https://doi.org/10.5281/zenodo.4730023 N1 - In Verbindung mit dem Konferenzbeitrag: Nullius in Verba: Reproducibility for Database Systems Research, Revisited - https://doi.org/10.1109/ICDE51399.2021.00270 ER - TY - GEN A1 - Schmidbauer, Lukas A1 - Lobe, Elisabeth A1 - Schäfer, Ina A1 - Mauerer, Wolfgang T1 - It's Quick to be Square: Fast Quadratisation for Quantum Toolchains [Data set] N2 - 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 to degrade 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 hardware (NISQ), 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 (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. Y1 - 2024 U6 - https://doi.org/10.5281/zenodo.14245588 N1 - Paper: 10.48550/arXiv.2411.19934 Software: https://github.com/lfd/Fast_Quadratisation ER - TY - GEN A1 - Schmidbauer, Lukas A1 - Mauerer, Wolfgang T1 - SAT Strikes Back: Parameter and Path Relations in Quantum Toolchains [Data set] N2 - In the foreseeable future, toolchains for quantum computing should offer automatic means of transforming a high level problem formulation down to a hardware executable form. Thereby, it is crucial to find (multiple) transformation paths that are optimised for (hardware specific) metrics. We zoom into this pictured tree of transformations by focussing on k-SAT instances as input and their transformation to QUBO, while considering structure and characteristic metrics of input, intermediate and output representations. Our results can be used to rate valid paths of transformation in advance—also in automated (quantum) toolchains. We support the automation aspect by considering stability and therefore predictability of free parameters and transformation paths. Moreover, our findings can be used in the manifesting era of error correction (since considering structure in a high abstraction layer can benefit error correcting codes in layers below). We also show that current research is closely linked to quadratisation techniques and their mathematical foundation. Y1 - 2025 U6 - https://doi.org/10.5281/zenodo.15464391 N1 - Repositoriy URL: https://github.com/lfd/QSW25-SAT-Strikes-Back ER - TY - CHAP A1 - Ramsauer, Ralf A1 - Lohmann, Daniel A1 - Mauerer, Wolfgang T1 - Reliable Pre-Integration Tracking of Commits on Mailing Lists T2 - Invited Talk at Safety Summit at Embedded Linux Conference Europe (ELCE18) Y1 - 2018 CY - Edinburgh, Scotland ER - TY - INPR A1 - Eichenseher, Vincent A1 - Franz, Maja A1 - Wolff, Christian A1 - Mauerer, Wolfgang T1 - Pattern or Not? QAOA Parameter Heuristics and Potentials of Parsimony N2 - Structured variational quantum algorithms such as the Quantum Approximate Optimisation Algorithm (QAOA) have emerged as leading candidates for exploiting advantages of near-term quantum hardware. They interlace classical computation, in particular optimisation of variational parameters, with quantum-specific routines, and combine problem-specific advantages -- sometimes even provable -- with adaptability to the constraints of noisy, intermediate-scale quantum (NISQ) devices. While circuit depth can be parametrically increased and is known to improve performance in an ideal (noiseless) setting, on realistic hardware greater depth exacerbates noise: The overall quality of results depends critically on both, variational parameters and circuit depth. Although identifying optimal parameters is NP-hard, prior work has suggested that they may exhibit regular, predictable patterns for increasingly deep circuits and depending on the studied class of problems. In this work, we systematically investigate the role of classical parameters in QAOA performance through extensive numerical simulations and suggest a simple, yet effective heuristic scheme to find good parameters for low-depth circuits. Our results demonstrate that: (i) optimal parameters often deviate substantially from expected patterns; (ii) QAOA performance becomes progressively less sensitive to specific parameter choices as depth increases; and (iii) iterative component-wise fixing performs on par with, and at shallow depth may even outperform, several established parameter-selection strategies. We identify conditions under which structured parameter patterns emerge, and when deviations from the patterns warrant further consideration. These insights for low-depth circuits may inform more robust pathways to harnessing QAOA in realistic quantum compute scenarios. Y1 - 2026 U6 - https://doi.org/10.48550/arXiv.2510.08153 ER - TY - INPR A1 - Gierisch, Vincent A1 - Mauerer, Wolfgang T1 - QEF: Reproducible and Exploratory Quantum Software Experiments N2 - Commercially available Noisy Intermediate-Scale Quantum (NISQ) devices now make small hybrid quantum-classical experiments practical, but many tools hide configuration or demand ad-hoc scripting. We introduce the Quantum Experiment Framework (QEF): A lightweight framework designed to support the systematic, hypothesis-driven study of quantum algorithms. Unlike many existing approaches, QEF emphasises iterative, exploratory analysis of evolving experimental strategies rather than exhaustive empirical evaluation of fixed algorithms using predefined quality metrics. The framework's design is informed by a comprehensive review of the literature, identifying principal parameters and measurement practices currently reported in the field. QEF captures all key aspects of quantum software and algorithm experiments through a concise specification that expands into a Cartesian product of variants for controlled large-scale parameter sweeps. This design enables rigorous and systematic evaluation, as well as precise reproducibility. Large sweeps are automatically partitioned into asynchronous jobs across simulators or cloud hardware, and ascertain full hyper-parameter traceability. QEF supports parameter reuse to improve overall experiment runtimes, and collects all metrics and metadata into a form that can be conveniently explored with standard statistical and visualisation software. By combining reproducibility and scalability while avoiding the complexities of full workflow engines, QEF seeks to lower the practical barriers to empirical research on quantum algorithms, whether these are designed for current NISQ devices or future error-corrected quantum systems. Y1 - 2026 U6 - https://doi.org/10.48550/arXiv.2511.04563 ER - TY - CHAP A1 - Schönberger, Manuel A1 - Trummer, Immanuel A1 - Mauerer, Wolfgang T1 - Hybrid Mixed Integer Linear Programming for Large-Scale Join Order Optimisation T2 - Proceedings of the VLDB Endowment N2 - Finding optimal join orders is among the most crucial steps to be performed by query optimisers. Though extensively studied in data management research, the problem remains far from solved: While query optimisers rely on exhaustive search methods to determine ideal solutions for small problems, such methods reach their limits once queries grow in size. Yet, large queries become increasingly common in real-world scenarios, and require suitable methods to generate efficient execution plans. While a variety of heuristics have been proposed for large-scale query optimisation, they suffer from degrading solution quality as queries grow in size, or feature highly sub-optimal worst-case behavior, as we will show. We propose a novel method based on the paradigm of mixed integer linear programming (MILP): By deriving a novel MILP model capable of optimising arbitrary bushy tree structures, we address the limitations of existing MILP methods for join ordering, and can rely on highly optimised MILP solvers to derive efficient tree structures that elude competing methods. To ensure optimisation efficiency, we embed our MILP method into a hybrid framework, which applies MILP solvers precisely where they provide the greatest advantage over competitors, while relying on more efficient methods for less complex optimisation steps. Thereby, our approach gracefully scales to extremely large query sizes joining up to 100 relations, and consistently achieves the most robust plan quality among a large variety of competing join ordering methods. Y1 - 2026 U6 - https://doi.org/10.14778/3778092.3778097 VL - 19 IS - 3 SP - 348 EP - 360 PB - VLDB Endowment ER - TY - JOUR A1 - Schmidbauer, Lukas A1 - Lobe, Elisabeth A1 - Schaefer, Ina A1 - Mauerer, Wolfgang T1 - It’s Quick to be Square: Fast Quadratisation for Quantum Toolchains JF - ACM Transactions on Quantum Computing N2 - 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, that is, PUBOs, and devise novel automatic transformation mechanisms into widely used QUBOs that substantially improve efficiency and versatility over the state of the art. In addition, we conduct a comprehensive investigation of industry-relevant problem formulations and their conversion into a quantum-specific representation, identifying significant obstacles in scaling behaviour and demonstrating how these can be circumvented. KW - Algorithmic optimisation KW - Graphs KW - Performance KW - Pseudo Boolean Function Y1 - 2026 U6 - https://doi.org/10.1145/3800943 N1 - Preprint ebenfalls auf OPUS veröffentlicht: https://opus4.kobv.de/opus4-oth-regensburg/frontdoor/index/index/docId/7937 VL - 7 IS - 2 PB - ACM ER - TY - INPR A1 - Ramsauer, Ralf A1 - Mauerer, Wolfgang T1 - Towards System-Level Quantum-Accelerator Integration N2 - Quantum computers are often treated as experimental add-ons that are loosely coupled to classical infrastructure through high-level interpreted languages and cloud-like orchestration. However, future deployments in both, high-performance computing (HPC) and embedded environments, will demand tighter integration for lower latencies, stronger determinism, and architectural consistency, as well as to implement error correction and other tasks that require tight quantum-classical interaction as generically as possible. We propose a vertically integrated quantum systems architecture that treats quantum accelerators and processing units as peripheral system components. A central element is the Quantum Abstraction Layer (QAL) at operating system kernel level. It aims at real-time, low-latency, and high-throughput interaction between quantum and classical resources, as well as robust low-level quantum operations scheduling and generic resource management. It can serve as blueprint for orchestration of low-level computational components "around" a QPU (and inside a quantum computer), and across different modalities. We present first results towards such an integrated architecture, including a virtual QPU model based on QEMU. The architecture is validated through functional emulation on three base architectures (x86_64, ARM64, and RISC-V), and timing-accurate FPGA-based simulations. This allows for a realistic evaluation of hybrid system performance and quantum advantage scenarios. Our work lays the ground for a system-level co-design methodology tailored for the next generation of quantum-classical computing. Y1 - 2025 U6 - https://doi.org/10.48550/arXiv.2507.19212 ER - TY - CHAP A1 - Ramsauer, Ralf A1 - Bielmeier, Benno A1 - Mauerer, Wolfgang T1 - Towards Real-World System-Level Integration of Quantum Accelerators: A Hardware/Software Co-Design Approach T2 - INFORMATIK; Lecture Notes in Informatics (LNI); GI Quantum Computing Workshop. Potsdam. 16.–19. September 2025 N2 - This work-in-progress explores architectural and systemic foundations for integrating quantum accelerators into heterogeneous computing environments. We propose and implement a modular architecture where Quantum Processing Units (QPUs) operate as peripheral devices, supporting pulse-level control interfaces and high-level circuit execution offloading, while internally managing compilation, transpilation, and scheduling. To enable efficient quantum-classical orchestration, we introduce a Quantum Abstraction Layer (QAL) at the operating system level to enable seamless communication, resource management, and integration with existing software frameworks. Our two-step design approach begins with validating the architecture through simulations in virtualised environments. We then implement an FPGA-based surrogate supporting both result- and timing-accurate modes, enabling full-stack emulation and performance evaluation in the absence of physical quantum hardware. This platform supports extensible and rapid prototyping, Hardware/Software Co-Design, and allows for investigations on the practical quantum advantage under realistic system-level constraints of various use cases. We aim for applicability by hardware vendors, facilitating early development even before physical quantum processors are available. Y1 - 2025 U6 - https://doi.org/10.18420/inf2025_158 SP - 1761 EP - 1765 PB - Gesellschaft für Informatik e.V. ER - TY - INPR A1 - Schmidbauer, Lukas A1 - Lobe, Elisabeth A1 - Schäfer, Ina A1 - Mauerer, Wolfgang T1 - It's Quick to be Square: Fast Quadratisation for Quantum Toolchains N2 - 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. Y1 - 2024 N1 - Der Aufsatz wurde peer-reviewed veröffentlicht und ist ebenfalls in diesem Repositorium verzeichnet unter: https://opus4.kobv.de/opus4-oth-regensburg/frontdoor/index/index/docId/9006 ER - TY - INPR A1 - Höß, Nicole A1 - Paradis, Carlos A1 - Kazman, Rick A1 - Mauerer, Wolfgang T1 - Oops!... I did it again. Conclusion (In-)Stability in Quantitative Empirical Software Engineering: A Large-Scale Analysis N2 - Context: Mining software repositories is a popular means to gain insights into a software project's evolution, monitor project health, support decisions and derive best practices. Tools supporting the mining process are commonly applied by researchers and practitioners, but their limitations and agreement are often not well understood. Objective: This study investigates some threats to validity in complex tool pipelines for evolutionary software analyses and evaluates the tools' agreement in terms of data, study outcomes and conclusions for the same research questions. Method: We conduct a lightweight literature review to select three studies on collaboration and coordination, software maintenance and software quality from high-ranked venues, which we formally replicate with four independent, systematically selected mining tools to quantitatively and qualitatively compare the extracted data, analysis results and conclusions. Results: We find that numerous technical details in tool design and implementation accumulate along the complex mining pipelines and can cause substantial differences in the extracted baseline data, its derivatives, subsequent results of statistical analyses and, under specific circumstances, conclusions. Conclusions: Users must carefully choose tools and evaluate their limitations to assess the scope of validity in an adequate way. Reusing tools is recommended. Researchers and tool authors can promote reusability and help reducing uncertainties by reproduction packages and comparative studies following our approach. Y1 - 2026 U6 - https://doi.org/10.48550/arXiv.2510.06844 ER - TY - CHAP A1 - Safi, Hila A1 - Niedermeier, Christoph A1 - Mauerer, Wolfgang T1 - TWiDDle: Twirling and Dynamical Decoupling, and Crosstalk Noise Modeling T2 - 2025 IEEE International Conference on Quantum Computing and Engineering (QCE), 30 August - 05 September 2025, Albuquerque N2 - Crosstalk remains a major source of correlated error in quantum systems, yet lacks a precise, community-wide definition - hindering systematic analysis and mitigation. This paper introduces a model-driven approach to crosstalk characterisation through three architecture-inspired noise models: (1) simultaneous two-qubit gate execution, (2) shared qubit interference, and (3) proximity-induced noise from shared control or readout hardware. These models act as both diagnostic tools and building blocks for crosstalk-aware quantum programming. We assess their impact across a broad benchmark suite - quantum simulation, Grover's algorithm, and fault-tolerant primitives like surface, Shor, and Steane codes - and evaluate two mitigation techniques: dynamical decoupling and Pauli twirling. While both are discussed in literature, only dynamical decoupling consistently enhances fidelity across noise types. Our work links low-level noise effects to high-level software engineering, underscoring the role of hardware-software co-design in scalable quantum computing. Model-based, hardware-aware design flows and composable noise abstractions improve error mitigation and program portability. Integrating such strategies into the toolchain is essential for building resilient quantum programs under realistic noise conditions. Y1 - 2025 U6 - https://doi.org/10.1109/QCE65121.2025.10313 SP - 162 EP - 168 PB - IEEE ER - TY - INPR A1 - Periyasamy, Maniraman A1 - Ufrecht, Christian A1 - Scherer, Daniel D. D. A1 - Mauerer, Wolfgang T1 - CutReg: A loss regularizer for enhancing the scalability of QML via adaptive circuit cutting N2 - Whether QML can offer a transformative advantage remains an open question. The severe constraints of NISQ hardware, particularly in circuit depth and connectivity, hinder both the validation of quantum advantage and the empirical investigation of major obstacles like barren plateaus. Circuit cutting techniques have emerged as a strategy to execute larger quantum circuits on smaller, less connected hardware by dividing them into subcircuits. However, this partitioning increases the number of samples needed to estimate the expectation value accurately through classical post-processing compared to estimating it directly from the full circuit. This work introduces a novel regularization term into the QML optimization process, directly penalizing the overhead associated with sampling. We demonstrate that this approach enables the optimizer to balance the advantages of gate cutting against the optimization of the typical ML cost function. Specifically, it navigates the trade-off between minimizing the cutting overhead and maintaining the overall accuracy of the QML model, paving the way to study larger complex problems in pursuit of quantum advantage Y1 - 2025 U6 - https://doi.org/10.48550/arXiv.2506.14858 ER - TY - JOUR A1 - Strobl, Melvin A1 - Franz, Maja A1 - Kühn, Eileen A1 - Mauerer, Wolfgang A1 - Streit, Achim T1 - QML-Essentials: A Framework for Working with Quantum Fourier Models JF - Proceedings of the IEEE International Conference on Quantum Software (QSW), 07-12 July 2025, Helsinki N2 - In this work, we propose a framework in the form of a Python package, specifically designed for the analysis of Quantum Machine Learning models. This framework is based on the PennyLane simulator and facilitates the evaluation and training of Variational Quantum Circuits. It provides additional functionality ranging from the ability to add different types of noise to the classical simulation, over different parameter initialisation strategies, to the calculation of expressibility and entanglement for a given model. As an intrinsic property of Quantum Fourier Models, it provides two methods for calculating the corresponding Fourier spectrum: one via the Fast Fourier Transform and another analytical method based on the expansion of the expectation value using trigonometric polynomials. It also provides a set of predefined approaches that allow a fast and straightforward implementation of Quantum Machine Learning models. With this framework, we extend the PennyLane simulator with a set of tools that allow researchers a more convenient start with Quantum Fourier Models and aim to unify the analysis of Variational Quantum Circuits. Y1 - 2025 U6 - https://doi.org/10.1109/QSW67625.2025.00035 SP - 238 EP - 243 PB - IEEE ER - TY - JOUR A1 - Maschek, Stefan Raimund A1 - Schwittalla, Jürgen A1 - Franz, Maja A1 - Mauerer, Wolfgang T1 - Make Some Noise! Measuring Noise Model Quality in Real-World Quantum Software JF - Proceedings of the IEEE International Conference on Quantum Software (QSW), 07-12 July 2025, Helsinki N2 - Noise and imperfections are among the prevalent challenges in quantum software engineering for current NISQ systems. They will remain important in the post-NISQ area, as logical, error-corrected qubits will be based on software mechanisms. As real quantum hardware is still limited in size and accessibility, noise models for classical simulation-that in some cases can exceed dimensions of actual systems-play a critical role in obtaining insights into quantum algorithm performance, and the properties of mechanisms for error correction and mitigation. We present, implement and validate a tunable noise model building on the Kraus channel formalism on a large scale quantum simulator system (Qaptiva). We use empirical noise measurements from IBM quantum (IBMQ) systems to calibrate the model and create a realistic simulation environment. Experimental evaluation of our approach with Greenberger-Horne-Zeilinger (GHZ) state preparation and QAOA applied to an industrial usecase validate our approach, and demonstrate accurate simulation of hardware behaviour at reasonable computational cost. We devise and utilise a method that allows for determining the quality of noise models for larger problem instances than is possible with existing metrics in the literature. To identify potentials of future quantum software and algorithms, we extrapolate the noise model to future partially fault-tolerant systems, and give insights into the interplay between hardware-specific noise modelling and hardware-aware algorithm development. KW - Industrial Application KW - Noise Model KW - Quantum Computing Y1 - 2025 U6 - https://doi.org/10.1109/QSW67625.2025.00010 PB - IEEE ER - TY - INPR A1 - Franz, Maja A1 - Strobl, Melvin A1 - Chaichenets, Leonid A1 - Kühn, Eileen A1 - Streit, Achim A1 - Mauerer, Wolfgang T1 - Out of Tune: Demystifying Noise-Effects on Quantum Fourier Models N2 - Variational quantum algorithms have received substantial theoretical and empirical attention. As the underlying variational quantum circuit (VQC) can be represented by Fourier series that contain an exponentially large spectrum in the number of input features, hope for quantum advantage remains. Nevertheless, it remains an open problem if and how quantum Fourier models (QFMs) can concretely outperform classical alternatives, as the eventual sources of non-classical computational power (for instance, the role of entanglement) are far from being fully understood. Likewise, hardware noise continues to pose a challenge that will persist also along the path towards fault tolerant quantum computers. In this work, we study VQCs with Fourier lenses, which provides possibilities to improve their understanding, while also illuminating and quantifying constraints and challenges. We seek to elucidate critical characteristics of QFMs under the influence of noise. Specifically, we undertake a systematic investigation into the impact of noise on the Fourier spectrum, expressibility, and entangling capability of QFMs through extensive numerical simulations and link these properties to training performance. The insights may inform more efficient utilisation of quantum hardware and support the design of tailored error mitigation and correction strategies. Decoherence imparts an expected and broad detrimental influence across all Ansätze. Nonetheless, we observe that the severity of these deleterious effects varies among different model architectures, suggesting that certain configurations may exhibit enhanced robustness to noise and show computational utility. Y1 - 2025 U6 - https://doi.org/10.48550/arXiv.2506.09527 ER -