76 citations · 276 across the 15 of their papers we have counts for
16 papers
Node Replacement based Approximate Quantum Simulation with Decision Diagrams
Yexin Yan, Stefan Hillmich, Robert Wille +1
Simulating a quantum circuit with a classical computer requires exponentially growing resources. Decision diagrams exploit the redundancies in quantum circuit representation to eff…
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…
Shuttling for Scalable Trapped-Ion Quantum Computers
Daniel Schoenberger, Stefan Hillmich, Matthias Brandl +1
Trapped-ion quantum computers exhibit promising potential to provide platforms for high-quality qubits and reliable quantum computation. The Quantum Charge Coupled Device (QCCD) ar…
Using Boolean Satisfiability for Exact Shuttling in Trapped-Ion Quantum Computers
Daniel Schoenberger, Stefan Hillmich, Matthias Brandl +1
Trapped ions are a promising technology for building scalable quantum computers. Not only can they provide a high qubit quality, but they also enable modular architectures, referre…
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…
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…
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…
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…
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…
Tools for Quantum Computing Based on Decision Diagrams
Robert Wille, Stefan Hillmich, Lukas Burgholzer
With quantum computers promising advantages even in the near-term NISQ era, there is a lively community that develops software and toolkits for the design of corresponding quantum…
Decision Diagrams for Quantum Measurements with Shallow Circuits
Stefan Hillmich, Charles Hadfield, Rudy Raymond +2
We consider the problem of estimating quantum observables on a collection of qubits, given as a linear combination of Pauli operators, with shallow quantum circuits consisting of s…
As Accurate as Needed, as Efficient as Possible: Approximations in DD-based Quantum Circuit Simulation
Stefan Hillmich, Richard Kueng, Igor L. Markov +1
Quantum computers promise to solve important problems faster than conventional computers. However, unleashing this power has been challenging. In particular, design automation runs…
Exploiting Quantum Teleportation in Quantum Circuit Mapping
Stefan Hillmich, Alwin Zulehner, Robert Wille
Quantum computers are constantly growing in their number of qubits, but continue to suffer from restrictions such as the limited pairs of qubits that may interact with each other.…
Just Like the Real Thing: Fast Weak Simulation of Quantum Computation
Stefan Hillmich, Igor L. Markov, Robert Wille
Quantum computers promise significant speedups in solving problems intractable for conventional computers but, despite recent progress, remain limited in scaling and availability.…
Approximation of Quantum States Using Decision Diagrams
Alwin Zulehner, Stefan Hillmich, Igor L. Markov +1
The computational power of quantum computers poses major challenges to new design tools since representing pure quantum states typically requires exponentially large memory. As sho…
How to Efficiently Handle Complex Values? Implementing Decision Diagrams for Quantum Computing
Alwin Zulehner, Stefan Hillmich, Robert Wille
Quantum computing promises substantial speedups by exploiting quantum mechanical phenomena such as superposition and entanglement. Corresponding design methods require efficient me…