197 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- R. Wille2 profiles28 · h 51
- Lukas Burgholzer20 · h 21
- Rudolf Ramler2 profiles11 · h 23
- Flavio Ferrarotti3 profiles10 · h 10
- Robert Wille4 profiles9 · h 12
- S. Hillmich9 · h 16
- B. Moser2 profiles8 · h 14
- Jorge Martinez-Gil4 profiles8 · h 8
- Nils Quetschlich8 · h 12
- J. Martinez-Gil7 · h 11
- K. Schewe7 · h 27
- Lucas Berent6 · h 9
- Johannes Kepler University of LinzAT33 papers
- Technical University of MunichDE30 papers
- Universität InnsbruckAT5 papers
- University of TartuEE5 papers
- Australian National UniversityAU4 papers
- Freie Universität BerlinDE4 papers
- Helmholtz-Zentrum Berlin für Materialien und EnergieDE4 papers
- IBM Research - TokyoJP3 papers
- Basque Center for Applied MathematicsES2 papers
- Chalmers University of TechnologySE2 papers
- IkerbasqueES2 papers
- Munich Center for Quantum Science and TechnologyDE2 papers
18 papers · 1 filter
SyReC Synthesizer: An MQT tool for synthesis of reversible circuits
Smaran Adarsh, Lukas Burgholzer, Tanmay Manjunath +1
Reversible circuits form the backbone for many promising emerging technologies such as quantum computing, low power/adiabatic design, encoder/decoder devices, and several other app…
Recommending Solution Paths for Solving Optimization Problems with Quantum Computing
Benedikt Poggel, Nils Quetschlich, Lukas Burgholzer +2
Solving real-world optimization problems with quantum computing requires choosing between a large number of options concerning formulation, encoding, algorithm and hardware. Findin…
Compiler Optimization for Quantum Computing Using Reinforcement Learning
Nils Quetschlich, Lukas Burgholzer, Robert Wille
Any quantum computing application, once encoded as a quantum circuit, must be compiled before being executable on a quantum computer. Similar to classical compilation, quantum comp…
Equivalence Checking of Parameterized Quantum Circuits: Verifying the Compilation of Variational Quantum Algorithms
Tom Peham, Lukas Burgholzer, Robert Wille
Variational quantum algorithms have been introduced as a promising class of quantum-classical hybrid algorithms that can already be used with the noisy quantum computing hardware a…
Towards an Automated Framework for Realizing Quantum Computing Solutions
Nils Quetschlich, Lukas Burgholzer, Robert Wille
Quantum computing is fast evolving as a technology due to recent advances in hardware, software, as well as the development of promising applications. To use this technology for so…
On Optimal Subarchitectures for Quantum Circuit Mapping
Tom Peham, Lukas Burgholzer, Robert Wille
Compiling a high-level quantum circuit down to a low-level description that can be executed on state-of-the-art quantum computers is a crucial part of the software stack for quantu…
Predicting Good Quantum Circuit Compilation Options
Nils Quetschlich, Lukas Burgholzer, Robert Wille
Any potential application of quantum computing, once encoded as a quantum circuit, needs to be compiled in order to be executed on a quantum computer. Deciding which qubit technolo…
Software Tools for Decoding Quantum Low-Density Parity Check Codes
Lucas Berent, Lukas Burgholzer, Robert Wille
Quantum Error Correction (QEC) is an essential field of research towards the realization of large-scale quantum computers. On the theoretical side, a lot of effort is put into desi…
Equivalence Checking of Quantum Circuits with the ZX-Calculus
Tom Peham, Lukas Burgholzer, Robert Wille
As state-of-the-art quantum computers are capable of running increasingly complex algorithms, the need for automated methods to design and test potential applications rises. Equiva…
Automated machine learning for borehole resistivity measurements
M. Shahriari, D. Pardo, S. Kargaran +1
Deep neural networks (DNNs) offer a real-time solution for the inversion of borehole resistivity measurements to approximate forward and inverse operators. It is possible to use ex…
Adaptive Compilation of Multi-Level Quantum Operations
Kevin Mato, Martin Ringbauer, Stefan Hillmich +1
Quantum computers have the potential to solve some important industrial and scientific problems with greater efficiency than classical computers. While most current realizations fo…
Interpretable Hidden Markov Model-Based Deep Reinforcement Learning Hierarchical Framework for Predictive Maintenance of Turbofan Engines
Ammar N. Abbas, Georgios Chasparis, John D. Kelleher
An open research question in deep reinforcement learning is how to focus the policy learning of key decisions within a sparse domain. This paper emphasizes combining the advantages…
A Replication Study on Predicting Metamorphic Relations at Unit Testing Level
Alejandra Duque-Torres, Dietmar Pfahl, Rudolf Ramler +1
Metamorphic Testing (MT) addresses the test oracle problem by examining the relations between inputs and outputs of test executions. Such relations are known as Metamorphic Relatio…
Quality Characteristics of a Software Platform for Human-AI Teaming in Smart Manufacturing
Philipp Haindl, Thomas Hoch, Javier Dominguez +3
As AI-enabled software systems become more prevalent in smart manufacturing, their role shifts from a reactive to a proactive one that provides context-specific support to machine…
Wild Patterns Reloaded: A Survey of Machine Learning Security against Training Data Poisoning
Antonio Emanuele Cinà, Kathrin Grosse, Ambra Demontis +7
The success of machine learning is fueled by the increasing availability of computing power and large training datasets. The training data is used to learn new models or update exi…
MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing
Nils Quetschlich, Lukas Burgholzer, Robert Wille
Quantum software tools for a wide variety of design tasks on and across different levels of abstraction are crucial in order to eventually realize useful quantum applications. This…
Simulation Paths for Quantum Circuit Simulation with Decision Diagrams
Lukas Burgholzer, Alexander Ploier, Robert Wille
Simulating quantum circuits on classical computers is a notoriously hard, yet increasingly important task for the development and testing of quantum algorithms. In order to allevia…
Towards a SAT Encoding for Quantum Circuits: A Journey From Classical Circuits to Clifford Circuits and Beyond
Lucas Berent, Lukas Burgholzer, Robert Wille
Satisfiability Testing (SAT) techniques are well-established in classical computing where they are used to solve a broad variety of problems, e.g., in the design of classical circu…