42 citations · 97 across the 19 of their papers we have counts for
6 papers · 1 filter
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…
A Knowledge Compilation Map for Quantum Information
Lieuwe Vinkhuijzen, Tim Coopmans, Alfons Laarman
Quantum computing is finding promising applications in optimization, machine learning and physics, leading to the development of various models for representing quantum information…
Trade-offs between classical and quantum space using spooky pebbling
Arend-Jan Quist, Alfons Laarman
Pebble games are used to study space/time trade-offs. Recently, spooky pebble games were introduced to study classical space / quantum space / time trade-offs for simulation of cla…