works on

From the 1 of 11 linked papers with an AI index.

collaborators
Showing quant-phShow all

8 papers · 1 filter

quant-ph2026

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…

quant-ph2026

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…

quant-ph2025

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…

quant-ph2025

Depth-Optimal Quantum Layout Synthesis as SAT

Anna B. Jakobsen, Anders B. Clausen, Jaco van de Pol +1

Quantum circuits consist of gates applied to qubits. Current quantum hardware platforms impose connectivity restrictions on binary CX gates. Hence, Layout Synthesis is an important…

quant-ph2025

On Exact Sizes of Minimal CNOT Circuits

Jens Emil Christensen, Søren Fuglede Jørgensen, Andreas Pavlogiannis +1

Computing a minimum-size circuit that implements a certain function is a standard optimization task. We consider circuits of CNOT gates, which are fundamental binary gates in rever…

quant-ph2025

CNOT-Optimal Clifford Synthesis as SAT

Irfansha Shaik, Jaco van de Pol

Clifford circuit optimization is an important step in the quantum compilation pipeline. Major compilers employ heuristic approaches. While they are fast, their results are often su…