TY - CHAP A1 - Zwingel, Maximilian A1 - Kedilioglu, Oguz A1 - Reitelshöfer, Sebastian A1 - Mauerer, Wolfgang T1 - Optimization Problems in Production and Planning: Approaches and Limitations in View of Possible Quantum Superiority T2 - Annals of Scientific Society for Assembly, Handling and Industrial Robotics 2023 Y1 - 2023 SN - 9783031740091 PB - Springer Nature ER - TY - CHAP A1 - Tresp, Volker A1 - Udluft, Steffen A1 - Hein, Daniel A1 - Hauptmann, Werner A1 - Leib, Martin A1 - Mutschler, Christopher A1 - Scherer, Daniel D. A1 - Mauerer, Wolfgang T1 - Workshop Summary: Quantum Machine Learning T2 - 2023 IEEE International Conference on Quantum Computing and Engineering, Bellevue, WA, United States, September 17-22, 2023 Y1 - 2023 U6 - https://doi.org/10.1109/QCE57702.2023.10174 PB - IEEE ER - TY - CHAP A1 - Gogeißl, Martin A1 - Safi, Hila A1 - Mauerer, Wolfgang T1 - Quantum Data Encoding Patterns and their Consequences T2 - Q-Data '24: Proceedings of the 1st Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications, June 9 - 15, 2024, Santiago AA Chile N2 - The use of quantum processing units (QPUs) promises speed-ups for solving computational problems, in particular for discrete optimisation. While a few groundbreaking algorithmic approaches are known that can provably outperform classical computers, we observe a scarcity of programming abstractions for constructing efficient quantum algorithms. A good fraction of the literature that addresses solving concrete problems related to database management concentrates on casting them as quadratic unconstrained binary optimisation problems (QUBOs), which can then, among others, be processed on gate-based machines (using the quantum approximate optimisation algorithm), or quantum annealers. A critical aspect that affects efficiency and scalability of either of these approaches is how classical data are loaded into qubits, respectively how problems are encoded into QUBO representation. The effectiveness of encodings is known to be of crucial importance for quantum computers, especially since the amount of available qubits is strongly limited in the era of noisy, intermediate-size quantum computers. In this paper, we present three encoding patterns, discuss their impact on scalability, and their ease of use. We consider the recreational (yet computationally challenging) Sudoku problem and its reduction to graph colouring as an illustrative example to discuss their individual benefits and disadvantages. Our aim is enable database researchers to choose an appropriate encoding scheme for their purpose without having to acquire in-depth knowledge on quantum peculiarities, thus easing the path towards applying quantum acceleration on data management systems. Y1 - 2024 SN - 979-8-4007-0553-3 U6 - https://doi.org/10.1145/3665225.3665446 SP - 27 EP - 37 PB - ACM ER - TY - INPR A1 - Jung, Matthias A1 - Krumke, Sven O. A1 - Schroth, Christof A1 - Lobe, Elisabeth A1 - Mauerer, Wolfgang T1 - QCEDA: Using Quantum Computers for EDA N2 - The field of Electronic Design Automation (EDA) is crucial for microelectronics, but the increasing complexity of Integrated Circuits (ICs) poses challenges for conventional EDA: Corresponding problems are often NP-hard and are therefore in general solved by heuristics, not guaranteeing optimal solutions. Quantum computers may offer better solutions due to their potential for optimization through entanglement, superposition, and interference. Most of the works in the area of EDA and quantum computers focus on how to use EDA for building quantum circuits. However, almost no research focuses on exploiting quantum computers for solving EDA problems. Therefore, this paper investigates the feasibility and potential of quantum computing for a typical EDA optimization problem broken down to the Min-k-Union problem. The problem is mathematically transformed into a Quadratic Unconstrained Binary Optimization (QUBO) problem, which was successfully solved on an IBM quantum computer and a D-Wave quantum annealer. Y1 - 2024 ER - TY - CHAP A1 - Mauerer, Wolfgang ED - Exman, Iaakov ED - Perez-Castillo, Ricardo ED - Piattini, Mario ED - Felderer, Michael T1 - Superoperators for Quantum Software Engineering T2 - Quantum Software: Aspects of Theory and System Design N2 - As implementations of quantum computers grow in size and maturity, the question of how to program this new class of machines is attracting increasing attention in the software engineering domain. Yet, many questions from how to design expressible quantum languages augmented with formal semantics via implementing appropriate optimizing compilers to abstracting details of machine properties in software systems remain challenging. Performing research at this intersection of quantum computing and software engineering requires sufficient knowledge of the physical processes underlying quantum computations, and how to model these. In this chapter, we review a superoperator-based approach to quantum dynamics, as it can provide means that are sufficiently abstract, yet concrete enough to be useful in quantum software and systems engineering, and outline how it is used in several important applications in the field. KW - quantum computing KW - quantum software engineering KW - software development KW - software engineering Y1 - 2024 U6 - https://doi.org/10.1007/978-3-031-64136-7_3 SN - 978-3-031-64136-7 PB - Springer Nature ER - TY - CHAP A1 - Safi, Hila A1 - Wintersperger, Karen A1 - Mauerer, Wolfgang T1 - Influence of HW-SW-Co-Design on Quantum Computing Scalability T2 - 2023 IEEE International Conference on Quantum Software (QSW), Chicago, IL, USA, 02-08 July 2023 N2 - The use of quantum processing units (QPUs) promises speed-ups for solving computational problems. Yet, current devices are limited by the number of qubits and suffer from significant imperfections, which prevents achieving quantum advantage. To step towards practical utility, one approach is to apply hardware-software co-design methods. This can involve tailoring problem formulations and algorithms to the quantum execution environment, but also entails the possibility of adapting physical properties of the QPU to specific applications. In this work, we follow the latter path, and investigate how key figures— circuit depth and gate count—required to solve four cornerstone NP-complete problems vary with tailored hardware properties. Our results reveal that achieving near-optimal performance and properties does not necessarily require optimal quantum hardware, but can be satisfied with much simpler structures that can potentially be realised for many hardware approaches.m Using statistical analysis techniques, we additionally identify an underlying general model that applies to all subject problems. This suggests that our results may be universally applicable to other algorithms and problem domains, and tailored QPUs can find utility outside their initially envisaged problem domains. The substantial possible improvements nonetheless highlight the importance of QPU tailoring to progress towards practical deployment and scalability of quantum software. KW - quantum computing KW - software engineering KW - hardware-software co-design KW - quantum algorithm performance analysis KW - scalability of quantum applications Y1 - 2023 SN - 979-8-3503-0479-4 U6 - https://doi.org/10.1109/QSW59989.2023.00022 SP - 104 EP - 115 PB - IEEE ER - TY - JOUR A1 - Wintersperger, Karen A1 - Dommert, Florian A1 - Ehmer, Thomas A1 - Hoursanov, Andrey A1 - Klepsch, Johannes A1 - Mauerer, Wolfgang A1 - Reuber, Georg A1 - Strohm, Thomas A1 - Yin, Ming A1 - Luber, Sebastian T1 - Neutral Atom Quantum Computing Hardware: Performance and End-User Perspective JF - EPJ Quantum Technology N2 - We present an industrial end-user perspective on the current state of quantum computing hardware for one specific technological approach, the neutral atom platform. Our aim is to assist developers in understanding the impact of the specific properties of these devices on the effectiveness of algorithm execution. Based on discussions with different vendors and recent literature, we discuss the performance data of the neutral atom platform. Specifically, we focus on the physical qubit architecture, which affects state preparation, qubit-to-qubit connectivity, gate fidelities, native gate instruction set, and individual qubit stability. These factors determine both the quantum-part execution time and the end-to-end wall clock time relevant for end-users, but also the ability to perform fault-tolerant quantum computation in the future. We end with an overview of which applications have been shown to be well suited for the peculiar properties of neutral atom-based quantum computers. KW - Neutral atom quantum computers KW - Review KW - Quantum computing platforms KW - Performance metrics KW - Benchmarks Y1 - 2023 U6 - https://doi.org/10.1140/epjqt/s40507-023-00190-1 VL - 10 PB - Springer Nature ER - TY - CHAP A1 - Greiwe, Felix A1 - Krüger, Tom A1 - Mauerer, Wolfgang T1 - Effects of Imperfections on Quantum Algorithms BT - A Software Engineering Perspective T2 - 2023 IEEE International Conference on Quantum Software (QSW), Chicago, IL, USA, 02-08 July 2023 N2 - Quantum computers promise considerable speedups over classical approaches, which has raised interest from many disciplines. Since any currently available implementations suffer from noise and imperfections, achieving concrete speedups for meaningful problem sizes remains a major challenge. Yet, imperfections and noise may remain present in quantum computing for a long while. Such limitations play no role in classical software computing, and software engineers are typically not well accustomed to considering such imperfections, albeit they substantially influence core properties of software and systems. In this paper, we show how to model imperfections with an approach tailored to (quantum) software engineers. We intuitively illustrate, using numerical simulations, how imperfections influence core properties of quantum algorithms on NISQ systems, and show possible options for tailoring future NISQ machines to improve system performance in a co-design approach. Our results are obtained from a software framework that we provide in form of an easy-to-use reproduction package. It does not require computer scientists to acquire deep physical knowledge on noise, yet provide tangible and intuitively accessible means of interpreting the influence of noise on common software quality and performance indicators. KW - noisy quantum computing KW - NISQ systems KW - quantum software engineering KW - HW-SW co-design Y1 - 2023 U6 - https://doi.org/10.1109/QSW59989.2023.00014 SP - 31 EP - 42 PB - IEEE ER - TY - CHAP A1 - Yue, Tao A1 - Mauerer, Wolfgang A1 - Ali, Shaukat A1 - Taibi, Davide T1 - Challenges and Opportunities in Quantum Software Architecture T2 - Software Architecture: Research Roadmaps from the Community N2 - Quantum computing is a relatively new paradigm that has raised considerable interest in physics and computer science in general but has so far received little attention in software engineering and architecture. Hybrid applications that consist of both quantum and classical components require the development of appropriate quantum software architectures. However, given that quantum software engineering (QSE) in general is a new research area, quantum software architecture–a subresearch area in QSE is also understudied. The goal of this chapter is to provide a list of research challenges and opportunities for such architectures. In addition, to make the content understandable to a broader computer science audience, we provide a brief overview of quantum computing and explain the essential technical foundations. KW - Quantum Computing KW - Software Architecture KW - Quantum Applications KW - Quantum Software Engineering Y1 - 2023 SN - 978-3-031-36847-9 U6 - https://doi.org/10.1007/978-3-031-36847-9_1 SP - 1 EP - 23 ER - TY - CHAP A1 - Schönberger, Manuel A1 - Trummer, Immanuel A1 - Mauerer, Wolfgang T1 - Quantum Optimisation of General Join Trees T2 - Joint Workshops at 49th International Conference on Very Large Data Bases (VLDBW’23) — International Workshop on Quantum Data Science and Management (QDSM’23), August 28 - September 1, 2023, Vancouver, Canada (CEUR Workshop Proceedings) N2 - Recent advances in the manufacture of quantum computers attract much attention over a wide range of fields, as early-stage quantum processing units (QPU) have become accessible. While contemporary quantum machines are very limited in size and capabilities, mature QPUs are speculated to eventually excel at optimisation problems. This makes them an attractive technology for database problems, many of which are based on complex optimisation problems with large solution spaces. Yet, the use of quantum approaches on database problems remains largely unexplored. In this paper, we address the long-standing join ordering problem, one of the most extensively researched database problems. Rather than running arbitrary code, QPUs require specific mathematical problem encodings. An encoding for the join ordering problem was recently proposed, allowing first small-scale queries to be optimised on quantum hardware. However, it is based on a faithful transformation of a mixed integer linear programming (MILP) formulation for JO, and inherits all limitations of the MILP method. Most strikingly, the existing encoding only considers a solution space with left-deep join trees, which tend to yield larger costs than general, bushy join trees. We propose a novel QUBO encoding for the join ordering problem. Rather than transforming existing formulations, we construct a native encoding tailored to quantum systems, which allows us to process general bushy join trees. This makes the full potential of QPUs available for solving join order optimisation problems. Y1 - 2023 UR - https://ceur-ws.org/Vol-3462/QDSM2.pdf SP - 1 EP - 12 PB - RWTH Aachen, Sun SITE Central Europe CY - Aachen ER - TY - CHAP A1 - Uotila, Valter A1 - Groppe, Sven A1 - Gruenwald, Le A1 - Lu, Jiaheng A1 - Mauerer, Wolfgang T1 - Preface QDSM T2 - Joint Workshops at 49th International Conference on Very Large Data Bases (VLDBW’23) — International Workshop on Quantum Data Science and Management (QDSM’23), August 28 - September 1, 2023, Vancouver, Canada (CEUR Workshop Proceedings) N2 - The first international workshop on Quantum Data Science and anagement (QDSM), co-located with VLDB 2023, is centered around addressing the possibilities of quantum computing for data science and data management. Quantum computing is a relatively new and emerging field that is believed to have huge computational potential in the future. In the QDSM workshop, we want to provide a venue for discussing and publishing novel results of applying quantum computing to hard data science and data management problems. These problems include join order optimization, designing efficient quantum feature maps, studying possibilities of solving linear programs with quantum algorithms, and divergent index tuning with quantum machine learning. Besides, we include a short and visionary survey on quantum computing for databases. Theworkshop provides a platform for active discussion on these and related topics. Y1 - 2023 UR - https://ceur-ws.org/Vol-3462/QDSM1.pdf PB - RWTH Aachen, Sun SITE Central Europe CY - Aachen ER - TY - CHAP A1 - Joblin, Mitchell A1 - Apel, Sven A1 - Hunsen, Claus A1 - Mauerer, Wolfgang T1 - Classifying Developers into Core and Peripheral: An Empirical Study on Count and Network Metrics T2 - 2017 IEEE/ACM 39th International Conference on Software Engineering (ICSE), Buenos Aires, Argentina, 20-28 May 2017 N2 - Knowledge about the roles developers play in a software project is crucial to understanding the project's collaborative dynamics. In practice, developers are often classified according to the dichotomy of core and peripheral roles. Typically, count-based operationalizations, which rely on simple counts of individual developer activities (e.g., number of commits), are used for this purpose, but there is concern regarding their validity and ability to elicit meaningful insights. To shed light on this issue, we investigate whether count-based operationalizations of developer roles produce consistent results, and we validate them with respect to developers' perceptions by surveying 166 developers. Improving over the state of the art, we propose a relational perspective on developer roles, using fine-grained developer networks modeling the organizational structure, and by examining developer roles in terms of developers' positions and stability within the developer network. In a study of 10 substantial open-source projects, we found that the primary difference between the count-based and our proposed network-based core-peripheral operationalizations is that the network-based ones agree more with developer perception than count-based ones. Furthermore, we demonstrate that a relational perspective can reveal further meaningful insights, such as that core developers exhibit high positional stability, upper positions in the hierarchy, and high levels of coordination with other core developers, which confirms assumptions of previous work. Y1 - 2017 U6 - https://doi.org/10.1109/icse.2017.23 SP - 164 EP - 174 PB - IEEE ER - TY - CHAP A1 - Joblin, Mitchell A1 - Mauerer, Wolfgang A1 - Apel, Sven A1 - Siegmund, Janet A1 - Riehle, Dirk T1 - From Developer Networks to Verified Communities: A Fine-Grained Approach T2 - 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering, 16-24 May 2015, Florence, Italy N2 - Effective software engineering demands a coordinated effort. Unfortunately, a comprehensive view on developer coordination is rarely available to support software-engineering decisions, despite the significant implications on software quality, software architecture, and developer productivity. We present a fine-grained, verifiable, and fully automated approach to capture a view on developer coordination, based on commit information and source-code structure, mined from version-control systems. We apply methodology from network analysis and machine learning to identify developer communities automatically. Compared to previous work, our approach is fine-grained, and identifies statistically significant communities using order-statistics and a community-verification technique based on graph conductance. To demonstrate the scalability and generality of our approach, we analyze ten open-source projects with complex and active histories, written in various programming languages. By surveying 53 open-source developers from the ten projects, we validate the authenticity of inferred community structure with respect to reality. Our results indicate that developers of open-source projects form statistically significant community structures and this particular view on collaboration largely coincides with developers' perceptions of real-world collaboration. KW - collaboration KW - Computer languages KW - Measurement KW - Open Source Software KW - Software systems KW - Standards Y1 - 2015 SN - 978-1-4799-1934-5 U6 - https://doi.org/10.1109/icse.2015.73 SP - 563 EP - 573 PB - IEEE ER - TY - JOUR A1 - Joblin, Mitchell A1 - Apel, Sven A1 - Mauerer, Wolfgang T1 - Evolutionary trends of developer coordination: a network approach JF - Empirical Software Engineering N2 - Software evolution is a fundamental process that transcends the realm of technical artifacts and permeates the entire organizational structure of a software project. By means of a longitudinal empirical study of 18 large open-source projects, we examine and discuss the evolutionary principles that govern the coordination of developers. By applying a network-analytic approach, we found that the implicit and self-organizing structure of developer coordination is ubiquitously described by non-random organizational principles that defy conventional software-engineering wisdom. In particular, we found that: (a) developers form scale-free networks, in which the majority of coordination requirements arise among an extremely small number of developers, (b) developers tend to accumulate coordination requirements with more and more developers over time, presumably limited by an upper bound, and (c) initially developers are hierarchically arranged, but over time, form a hybrid structure, in which core developers are hierarchically arranged and peripheral developers are not. Our results suggest that the organizational structure of large projects is constrained to evolve towards a state that balances the costs and benefits of developer coordination, and the mechanisms used to achieve this state depend on the project’s scale. KW - Developer coordination KW - Developer networks KW - Software evolution Y1 - 2016 U6 - https://doi.org/10.1007/s10664-016-9478-9 VL - 22 IS - 4 SP - 2050 EP - 2094 PB - Springer ER - TY - JOUR A1 - Joblin, Mitchell A1 - Mauerer, Wolfgang T1 - An Interactive Survey Framework for Validation of Social Network Analysis JF - The R Journal N2 - Abstract Social network analysis is extremely well supported by the R community and is routinely used for studying the relationships between people engaged in collaborative activities. While there has been rapid development of new approaches and metrics in this field, the challenging question of validity (how well insights derived from social networks agree with reality) is often difficult to address. We propose the use of several R packages to generate interactive surveys that are specifically well suited for validating social network analyses. Using our web-based survey application, we were able to validate the results of applying community-detection algorithms to infer the organizational structure of software developers contributing to open-source projects. Y1 - 2016 UR - https://journal.r-project.org/archive/2016/RJ-2016-010/index.html VL - 8 IS - 1 SP - 149 EP - 158 ER - TY - JOUR A1 - Appelhans, Marie-Luise A1 - Kampmann, Matthias A1 - Mottok, Jürgen A1 - Riederer, Michael A1 - Nagl, Klaus A1 - Steffens, Oliver A1 - Dünnweber, Jan A1 - Wildgruber, Markus A1 - Roth, Julius A1 - Stadler, Timo A1 - Palm, Christoph A1 - Weiß, Martin Georg A1 - Rochholz, Sandra A1 - Bierl, Rudolf A1 - Gschossmann, Andreas A1 - Haug, Sonja A1 - Schmidbauer, Simon A1 - Koch, Anna A1 - Westner, Markus A1 - Bary, Benedikt von A1 - Ellermeier, Andreas A1 - Vögele, Daniel A1 - Maiwald, Frederik A1 - Hierl, Stefan A1 - Schlamp, Matthias A1 - Ehrlich, Ingo A1 - Siegl, Marco A1 - Hüntelmann, Sven A1 - Wildfeuer, Matthias A1 - Brückl, Oliver A1 - Sterner, Michael A1 - Hofrichter, Andreas A1 - Eckert, Fabian A1 - Bauer, Franz A1 - Dawoud, Belal A1 - Rabl, Hans-Peter A1 - Gamisch, Bernd A1 - Schmidt, Ottfried A1 - Heberl, Michael A1 - Thema, Martin A1 - Mayer, Ulrike A1 - Eller, Johannes A1 - Sippenauer, Thomas A1 - Adelt, Christian A1 - Haslbeck, Matthias A1 - Vogl, Bettina A1 - Mauerer, Wolfgang A1 - Ramsauer, Ralf A1 - Lohmann, Daniel A1 - Sax, Irmengard A1 - Gabor, Thomas A1 - Feld, Sebastian A1 - Linnhoff-Popien, Claudia A1 - Ławrowski, Robert Damian A1 - Langer, Christoph A1 - Schreiner, Rupert A1 - Sellmair, Josef ED - Baier, Wolfgang T1 - Forschung 2019 BT - Thema: Künstliche Intelligenz N2 - Bericht mit Forschungsprojekten aus verschiedenen Bereichen der OTH Regensburg mit dem Schwerpunktthema "Künstliche Intelligenz" und einem Gespräch zur "Medizin der Zukunft" T3 - Forschungsberichte der OTH Regensburg - 2019 KW - Forschung KW - Forschungsbericht KW - Künstliche Intelligenz Y1 - 2019 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-7890 SN - 978-3-9818209-7-3 CY - Regensburg ER - TY - CHAP A1 - Franz, Maja A1 - Zurita, Pía A1 - Diefenthaler, Markus A1 - Mauerer, Wolfgang T1 - Co-Design of Quantum Hardware and Algorithms in Nuclear and High Energy Physics T2 - EPJ Web of Conferences N2 - Quantum computing (QC) has emerged as a promising technology, and is believed to have the potential to advance nuclear and high energy physics (NHEP) by harnessing quantum mechanical phenomena to accelerate computations. In this paper, we give a brief overview of the current state of quantum computing by highlighting challenges it poses and opportunities it offers to the NHEP community. Noisy intermediate-scale quantum (NISQ) computers, while limited by imperfections and small scale, may hold promise for near-term quantum advantages when coupled with co-designed quantum algorithms and special-purpose quantum processing units (QPUs). We explore various applications in NHEP, including quantum simulation, event classification, and realtime experiment control, emphasising the potential of variational quantum circuits and related techniques. To identify current interests of the community, we perform an analysis of recent literature in NHEP related to QC. Y1 - 2024 U6 - https://doi.org/10.1051/epjconf/202429512002 VL - 295 PB - EDP Sciences ER - TY - JOUR A1 - Mauerer, Wolfgang A1 - Joblin, Mitchell A1 - Tamburri, Damian A1 - Paradis, Carlos A1 - Kazman, Rick A1 - Apel, Sven T1 - In Search of Socio-Technical Congruence: A Large-Scale Longitudinal Study JF - IEEE Transactions on Software Engineering (TSE) N2 - This paper describes a large-scale empirical study investigating the relevance of socio-technical congruence over key basic software quality metrics, namely, bugs and churn. That is, we explore whether alignment or misalignment of social communication structures and technical dependencies in large software projects influences software quality. To this end, we have defined a quantitative and operational notion of socio-technical congruence, which we call /socio-technical motif congruence/ (STMC). STMC is a measure of the degree to which developers working on the same file or on two related files, need to communicate. As socio-technical congruence is a complex and multi-faceted phenomenon, the interpretability of the results is one of our main concerns, so we have employed a careful mixed-methods statistical analysis. In particular, we provide analyses with similar techniques as employed by seminal work in the field to ensure comparability of our results with the existing body of work. The major result of our study, based on an analysis of 25 large open-source projects, is that STMC is /not/ related to project quality measures---software bugs and churn---in any temporal scenario. That is, we find no statistical relationship between the alignment of developer tasks and developer communications on one hand, and project outcomes on the other hand. We conclude that, wherefore congruence does matter as literature shows, then its measurable effect lies elsewhere. KW - Socio-Technical Congruence KW - Human Factors in Software Engineering; KW - Graph Analysis KW - Empirical Software Engineering KW - Quantitative Software Engineering KW - Mixed-Methods Research KW - Socio-Technical Analysis Y1 - 2022 U6 - https://doi.org/10.1109/TSE.2021.3082074 N1 - Corresponding author: Wolfgang Mauerer VL - 48 IS - 8 SP - 3159 EP - 3184 PB - IEEE ER - TY - CHAP A1 - Gabriel, Christian A1 - Wittmann, Christoffer A1 - Hacker, B. A1 - Mauerer, Wolfgang A1 - Huntington, E. A1 - Sabuncu, M. A1 - Marquardt, Christoph A1 - Leuchs, Gerd T1 - A high-speed secure quantum random number generator based on vacuum states T2 - IEEE/OSA Conference on Lasers and Electro-Optics (CLEO), 06-11 May 2012, San Jose CA USA N2 - A high-speed continuous-variable quantum random bit generator with an expected effective bit generation rate of up to 10 GBit/s is presented. The obtained bit sequences are truly random and unique, i.e. they cannot be known by an adversary. Y1 - 2012 PB - Optical Society of America ER - TY - CHAP A1 - Schmidbauer, Lukas A1 - Wintersperger, Karen A1 - Lobe, Elisabeth A1 - Mauerer, Wolfgang T1 - Polynomial Reduction Methods and their Impact on QAOA Circuits T2 - IEEE International Conference on Quantum Software (QSW), 7-13 July 2024, Shenzhen, China N2 - Abstraction layers are of paramount importance in software architecture, as they shield the higher-level formulation of payload computations from lower-level details. Since quantum computing (QC) introduces many such details that are often unaccustomed to computer scientists, an obvious desideratum is to devise appropriate abstraction layers for QC. For discrete optimisation, one such abstraction is to cast problems in quadratic unconstrained binary optimisation (QUBO) form, which is amenable to a variety of quantum approaches. However, different mathematically equivalent forms can lead to different behaviour on quantum hardware, ranging from ease of mapping onto qubits to performance scalability. In this work, we show how using higher-order problem formulations (that provide better expressivity in modelling optimisation tasks than plain QUBO formulations) and their automatic transformation into QUBO form can be used to leverage such differences to prioritise between different desired non-functional properties for quantum optimisation. Based on a practically relevant use-case and a graph-theoretic analysis, we evaluate how different transformation approaches influence widely used quantum performance metrics (circuit depth, gates count, gate distribution, qubit scaling), and also consider the classical computational efforts required to perform the transformations, as they influence possibilities for achieving future quantum advantage. Furthermore, we establish more general properties and invariants of the transformation methods. Our quantitative study shows that the approach allows us to satisfy different trade-offs, and suggests various possibilities for the future construction of general-purpose abstractions and automatic generation of useful quantum circuits from high-level problem descriptions. KW - HW-SW co design KW - NISQ systems KW - noisy quantum computing KW - quantum software engineering Y1 - 2024 U6 - https://doi.org/10.1109/QSW62656.2024.00018 SP - 35 EP - 45 ER - TY - JOUR A1 - Broser, Christian A1 - Falter, Thomas A1 - Ławrowski, Robert Damian A1 - Altenbuchner, Amelie A1 - Vögele, Daniel A1 - Koss, Claus A1 - Schlamp, Matthias A1 - Dunnweber, Jan A1 - Steffens, Oliver A1 - Heckner, Markus A1 - Jaritz, Sabine A1 - Schiegl, Thomas A1 - Corsten, Sabine A1 - Lauer, Norina A1 - Guertler, Katherine A1 - Koenig, Eric A1 - Haug, Sonja A1 - Huber, Dominik A1 - Birkenmaier, Clemens A1 - Krenkel, Lars A1 - Wagner, Thomas A1 - Justus, Xenia A1 - Saßmannshausen, Sean Patrick A1 - Kleine, Nadine A1 - Weber, Karsten A1 - Braun, Carina N. A1 - Giacoppo, Giuliano A1 - Heinrich, Michael A1 - Just, Tobias A1 - Schreck, Thomas A1 - Schnabl, Andreas A1 - Gilmore, Amador Téran A1 - Roeslin, Samuel A1 - Schmid, Sandra A1 - Wellnitz, Felix A1 - Malz, Sebastian A1 - Maurial, Andreas A1 - Hauser, Florian A1 - Mottok, Jürgen A1 - Klettke, Meike A1 - Scherzinger, Stefanie A1 - Störl, Uta A1 - Heckner, Markus A1 - Bazo, Alexander A1 - Wolff, Christian A1 - Kopper, Andreas A1 - Westner, Markus A1 - Pongratz, Christian A1 - Ehrlich, Ingo A1 - Briem, Ulrich A1 - Hederer, Sebastian A1 - Wagner, Marcus A1 - Schillinger, Moritz A1 - Görlach, Julien A1 - Hierl, Stefan A1 - Siegl, Marco A1 - Langer, Christoph A1 - Hausladen, Matthias A1 - Schreiner, Rupert A1 - Haslbeck, Matthias A1 - Kreuzer, Reinhard A1 - Brückl, Oliver A1 - Dawoud, Belal A1 - Rabl, Hans-Peter A1 - Gamisch, Bernd A1 - Schmidt, Ottfried A1 - Heberl, Michael A1 - Gänsbauer, Bianca A1 - Bick, Werner A1 - Ellermeier, Andreas A1 - Monkman, Gareth J. A1 - Prem, Nina A1 - Sindersberger, Dirk A1 - Tschurtschenthaler, Karl A1 - Aurbach, Maximilian A1 - Dendorfer, Sebastian A1 - Betz, Michael A. A1 - Szecsey, Tamara A1 - Mauerer, Wolfgang A1 - Murr, Florian ED - Baier, Wolfgang T1 - Forschung 2018 T3 - Forschungsberichte der OTH Regensburg - 2018 KW - Forschung KW - Forschungsbericht Y1 - 2018 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-13826 SN - 978-3-9818209-5-9 CY - Regensburg ER - TY - CHAP A1 - Hoess, Nicole A1 - Paradis, Carlos A1 - Kazman, Rick A1 - Mauerer, Wolfgang T1 - Does the Tool Matter? Exploring Some Causes of Threats to Validity in Mining Software Repositories T2 - 2025 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER), Montreal, QC, Canada, March, 4-7, 2025 N2 - Software repositories are an essential source of information for software engineering research on topics such as project evolution and developer collaboration. Appropriate mining tools and analysis pipelines are therefore an indispensable precondition for many research activities. Ideally, valid results should not depend on technical details of data collection and processing. It is, however, widely acknowledged that mining pipelines are complex, with a multitude of implementation decisions made by tool authors based on their interests and assumptions. This raises the questions if (and to what extent) tools agree on their results and are interchangeable. In this study, we use two tools to extract and analyse ten large software projects, quantitatively and qualitatively comparing results and derived data to better understand this concern. We analyse discrepancies from a technical point of view, and adjust code and parametrisation to minimise replication differences. Our results indicate that despite similar trends, even simple metrics such as the numbers of commits and developers may differ by up to 500%. We find that such substantial differences are often caused by minor technical details. We show how tool-level and data post-processing changes can overcome these issues, but find they may require considerable efforts. We summarise identified causes in our lessons learned to help researchers and practitioners avoid common pitfalls, and reflect on implementation decisions and their influence in ensuring obtained data meets explicit and implicit expectations. Our findings lead us to hypothesise that similar uncertainties exist in other analysis tools, which may limit the validity of conclusions drawn in tool-centric research. KW - Codes KW - Collaboration KW - Data collection KW - Data mining KW - Developer Networks KW - Empirical Software Engineering KW - Market research KW - Measurement KW - Mining Software Repositories KW - Pipelines KW - Research Software KW - Software engineering KW - Uncertainty Y1 - 2025 SN - 979-8-3315-3510-0 U6 - https://doi.org/10.1109/SANER64311.2025.00067 SP - 645 EP - 656 PB - IEEE ER - TY - CHAP A1 - Carbonelli, Cecilia A1 - Felderer, Michael A1 - Jung, Matthias A1 - Lobe, Elisabeth A1 - Lochau, Malte A1 - Luber, Sebastian A1 - Mauerer, Wolfgang A1 - Ramler, Rudolf A1 - Schäfer, Ina A1 - Schroth, Christoph ED - Exman, Iaakov ED - Perez-Castillo, Ricardo ED - Piattini, Mario ED - Felderer, Michael T1 - Challenges for Quantum Software Engineering: An Industrial Application Scenario Perspective T2 - Quantum Software: Aspects of Theory and System Design N2 - Quantum software is becoming a key enabler for applying quantum computing to industrial use cases. This poses challenges to quantum software engineering in providing efficient and effective means to develop such software. Eventually, this must be reliably achieved in time, on budget, and in quality, using sound and well-principled engineering approaches. Given that quantum computers are based on fundamentally different principles than classical machines, this raises the question if, how, and to what extent established techniques for systematically engineering software need to be adapted. In this chapter, we analyze three paradigmatic application scenarios for quantum software engineering from an industrial perspective. The respective use cases center around (1) optimization and quantum cloud services, (2) quantum simulation, and (3) embedded quantum computing. Our aim is to provide a concise overview of the current and future applications of quantum computing in diverse industrial settings. We derive presumed challenges for quantum software engineering and thus provide research directions for this emerging field. KW - industrial use cases KW - quantum computing KW - quantum software engineering KW - software development KW - software engineering Y1 - 2024 SN - 978-3-031-64135-0 SN - 978-3-031-64136-7 U6 - https://doi.org/10.1007/978-3-031-64136-7_12 PB - Springer-Nature ER - TY - INPR A1 - Ammermann, Joshua A1 - Mauerer, Wolfgang A1 - Schäfer, Ina T1 - Towards View-based Development of Quantum Software N2 - Quantum computing is an interdisciplinary field that relies on the expertise of many different stakeholders. The views of various stakeholders on the subject of quantum computing may differ, thereby complicating communication. To address this, we propose a view-based quantum development approach based on a Single Underlying Model (SUM) and a supporting quantumIntegrated Development Environment (IDE). We highlight emerging challenges for future research. KW - Quantum Computing KW - View-based Development KW - Integrated Development Environment Y1 - 2024 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 ER - TY - GEN A1 - Schönberger, Manuel A1 - Scherzinger, Stefanie A1 - Mauerer, Wolfgang T1 - Quantum Computing for DB - Applicability on Multi Query Optimization and Join Order Optimization T2 - Frühjahrstreffen Fachgruppe Datenbanken in Potsdam, 2022 Y1 - UR - https://www.lfdr.de/Publications/2022/FGDB_Poster_Schoenberger.pdf ER - TY - CHAP A1 - Schönberger, Manuel A1 - Franz, Maja A1 - Scherzinger, Stefanie A1 - Mauerer, Wolfgang T1 - Peel | Pile? Cross-Framework Portability of Quantum Software T2 - 2022 IEEE 19th International Conference on Software Architecture Companion (ICSA-C), 12-15 March 2022, Honolulu, HI, USA N2 - In recent years, various vendors have made quantum software frameworks available. Yet with vendor-specific frameworks, code portability seems at risk, especially in a field where hardware and software libraries have not yet reached a consolidated state, and even foundational aspects of the technologies are still in flux. Accordingly, the development of vendor-independent quantum programming languages and frameworks is often suggested. This follows the established architectural pattern of introducing additional levels of abstraction into software stacks, thereby piling on layers of abstraction. Yet software architecture also provides seemingly less abstract alternatives, namely to focus on hardware-specific formulations of problems that peel off unnecessary layers. In this article, we quantitatively and experimentally explore these strategic alternatives, and compare popular quantum frameworks from the software implementation perspective. We find that for several specific, yet generalisable problems, the mathematical formulation of the problem to be solved is not just sufficiently abstract and serves as precise description, but is likewise concrete enough to allow for deriving framework-specific implementations with little effort. Additionally, we argue, based on analysing dozens of existing quantum codes, that porting between frameworks is actually low-effort, since the quantum- and framework-specific portions are very manageable in terms of size, commonly in the order of mere hundreds of lines of code. Given the current state-of-the-art in quantum programming practice, this leads us to argue in favour of peeling off unnecessary abstraction levels. KW - Computer Science KW - Quantum Physics KW - Software Engineering Y1 - 2022 U6 - https://doi.org/10.1109/ICSA-C54293.2022.00039 N1 - Preprint unter: https://arxiv.org/abs/2203.06289 PB - IEEE ER - TY - INPR A1 - Schönberger, Manuel A1 - Trummer, Immanuel A1 - Mauerer, Wolfgang T1 - Quantum-Inspired Digital Annealing for Join Ordering T2 - Proceedings of the VLDB Endowment N2 - Finding the optimal join order (JO) is one of the most important problems in query optimisation, and has been extensively considered in research and practise. As it involves huge search spaces, approximation approaches and heuristics are commonly used, which explore a reduced solution space at the cost of solution quality. To explore even large JO search spaces, we may consider special-purpose software, such as mixed-integer linear programming (MILP) solvers, which have successfully solved JO problems. However, even mature solvers cannot overcome the limitations of conventional hardware prompted by the end of Moore’s law. We consider quantum-inspired digital annealing hardware, which takes inspiration from quantum processing units (QPUs). Unlike QPUs, which likely remain limited in size and reliability in the near and mid-term future, the digital annealer (DA) can solve large instances of mathematically encoded optimisation problems today. We derive a novel, native encoding for the JO problem tailored to this class of machines that substantially improves over known MILP and quantum-based encodings, and reduces encoding size over the state-of-the-art. By augmenting the computation with a novel readout method, we derive valid join orders for each solution obtained by the (probabilistically operating) DA. Most importantly and despite an extremely large solution space, our approach scales to practically relevant dimensions of around 50 relations and improves result quality over conventionally employed approaches, adding a novel alternative to solving the long-standing JO problem. Y1 - 2023 ER - TY - INPR A1 - Schmidl, Sebastian A1 - Deng, Yangshen A1 - Ma, Pingchuan A1 - Schönberger, Manuel A1 - Mauerer, Wolfgang T1 - Reproducibility Report for ACM SIGMOD 2023 Paper: Ready to Leap (by Co-Design)? Join Order Optimisation N2 - The paper “Ready to Leap (by Co-Design)? Join Order Optimisation on Quantum Hardware” proposes the first approach to solve the problem of join order optimization on quantum hardware. The authors characterize the applicability and limitations of current state-of-the-art quantum hardware, i. e. gate-based quantum computing and quantum annealing, for join ordering and recommend key improvements to the physical hardware to reach practical utility. Based on the provided database queries and QPU system processing data, we have been able to reproduce the original paper’s key insights and quantum problem characteristics reported in its experimental section. The authors provided a self-contained and fully automated reproduction package, including data (database queries, statistics, and collected QPU processing data), experiment scripts, and plotting routines that allowed the identical reconstruction of the three main figures in the paper. Y1 - 2024 UR - https://www.lfdr.de/Publications/2024/SIGMOD_ARI_2023___Paper_37.pdf ER - TY - GEN A1 - Schönberger, Manuel A1 - Scherzinger, Stefanie A1 - Mauerer, Wolfgang T1 - Applicability of Quantum Computing on Database Query Optimization T2 - Frühjahrstreffen Fachgruppe Datenbanken in Potsdam (Poster Presentation) Y1 - 2022 ER - TY - JOUR A1 - Safi, Hila A1 - Bandic, Medina A1 - Niedermeier, Christoph A1 - Almudever, Carmen G. A1 - Feld, Sebastian A1 - Mauerer, Wolfgang T1 - Stacking the odds: full-stack quantum system design space exploration JF - EPJ Quantum Technology N2 - Design space exploration (DSE) plays an important role in optimising quantum circuit execution by systematically evaluating different configurations of compilation strategies and hardware settings. In this paper, we conduct a comprehensive investigation into the impact of various layout methods, qubit routing techniques, and optimisation levels, as well as device-specific properties such as different variants and strengths of noise and imperfections, the topological structure of qubits, connectivity densities, and back-end sizes. By spanning through these dimensions, we aim to understand the interplay between compilation choices and hardware characteristics. A key question driving our exploration is whether the optimal selection of device parameters, mapping techniques, comprising of initial layout strategies and routing heuristics can mitigate device induced errors beyond standard error mitigation approaches. Our results show that carefully selecting software strategies (e.g., mapping and routing algorithms) and tailoring hardware characteristics (such as minimising noise and leveraging topology and connectivity density) significantly improve the fidelity of circuit execution outcomes, and thus the expected correctness or success probability of the computational result. We provide estimates based on key metrics such as circuit depth, gate count and expected fidelity. Our results highlight the importance of hardware–software co-design, particularly as quantum systems scale to larger dimensions, and along the way towards fully error corrected quantum systems: Our study is based on computationally noisy simulations, but considers various implementations of quantum error correction (QEC) using the same approach as for other algorithms. The observed sensitivity of circuit fidelity to noise and connectivity suggests that co-design principles will be equally critical when integrating QEC in future systems. Our exploration provides practical guidelines for co-optimising physical mapping, qubit routing, and hardware configurations in realistic quantum computing scenarios. Y1 - 2025 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-85157 N1 - Corresponding author der OTH Regensburg: Hila Safi VL - 12 PB - Springer CY - Heidelberg ER - TY - CHAP A1 - Franz, Maja A1 - Winker, Tobias A1 - Groppe, Sven A1 - Mauerer, Wolfgang T1 - Hype or Heuristic? Quantum Reinforcement Learning for Join Order Optimisation T2 - 2024 IEEE International Conference on Quantum Computing and Engineering (QCE), 15-20 September 2024, Montreal, QC, Canada N2 - Identifying optimal join orders (JOs) stands out as a key challenge in database research and engineering. Owing to the large search space, established classical methods rely on approximations and heuristics. Recent efforts have successfully explored reinforcement learning (RL) for JO. Likewise, quantum versions of RL have received considerable scientific attention. Yet, it is an open question if they can achieve sustainable, overall practical advantages with improved quantum processors. In this paper, we present a novel approach that uses quantum reinforcement learning (QRL) for JO based on a hybrid variational quantum ansatz. It is able to handle general bushy join trees instead of resorting to simpler left-deep variants as compared to approaches based on quantum(-inspired) optimisation, yet requires multiple orders of magnitudes fewer qubits, which is a scarce resource even for post-NISQ systems. Despite moderate circuit depth, the ansatz exceeds current NISQ capabilities, which requires an evaluation by numerical simulations. While QRL may not significantly outperform classical approaches in solving the JO problem with respect to result quality (albeit we see parity), we find a drastic reduction in required trainable parameters. This benefits practically relevant aspects ranging from shorter training times compared to classical RL, less involved classical optimisation passes, or better use of available training data, and fits data-stream and low-latency processing scenarios. Our comprehensive evaluation and careful discussion delivers a balanced perspective on possible practical quantum advantage, provides insights for future systemic approaches, and allows for quantitatively assessing trade-offs of quantum approaches for one of the most crucial problems of database management systems. Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-76877 N1 - Corresponding author der OTH Regensburg: Maja Franz SP - 409 EP - 420 PB - IEEE ER - TY - JOUR A1 - Krüger, Tom A1 - Mauerer, Wolfgang T1 - Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation JF - Quantum 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 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. Y1 - 2025 U6 - https://doi.org/10.22331/q-2025-11-06-1903 N1 - Die Preprint-Version ist ebenfalls in diesem Repositorium verzeichnet unter: https://opus4.kobv.de/opus4-oth-regensburg/frontdoor/index/index/start/2/rows/10/sortfield/score/sortorder/desc/searchtype/simple/query/Out+of+the+Loop/docId/7938 VL - 9 PB - Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften ER - 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 -