most citedDecision Diagrams for Quantum Computing

23 citations · 40 across the 5 of their papers we have counts for

collaborators

5 papers

quant-ph2023

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…

quant-ph20231 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-ph202323 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-ph20236 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-ph202310 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…