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 2023 · quant-phShow all

13 papers · 2 filters

quant-ph2023★ 1 cited

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…

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★ 2 cited

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…

quant-ph2023

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…

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★ 1 cited

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…

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

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…

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★ 38 cited

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…

quant-ph2023★ 1 cited

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…

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…