activity
20102023
most citedSynthesis of Quantum Circuits for Linear Nearest Neighbor Architectures

216 citations · 1.4k across the 66 of their papers we have counts for

collaborators
Showing 2022Show all

20 papers · 1 filter

cs.AR2022★ 6 cited

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…

quant-ph2022★ 18 cited

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…

quant-ph2022★ 42 cited

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…

cond-mat.mes-hall2022

Simulating Charged Defects in Silicon Dangling Bond Logic Systems to Evaluate Logic Robustness

Samuel S. H. Ng, Jeremiah Croshaw, Marcel Walter +3

Recent research interest in emerging logic systems based on quantum dots has been sparked by the experimental demonstration of nanometer-scale logic devices composed of atomically…

cs.LG2022

Uncertainty-based Meta-Reinforcement Learning for Robust Radar Tracking

Julius Ott, Lorenzo Servadei, Gianfranco Mauro +3

Nowadays, Deep Learning (DL) methods often overcome the limitations of traditional signal processing approaches. Nevertheless, DL methods are barely applied in real-life applicatio…

quant-ph2022★ 24 cited

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…

cs.LG2022

Utilizing Explainable AI for improving the Performance of Neural Networks

Huawei Sun, Lorenzo Servadei, Hao Feng +3

Nowadays, deep neural networks are widely used in a variety of fields that have a direct impact on society. Although those models typically show outstanding performance, they have…

quant-ph2022★ 20 cited

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…

cs.LG2022

MEET: A Monte Carlo Exploration-Exploitation Trade-off for Buffer Sampling

Julius Ott, Lorenzo Servadei, Jose Arjona-Medina +7

Data selection is essential for any data-based optimization technique, such as Reinforcement Learning. State-of-the-art sampling strategies for the experience replay buffer improve…

quant-ph2022★ 29 cited

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…

quant-ph2022★ 31 cited

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…

quant-ph2022★ 7 cited

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…

quant-ph2022★ 47 cited

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…

quant-ph2022★ 17 cited

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…

quant-ph2022★ 2 cited

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…

quant-ph2022★ 10 cited

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…

quant-ph2022★ 197 cited

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…

eess.SP2022★ 1 cited

Cross-modal Learning of Graph Representations using Radar Point Cloud for Long-Range Gesture Recognition

Souvik Hazra, Hao Feng, Gamze Naz Kiprit +5

Gesture recognition is one of the most intuitive ways of interaction and has gathered particular attention for human computer interaction. Radar sensors possess multiple intrinsic…

quant-ph2022★ 17 cited

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…

quant-ph2022★ 6 cited

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…