From the 1 of 11 linked papers with an AI index.
11 papers
Random Generation of Small Quantitative Automata for Algorithm Debugging
Mikael Bisgaard Dahlsen-Jensen, Jaco van de Pol
The paper presents a framework that automatically generates small, non‑degenerate quantitative automata, checks them against a target property, and shrinks any violations to minima…
State-Space Abstractions for Parametric Timed Games
Mikael Bisgaard Dahlsen-Jensen, Laure Petrucci, Jaco van de Pol
Synthesizing controllers for real-time systems under both timing uncertainty and adversarial environments requires exploring prohibitively large symbolic state spaces. While zone i…
Efficient Simulation of High-Level Quantum Gates
Adam Husted Kjelstrøm, Andreas Pavlogiannis, Jaco van de Pol
Quantum circuit simulation is paramount to the verification and optimization of quantum algorithms, and considerable research efforts have been made towards efficient simulators. W…
Multi-variable Quantification of BDDs in External Memory using Nested Sweeping (Extended Paper)
Steffan Christ Sølvsten, Jaco van de Pol
Previous research on the Adiar BDD package has been successful at designing algorithms capable of handling large Binary Decision Diagrams (BDDs) stored in external memory. To do so…
Exact Quantum Circuit Optimization is co-NQP-hard
Adam Husted Kjelstrøm, Andreas Pavlogiannis, Jaco van de Pol
As quantum computing resources remain scarce and error rates high, minimizing the resource consumption of quantum circuits is essential for achieving practical quantum advantage. H…
Practical Subarchitectures for Optimal Quantum Layout Synthesis
Kostiantyn V. Milkevych, Jaco van de Pol, Irfansha Shaik
Quantum Layout Synthesis (QLS) maps a logical quantum circuit to a physical quantum platform. Optimal QLS minimizes circuit size and depth, which is essential to reduce the noise o…