output
20122026
most citedMQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing

197 citations

Showing quant-phShow all

32 papers · 1 filter

quant-ph2025★ 4 cited

Large-scale stochastic simulation of open quantum systems

Aaron Sander, Maximilian Fröhlich, Martin Eigel +6

Understanding the precise interaction mechanisms between quantum systems and their environment is crucial for advancing stable quantum technologies, designing reliable experimental…

quant-ph2024★ 2 cited

Equivalence checking of quantum circuits via intermediary matrix product operator

Aaron Sander, Lukas Burgholzer, Robert Wille

As quantum computing advances, the complexity of quantum circuits is rapidly increasing, driving the need for robust methods to aid in their design. Equivalence checking plays a vi…

quant-ph2024★ 14 cited

Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes

Tom Peham, Ludwig Schmid, Lucas Berent +2

A central ingredient in fault-tolerant quantum algorithms is the initialization of a logical state for a given quantum error-correcting code from a set of noisy qubits. A scheme th…

quant-ph2024★ 4 cited

Mixed-Dimensional Qudit State Preparation Using Edge-Weighted Decision Diagrams

Kevin Mato, Stefan Hillmich, Robert Wille

Quantum computers have the potential to solve important problems which are fundamentally intractable on a classical computer. The underlying physics of quantum computing platforms…

quant-ph2024★ 28 cited

Localized statistics decoding for quantum low-density parity-check codes

Timo Hillmann, Lucas Berent, Armanda O. Quintavalle +3

Quantum low-density parity-check codes are a promising candidate for fault-tolerant quantum computing with considerably reduced overhead compared to the surface code. However, the…

quant-ph2024★ 4 cited

Multi-controlled Phase Gate Synthesis with ZX-calculus applied to Neutral Atom Hardware

Korbinian Staudacher, Ludwig Schmid, Johannes Zeiher +2

Quantum circuit synthesis describes the process of converting arbitrary unitary operations into a gate sequence of a fixed universal gate set, usually defined by the operations nat…

quant-ph2023★ 11 cited

Analog information decoding of bosonic quantum LDPC codes

Lucas Berent, Timo Hillmann, Jens Eisert +2

Quantum error correction is crucial for scalable quantum information processing applications. Traditional discrete-variable quantum codes that use multiple two-level systems to enc…

quant-ph2023★ 24 cited

MQT Predictor: Automatic Device Selection with Device-Specific Circuit Compilation for Quantum Computing

Nils Quetschlich, Lukas Burgholzer, Robert Wille

Fueled by recent accomplishments in quantum computing hardware and software, an increasing number of problems from various application domains are being explored as potential use c…

quant-ph2023★ 11 cited

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…

quant-ph2023★ 5 cited

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…

quant-ph2023★ 12 cited

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…

quant-ph2023★ 23 cited

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…

quant-ph2023★ 6 cited

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…

quant-ph2023★ 10 cited

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…

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…

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…

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…

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★ 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…