2 citations · 3 across the 7 of their papers we have counts for
10 papers · 1 filter
Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
Alexis de Colnet, Floris Geerts, Rihan Hai +4
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…
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…
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…
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…
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…