3 citations · 6 across the 4 of their papers we have counts for
4 papers
Topological Quantum Compilation Using Mixed-Integer Programming
Pavel Rytir, Phillip C. Burke, Christos Aravanis +2
We introduce the Mixed-Integer Quadratically Constrained Quadratic Programming framework for the quantum compilation problem and apply it in the context of topological quantum comp…
Topological quantum compilation of two-qubit gates
Phillip C. Burke, Christos Aravanis, Johannes Aspman +2
We investigate the topological quantum compilation of two-qubit operations within a system of Fibonacci anyons. Our primary goal is to generate gates that are approximately leakage…
Transpiling Quantum Circuits using the Pentagon Equation
Christos Aravanis, Georgios Korpas, Jakub Marecek
We consider the application of the pentagon equation in the context of quantum circuit compression. We show that if solutions to the pentagon equation are found, one can transpile…
Polynomial Matrix Inequalities within Tame Geometry
Christos Aravanis, Johannes Aspman, Georgios Korpas +1
Polynomial matrix inequalities can be solved using hierarchies of convex relaxations, pioneered by Henrion and Lassere. In some cases, this might not be practical, and one may need…