4 papers
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…
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…
Program Analysis via Multiple Context Free Language Reachability
Giovanna Kobus Conrado, Adam Husted Kjelstrøm, Andreas Pavlogiannis +1
Context-free language (CFL) reachability is a standard approach in static analyses, where the analysis question is phrased as a language reachability problem on a graph wrt a C…
The Decidability and Complexity of Interleaved Bidirected Dyck Reachability
Adam Husted Kjelstrøm, Andreas Pavlogiannis
Dyck reachability is the standard formulation of a large domain of static analyses, as it achieves the sweet spot between precision and efficiency, and has thus been studied extens…