197 citations · 850 across the 38 of their papers we have counts for
13 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…
A SAT Encoding for Optimal Clifford Circuit Synthesis
Sarah Schneider, Lukas Burgholzer, Robert Wille
Executing quantum algorithms on a quantum computer requires compilation to representations that conform to all restrictions imposed by the device. Due to devices' limited coherence…
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…