1 citations · 1 across the 3 of their papers we have counts for
5 papers · 1 filter
Faster algorithm for achieving minimal-size quantum decision diagrams
Juul Sanders, Sebastiaan Brand, Arend-Jan Quist +1
The decision diagram (DD) data structure enables fast linear-algebra calculations by bringing vectors into a normal form and subsequently merging equivalent ones, yielding a minima…
From Tensor Networks to Tractable Circuits, and back
Arend-Jan Quist, Marc Farreras Bartra, Alexis de Colnet +2
Tensor networks and circuits are widely used data structures to represent pseudo-Boolean functions. These two formalisms have been studied primarily in separate communities, and th…
Exact quantum decision diagrams with scaling guarantees for Clifford+ circuits and beyond
Arend-Jan Quist, Tim Coopmans, Alfons Laarman
A decision diagram (DD) is a graph-like data structure for homomorphic compression of Boolean and pseudo-Boolean functions. Over the past decades, decision diagrams have been succe…
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…
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…