Topological Quantum Compilation Using Mixed-Integer Programming

Read full text
Authors: Pavel Rytíř, Phillip C. Burke, Christos Aravanis, Jiří Vála, Jakub Mareček
Cited by: 0
References: 51

Abstract

We introduce the Mixed-Integer Quadratically Constrained Quadratic Programming framework for the quantum compilation problem and apply it in the context of topological quantum computing. In this setting, quantum gates are realized by sequences of elementary braids of quasiparticles with exotic fractional statistics in certain two-dimensional topological condensed matter systems, described by effective topological quantum field theories. We specifically focus on a non-semisimple version of topological field theory, which provides a foundation for an extended theory of Ising anyons and which has recently been shown by Iulianelli et al., Nature Communications {\bf 16}, 6408 (2025), to permit universal quantum computation. While the proofs of this pioneering result are existential in nature, the mixed integer programming provides an approach to explicitly construct quantum gates in topological systems. We demonstrate this by focusing specifically on the entangling controlled-NOT operation, and its local equivalence class, using braiding operations in the non-semisimple Ising system. This illustrates the utility of the Mixed-Integer Quadratically Constrained Quadratic Programming for topological quantum compilation.

Fields of Study & Subjects

Quantum Computing Algorithms and Architecture Quantum Information and Cryptography Quantum many-body systems

Publication details

Journal / source
IEEE Transactions on Quantum Engineering
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Volume
7
Pages
3104212–3104212
Publication date
1 January 2026
Language
EN