109 citations · 116 across the 5 of their papers we have counts for
4 papers · 1 filter
The Subgraph Isomorphism Problem for Port Graphs and Quantum Circuits
Luca Mondada, Pablo Andrés-Martínez
We study a variant of the subgraph isomorphism problem that is of high interest to the quantum computing community. Our results give an algorithm to perform pattern matching in qua…
Unbounded loops in quantum programs: categories and weak while loops
Pablo Andrés-Martínez
Control flow of quantum programs is often divided into two different classes: classical and quantum. Quantum programs with classical control flow have their conditional branching d…
Universal Properties of Partial Quantum Maps
Pablo Andrés-MartíÂ-nez, Chris Heunen, Robin Kaarsgaard
We provide a universal construction of the category of finite-dimensional C*-algebras and completely positive trace-nonincreasing maps from the rig category of finite-dimensional H…
Automated distribution of quantum circuits via hypergraph partitioning
Pablo Andrés-Martínez, Chris Heunen
Quantum algorithms are usually described as monolithic circuits, becoming large at modest input size. Near-term quantum architectures can only manage a small number of qubits. We d…