47 citations · 120 across the 7 of their papers we have counts for
7 papers · 1 filter
Automatically Refining Assertions for Efficient Debugging of Quantum Programs
Damian Rovara, Lukas Burgholzer, Robert Wille
As new advancements in the field of quantum computing lead to the development of increasingly complex programs, approaches to validate and debug these programs are becoming more im…
Stripping Quantum Decision Diagrams of their Identity
Aaron Sander, Ioan-Albert Florea, Lukas Burgholzer +1
Classical representations of quantum states and operations as vectors and matrices are plagued by an exponential growth in memory and runtime requirements for increasing system siz…
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…
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…
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…