2 citations · 4 across the 14 of their papers we have counts for
15 papers
Generalized LIMDDs: Succinctness and Canonicity for Decision Diagrams Modulo a Group
Arend-Jan Quist, Alexis de Colnet, Thomas Reps +1
A reduced ordered decision diagram is the minimal automaton of a function on words of fixed length: its nodes are the residuals, and reduction is the Myhill--Nerode quotient. We st…
Quokka#: Quantum Computing with #SAT
Jingyi Mei, Dekel Zak, Muhammad Osama +2
We present Quokka#, a versatile, open-source Python library for quantum circuit analysis. Quokka# reduces various simulation, verification, and synthesis tasks to weighted model co…
Quantum Algorithms for Magic Square Diophantine Equations
Dimitrios Thanos, Marcello Bonsangue, Alfons Laarman
Magic-square constraints define Diophantine systems whose solutions, in several natural families, exhibit rigid periodic structure. We study this structure in an oracle setting, wh…
Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
Alexis de Colnet, Floris Geerts, Rihan Hai +3
Strongly simulating a quantum circuit, that is, computing an output amplitude, can be done by summing the circuit's Feynman paths: a weighted count over assignments to Boolean path…
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…
Equivalence Checking of Quantum Circuits via Path-Sum and Weighted Model Counting
Wei-Jia Huang, Christophe Chareton, Yu-Fang Chen +4
Equivalence checking of quantum circuits is a central verification task in quantum computing, ensuring the correctness of circuit optimizations, hardware mappings, and compilation…
Search-Driven Clause Learning for Product-State Quantum -SAT (PRODSAT-QSAT)
Samuel González-Castillo, Joon Hyung Lee, Alfons Laarman
We study PRODSAT-QSAT(): given rank-one -local projectors, determine whether a quantum -SAT instance admits a satisfying product state. We present a CDCL-style refutation…
GPU-Accelerated Quantum Simulation of Stabilizer Circuits
Muhammad Osama, Dimitrios Thanos, Alfons Laarman
We introduce new parallel algorithms for efficiently simulating stabilizer (Clifford) circuits on GPUs, with a focus on data-parallel tableau evolution and scalable handling of pro…
The Compilability Thresholds of 2-CNF to OBDD
Alexis de Colnet, Alfons Laarman, Joon Hyung Lee
We prove the existence of two thresholds regarding the compilability of random 2-CNF formulas to OBDDs. The formulas are drawn from , the uniform distribution…
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…
Uniformity within Parameterized Circuit Classes
Steef Hegeman, Jan Martens, Alfons Laarman
We study uniformity conditions for parameterized Boolean circuit families. Uniformity conditions require that the infinitely many circuits in a circuit family are in some sense eas…
Quantum Physics using Weighted Model Counting
Dirck van den Ende, Joon Hyung Lee, Alfons Laarman +1
Weighted model counting (WMC) has proven effective at a range of tasks within computer science, physics, and beyond. However, existing approaches for using WMC in quantum physics o…
Numerical Errors in Quantitative System Analysis With Decision Diagrams
Sebastiaan Brand, Arend-Jan Quist, Richard M. K. van Dijk +1
Decision diagrams (DDs) are a powerful data structure that is used to tackle the state-space explosion problem, not only for discrete systems, but for probabilistic and quantum sys…
Q-Sylvan: A Parallel Decision Diagram Package for Quantum Computing
Sebastiaan Brand, Alfons Laarman
As physical realizations of quantum computers move closer towards practical applications, the need for tools to analyze and verify quantum algorithms grows. Among the algorithms an…
Reducing Quantum Circuit Synthesis to #SAT
Dekel Zak, Jingyi Mei, Jean-Marie Lagniez +1
Quantum circuit synthesis is the task of decomposing a given quantum operator into a sequence of elementary quantum gates. Since the finite target gate set cannot exactly implement…