42 citations · 97 across the 19 of their papers we have counts for
20 papers
Quantum state preparation for weighted d-DNNF
Steef Hegeman, Joon Hyung Lee, Alfons Laarman
The quantum state preparation problem is to, given a description of a quantum state, efficiently generate a quantum circuit computing the state. We show that for quantum states des…
Optimization and Synthesis of Quantum Circuits with Global Gates
Alejandro Villoria, Henning Basold, Alfons Laarman
Compiling quantum circuits to account for hardware restrictions is an essential part of the quantum computing stack. Circuit compilation allows us to adapt algorithm descriptions i…
Advancing Quantum Computing with Formal Methods
Arend-Jan Quist, Jingyi Mei, Tim Coopmans +1
This tutorial introduces quantum computing with a focus on the applicability of formal methods in this relatively new domain. We describe quantum circuits and convey an understandi…
Compact Parallel Hash Tables on the GPU
Steef Hegeman, Daan Wöltgens, Anton Wijs +1
On the GPU, hash table operation speed is determined in large part by cache line efficiency, and state-of-the-art hashing schemes thus divide tables into cache line-sized buckets.…
Equivalence Checking of Quantum Circuits by Model Counting
Jingyi Mei, Tim Coopmans, Marcello Bonsangue +1
Verifying equivalence between two quantum circuits is a hard problem, that is nonetheless crucial in compiling and optimizing quantum algorithms for real-world devices. This paper…
Simulating Quantum Circuits by Model Counting
Jingyi Mei, Marcello Bonsangue, Alfons Laarman
Quantum circuit compilation comprises many computationally hard reasoning tasks that nonetheless lie inside # and its decision counterpart in . The classic…