216 citations · 1.4k across the 66 of their papers we have counts for
57 papers · 1 filter
Mixed-Dimensional Quantum Circuit Simulation with Decision Diagrams
Kevin Mato, Stefan Hillmich, Robert Wille
Quantum computers promise to solve several categories of problems faster than classical computers ever could. Current research mostly focuses on qubits, i.e., systems where the uni…
A Hybrid Classical Quantum Computing Approach to the Satellite Mission Planning Problem
Nils Quetschlich, Vincent Koch, Lukas Burgholzer +1
Hundreds of satellites equipped with cameras orbit the Earth to capture images from locations for various purposes. Since the field of view of the cameras is usually very narrow, t…
Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers
Tom Peham, Nina Brandl, Richard Kueng +2
Circuit synthesis is the task of decomposing a given logical functionality into a sequence of elementary gates. It is (depth-)optimal if it is impossible to achieve the desired fun…
A Framework for the Design and Realization of Alternative Superconducting Quantum Architectures
Jagatheesan Kunasaikaran, Kevin Mato, Robert Wille
Superconducting quantum hardware architectures have been designed by considering the physical constraints of the underlying physics. These general-purpose architectures leave room…
Reducing the Compilation Time of Quantum Circuits Using Pre-Compilation on the Gate Level
Nils Quetschlich, Lukas Burgholzer, Robert Wille
In order to implement a quantum computing application, problem instances must be encoded into a quantum circuit and then compiled for a specific platform. The lengthy compilation p…
Towards Hamiltonian Simulation with Decision Diagrams
Aaron Sander, Lukas Burgholzer, Robert Wille
This paper proposes a novel approach to Hamiltonian simulation using Decision Diagrams (DDs), which are an exact representation based on exploiting redundancies in representations…
Decoding quantum color codes with MaxSAT
Lucas Berent, Lukas Burgholzer, Peter-Jan H. S. Derks +2
In classical computing, error-correcting codes are well established and are ubiquitous both in theory and practical applications. For quantum computing, error-correction is essenti…
Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation
Lukas Burgholzer, Alexander Ploier, Robert Wille
Classically simulating quantum circuits is crucial when developing or testing quantum algorithms. Due to the underlying exponential complexity, efficient data structures are key fo…
Decision Diagrams for Quantum Computing
Robert Wille, Stefan Hillmich, Lukas Burgholzer
Quantum computing promises to solve some important problems faster than conventional computations ever could. Currently available NISQ devices on which first practical applications…
MQT QMAP: Efficient Quantum Circuit Mapping
Robert Wille, Lukas Burgholzer
Quantum computing is an emerging technology that has the potential to revolutionize fields such as cryptography, machine learning, optimization, and quantum simulation. However, a…
Automatic Implementation and Evaluation of Error-Correcting Codes for Quantum Computing: An Open-Source Framework for Quantum Error Correction
Thomas Grurl, Christoph Pichler, Jürgen Fuß +1
Due to the fragility of quantum mechanical effects, real quantum computers are plagued by frequent noise effects that cause errors during computations. Quantum error-correcting cod…
Compilation of Entangling Gates for High-Dimensional Quantum Systems
Kevin Mato, Martin Ringbauer, Stefan Hillmich +1
Most quantum computing architectures to date natively support multi-valued logic, albeit being typically operated in a binary fashion. Multi-valued, or qudit, quantum processors ha…
The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus
Robert Wille, Lukas Burgholzer, Stefan Hillmich +3
Quantum computers promise to efficiently solve important problems classical computers never will. However, in order to capitalize on these prospects, a fully automated quantum soft…
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…
Error mitigation for quantum kernel based machine learning methods on IonQ and IBM quantum computers
Sasan Moradi, Christoph Brandner, Macauley Coggins +3
Kernel methods are the basis of most classical machine learning algorithms such as Gaussian Process (GP) and Support Vector Machine (SVM). Computing kernels using noisy intermediat…
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…