<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>8990</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>114</pageFirst>
    <pageLast>125</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">From Tracepoints to Timeliness: a Semi-Markov Framework for Predictive Runtime Analysis</title>
    <abstract language="eng">Detecting and resolving violations of temporal constraints in real-time systems is both, time-consuming and resource-intensive, particularly in complex software environments. Measurement-based approaches are widely used during development, but often are unable to deliver reliable predictions with limited data. This paper presents a hybrid method for worst-case execution time estimation, combining lightweight runtime tracing with probabilistic modelling. Timestamped system events are used to construct a semi-Markov chain, where transitions represent empirically observed timing between events. Execution duration is interpreted as time-to-absorption in the semi-Markov chain, enabling worst-case execution time estimation with fewer assumptions and reduced overhead. Empirical results from real-time Linux systems indicate that the method captures both regular and extreme timing behaviours accurately, even from short observation periods. The model supports holistic, low-intrusion analysis across system layers and remains interpretable and adaptable for practical use.</abstract>
    <parentTitle language="eng">IEEE 31th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), 20-22 August 2025, Singapore</parentTitle>
    <identifier type="doi">10.1109/RTCSA66114.2025.00021</identifier>
    <enrichment key="opus.import.date">2026-03-30T12:30:30+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Benno Bielmeier</author>
    <author>Ralf Ramsauer</author>
    <author>Takahiro Yoshida</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
    <collection role="othforschungsschwerpunkt" number="">Digitale Transformation</collection>
  </doc>
  <doc>
    <id>8991</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>7</pageNumber>
    <edition/>
    <issue>08</issue>
    <volume>25</volume>
    <type>article</type>
    <publisherName>Deloitte</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Open-Source-Wissenschaftler bereiten Software für das Quantencomputing vor</title>
    <abstract language="deu">Um Software und Architekturen für das Quantencomputing zu entwickeln, zu definieren und zu testen, braucht man keinen Quantencomputer. Weil die teuer und rar sind, entschieden sich Wissenschaftler der OTH Regensburg dafür, sie einfach zu virtualisieren – mit messbarem Erfolg.</abstract>
    <parentTitle language="eng">Linux-Magazin</parentTitle>
    <identifier type="url">https://www.linux-magazin.de/ausgaben/2025/08/quantencomputing/</identifier>
    <enrichment key="opus.import.date">2026-03-30T12:30:30+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Markus Feilner</author>
    <author>Ralf Ramsauer</author>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Linux</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Quantencomputing</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>QuantumVM</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
    <collection role="othforschungsschwerpunkt" number="">Digitale Transformation</collection>
  </doc>
  <doc>
    <id>8993</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>2101</pageFirst>
    <pageLast>2111</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Path Matters: Industrial Data Meet Quantum Optimization</title>
    <abstract language="eng">Real-world optimization problems must undergo a series of transformations before becoming solvable on current quantum hardware. Even for a fixed problem, the number of possible transformation paths-from industry-relevant formulations through binary constrained linear programs (BILPs), to quadratic unconstrained binary optimization (QUBO), and finally to a hardware-executable representation-is remarkably large. Each step introduces free parameters, such as Lagrange multipliers, encoding strategies, slack variables, rounding schemes or algorithmic choices-making brute-force exploration of all paths intractable. In this work, we benchmark a representative subset of these transformation paths using a realworld industrial production planning problem with industry data: the optimization of work allocation in a press shop producing vehicle parts. We focus on QUBO reformulations and algorithmic parameters for both quantum annealing (QA) and the Linear Ramp Quantum Approximate Optimization Algorithm (LR-QAOA). Our goal is to identify a reduced set of effective configurations applicable to similar industrial settings. Our results show that QA on D-Wave hardware consistently produces near-optimal solutions, whereas LR-QAOA on IBM quantum devices struggles to reach comparable performance. Hence, the choice of hardware and solver strategy significantly impacts performance. The problem formulation and especially the penalization strategy determine the solution quality. Most importantly, mathematically-defined penalization strategies are equally successful as hand-picked penalty factors, paving the way for automated QUBO formulation. Moreover, we observe a strong correlation between simulated and quantum annealing performance metrics, offering a scalable proxy for predicting QA behavior on larger problem instances.</abstract>
    <parentTitle language="eng">2025 IEEE International Conference on Quantum Computing and Engineering (QCE), 30 August - 05 September 2025, Albuquerque</parentTitle>
    <identifier type="doi">10.1109/QCE65121.2025.00230</identifier>
    <enrichment key="opus.import.date">2026-03-30T12:30:30+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Lukas Schmidbauer</author>
    <author>Carlos A. Riofrío</author>
    <author>Florian Heinrich</author>
    <author>Vanessa Junk</author>
    <author>Ulrich Schwenk</author>
    <author>Thomas Husslein</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
    <collection role="othforschungsschwerpunkt" number="">Digitale Transformation</collection>
  </doc>
  <doc>
    <id>8995</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>8</pageNumber>
    <edition/>
    <issue/>
    <volume>337</volume>
    <type>article</type>
    <publisherName>EDP Sciences</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">From Hope to Heuristic: Realistic Runtime Estimates for Quantum Optimisation in NHEP</title>
    <abstract language="eng">Noisy Intermediate-Scale Quantum (NISQ) computers, despite their limitations, present opportunities for near-term quantum advantages in Nuclear and High-Energy Physics (NHEP) when paired with specially designed quantum algorithms and processing units. This study focuses on core algorithms that solve optimization problems through the quadratic Ising or Quadratic Unconstrained Binary Optimisation model, specifically Quantum Annealing and the Quantum Approximate Optimisation Algorithm (QAOA).&#13;
&#13;
In particular, we estimate runtimes and scalability for the task of particle Track Reconstruction (TR), a key computing challenge in NHEP, and investigate how the classical parameter space in QAOA, along with techniques like a Fourieranalysis based heuristic, can facilitate future quantum advantages. The findings indicate that lower frequency components in the parameter space are crucial for effective annealing schedules, suggesting that heuristics can improve resource efficiency while achieving near-optimal results. Overall, the study highlights the potential of NISQ computers in NHEP and the significance of co-design approaches and heuristic techniques in overcoming challenges in quantum algorithms.</abstract>
    <parentTitle language="eng">EPJ Web of Conferences; 27th International Conference on Computing in High Energy and Nuclear Physics (CHEP 2024)</parentTitle>
    <identifier type="doi">10.1051/epjconf/202533701282</identifier>
    <note>Corresponding author der OTH Regensburg: Maja Franz</note>
    <enrichment key="opus.import.date">2026-03-30T12:30:30+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="CorrespondingAuthor">Franz, Maja</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Maja Franz</author>
    <author>Manuel Schönberger</author>
    <author>Melvin Strobl</author>
    <author>Eileen Kühn</author>
    <author>Achim Streit</author>
    <author>Pía Zurita</author>
    <author>Markus Diefenthaler</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="oaweg" number="">Gold Open Access- Erstveröffentlichung in einem/als Open-Access-Medium</collection>
    <collection role="oaweg" number="">Corresponding author der OTH Regensburg</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
    <collection role="othforschungsschwerpunkt" number="">Digitale Transformation</collection>
  </doc>
  <doc>
    <id>8996</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>32</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>preprint</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Out of Tune: Demystifying Noise-Effects on Quantum Fourier Models</title>
    <abstract language="eng">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.</abstract>
    <identifier type="doi">10.48550/arXiv.2506.09527</identifier>
    <enrichment key="opus.import.date">2026-03-30T12:30:30+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY-SA - Namensnennung - Weitergabe unter gleichen Bedingungen 4.0 International</licence>
    <author>Maja Franz</author>
    <author>Melvin Strobl</author>
    <author>Leonid Chaichenets</author>
    <author>Eileen Kühn</author>
    <author>Achim Streit</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
    <collection role="othforschungsschwerpunkt" number="">Digitale Transformation</collection>
  </doc>
  <doc>
    <id>8997</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>11</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Make Some Noise! Measuring Noise Model Quality in Real-World Quantum Software</title>
    <abstract language="eng">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.</abstract>
    <parentTitle language="eng">Proceedings of the IEEE International Conference on Quantum Software (QSW), 07-12 July 2025, Helsinki</parentTitle>
    <identifier type="doi">10.1109/QSW67625.2025.00010</identifier>
    <enrichment key="opus.import.date">2026-03-30T12:30:30+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Stefan Raimund Maschek</author>
    <author>Jürgen Schwittalla</author>
    <author>Maja Franz</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Industrial Application</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Noise Model</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quantum Computing</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
    <collection role="othforschungsschwerpunkt" number="">Digitale Transformation</collection>
  </doc>
  <doc>
    <id>9002</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>4</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>preprint</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">CutReg: A loss regularizer for enhancing the scalability of QML via adaptive circuit cutting</title>
    <abstract language="eng">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</abstract>
    <identifier type="doi">10.48550/arXiv.2506.14858</identifier>
    <enrichment key="opus.import.date">2026-03-30T12:30:30+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Maniraman Periyasamy</author>
    <author>Christian Ufrecht</author>
    <author>Daniel D. D. Scherer</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
    <collection role="othforschungsschwerpunkt" number="">Digitale Transformation</collection>
  </doc>
  <doc>
    <id>9004</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>6</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>preprint</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Towards System-Level Quantum-Accelerator Integration</title>
    <abstract language="eng">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.&#13;
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.&#13;
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.</abstract>
    <identifier type="doi">10.48550/arXiv.2507.19212</identifier>
    <enrichment key="opus.import.date">2026-03-30T12:30:30+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Ralf Ramsauer</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
    <collection role="othforschungsschwerpunkt" number="">Digitale Transformation</collection>
  </doc>
  <doc>
    <id>9005</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>162</pageFirst>
    <pageLast>168</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>IEEE</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">TWiDDle: Twirling and Dynamical Decoupling, and Crosstalk Noise Modeling</title>
    <abstract language="eng">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.</abstract>
    <parentTitle language="deu">2025 IEEE International Conference on Quantum Computing and Engineering (QCE), 30 August - 05 September 2025, Albuquerque</parentTitle>
    <identifier type="doi">10.1109/QCE65121.2025.10313</identifier>
    <enrichment key="opus.import.date">2026-03-30T12:30:30+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Hila Safi</author>
    <author>Christoph Niedermeier</author>
    <author>Wolfgang Mauerer</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
    <collection role="othforschungsschwerpunkt" number="">Digitale Transformation</collection>
  </doc>
  <doc>
    <id>9006</id>
    <completedYear/>
    <publishedYear>2026</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>46</pageNumber>
    <edition/>
    <issue>2</issue>
    <volume>7</volume>
    <type>article</type>
    <publisherName>ACM</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">It’s Quick to be Square: Fast Quadratisation for Quantum Toolchains</title>
    <abstract language="eng">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.&#13;
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.</abstract>
    <parentTitle language="eng">ACM Transactions on Quantum Computing</parentTitle>
    <identifier type="doi">10.1145/3800943</identifier>
    <note>Preprint ebenfalls auf OPUS veröffentlicht: https://opus4.kobv.de/opus4-oth-regensburg/frontdoor/index/index/docId/7937</note>
    <enrichment key="opus.import.date">2026-03-30T12:30:30+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Creative Commons - CC BY-NC-ND - Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International</licence>
    <author>Lukas Schmidbauer</author>
    <author>Elisabeth Lobe</author>
    <author>Ina Schaefer</author>
    <author>Wolfgang Mauerer</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Algorithmic optimisation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Graphs</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Performance</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Pseudo Boolean Function</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="oaweg" number="">Gold Open Access- Erstveröffentlichung in einem/als Open-Access-Medium</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
    <collection role="funding" number="">ACM Publish&amp;Read-Vertrag</collection>
    <collection role="DFGFachsystematik" number="1">Ingenieurwissenschaften</collection>
    <collection role="othforschungsschwerpunkt" number="">Digitale Transformation</collection>
  </doc>
</export-example>
