197 citations · 850 across the 38 of their papers we have counts for
47 papers
Why Are We Unrolling? The Importance of Structured Quantum Programs for Compilation
Damian Rovara, Daniel Haag, Mark Koch +8
As quantum software stacks scale up to support future fault-tolerant quantum hardware and algorithms, quantum compilation is becoming an increasingly important component of the sta…
Handling Imperfections in Subcircuit Compilation for Linear Optical Quantum Computing
Tobias Forster, Yannick Stade, Andreas Fyrillas +3
Linear Optical Quantum Computing (LOQC) is emerging as a promising technology in large-scale quantum computing. Corresponding devices, including linear optical circuits, are rapidl…
Enabling Neutral Atom Integration: Redesigning Device Models for Universal Quantum Ecosystems
Yannick Stade, Lukas Burgholzer, Ludwig Schmid +1
Quantum computing is transitioning from an academic idea to a practical technology, driven by recent hardware advancements and clear paths toward real-world applications. Universal…
Practical HPCQC Integration with QDMI: A Real-Hardware Case Study with IQM Systems
Lukas Burgholzer, Marcel Walter, Patrick Hopf +7
Quantum computers are moving into HPC centers, and the main challenge is now integration rather than pure hardware access. Many current software paths still depend on vendor-specif…
Integrating Quantum Software Tools with(in) MLIR
Patrick Hopf, Erick Ochoa Lopez, Yannick Stade +6
Compilers transform code into action. They convert high-level programs into executable hardware instructions - a crucial step in enabling reliable and scalable quantum computation.…
Qubit Reuse Beyond Reorder and Reset: Optimizing Quantum Circuits by Fully Utilizing the Potential of Dynamic Circuits
Damian Rovara, Lukas Burgholzer, Robert Wille
Qubit reuse offers a promising way to reduce the hardware demands of quantum circuits, but current approaches are largely restricted to reordering measurements and applying qubit r…
Quantum Hardware-Efficient Selection of Auxiliary Variables for QUBO Formulations
Damian Rovara, Lukas Burgholzer, Robert Wille
The Quantum Approximate Optimization Algorithm (QAOA) requires considered optimization problems to be translated into a compatible format. A popular transformation step in this pip…
Tackling the Challenges of Adding Pulse-level Support to a Heterogeneous HPCQC Software Stack: MQSS Pulse
Jorge Echavarria, Muhammad Nufail Farooqi, Amit Devra +22
We study the problem of adding native pulse-level control to heterogeneous High Performance Computing-Quantum Computing (HPCQC) software stacks, using the Munich Quantum Software S…
The Munich Quantum Software Stack: Connecting End Users, Integrating Diverse Quantum Technologies, Accelerating HPC
Lukas Burgholzer, Jorge Echavarria, Patrick Hopf +11
Quantum computing is advancing rapidly in hardware and algorithms, but broad accessibility demands a comprehensive, efficient, unified software stack. Such a stack must flexibly sp…
A Framework for the Efficient Evaluation of Runtime Assertions on Quantum Computers
Damian Rovara, Lukas Burgholzer, Robert Wille
The continuous growth of quantum computing and the increasingly complex quantum programs resulting from it lead to unprecedented obstacles in ensuring program correctness. Runtime…
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…
A Framework for Debugging Quantum Programs
Damian Rovara, Lukas Burgholzer, Robert Wille
Recent advancements in quantum computing software are gradually increasing the scope and size of quantum programs being developed. At the same time, however, these larger programs…
Towards Supporting QIR: Steps for Adopting the Quantum Intermediate Representation
Yannick Stade, Lukas Burgholzer, Robert Wille
Intermediate representations (IRs) play a crucial role in the software stack of a quantum computer to facilitate efficient optimizations for executing an application on hardware. O…
Optimal State Preparation for Logical Arrays on Zoned Neutral Atom Quantum Computers
Yannick Stade, Ludwig Schmid, Lukas Burgholzer +1
Quantum computing promises to solve problems previously deemed infeasible. However, high error rates necessitate quantum error correction for practical applications. Seminal experi…
MQT Qudits: A Software Framework for Mixed-Dimensional Quantum Computing
Kevin Mato, Martin Ringbauer, Lukas Burgholzer +1
Quantum computing holds great promise for surpassing the limits of classical devices in many fields. Despite impressive developments, however, current research is primarily focused…
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…
An Abstract Model and Efficient Routing for Logical Entangling Gates on Zoned Neutral Atom Architectures
Yannick Stade, Ludwig Schmid, Lukas Burgholzer +1
Recent experimental achievements have demonstrated the potential of neutral atom architectures for fault-tolerant quantum computing. These architectures feature the dynamic rearran…
Towards Application-Aware Quantum Circuit Compilation
Nils Quetschlich, Florian J. Kiwit, Maximilian A. Wolf +4
Quantum computing has made tremendous improvements in both software and hardware that have sparked interest in academia and industry to realize quantum computing applications. To t…
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…
Forward and Backward Constrained Bisimulations for Quantum Circuits using Decision Diagrams
Lukas Burgholzer, Antonio Jiménez-Pastor, Kim G. Larsen +3
Efficient methods for the simulation of quantum circuits on classic computers are crucial for their analysis due to the exponential growth of the problem size with the number of qu…
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…
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…
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…