1 citations · 1 across the 3 of their papers we have counts for
3 papers
quant-ph2026
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…
quant-ph2024
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…
quant-ph2024★ 1 cited
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…