Topological Quantum Compilation Using Mixed-Integer Programming

• URL: http://arxiv.org/abs/2511.09513v1
• Date: Thu, 13 Nov 2025 01:59:15 GMT
• Title: Topological Quantum Compilation Using Mixed-Integer Programming
• Authors: Pavel Rytir, Phillip C. Burke, Christos Aravanis, Jiri Vala, Jakub Marecek,
• Abstract summary: We introduce the Mixed-Integer Quadratically Constrained Quadratic Programming framework for the quantum compilation problem.<n>In this setting, quantum gates are realized by sequences of elementary braids of quasiparticles with exotic fractional statistics.
• Score: 3.4921396791110477
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Quantum Entanglement with Geometric Measures [0.0]
  This thesis extends the geometric measure of entanglement (GME) to introduce and investigate a suite of monotone entanglements tailored for diverse quantum contexts.<n>These monotones are applicable to both bipartite and multipartite systems, offering a unified framework for characterizing entanglement across various scenarios.
  arXiv  Detail & Related papers  (2025-06-13T04:05:03Z)
• Universal quantum computation using Ising anyons from a non-semisimple Topological Quantum Field Theory [0.058331173224054456]
  We propose a framework for topological quantum computation using newly discovered non-semisimple analogs of topological quantum field theories in 2+1 dimensions.<n>We show that the non-semisimple theory introduces new anyon types that extend the Ising framework.
  arXiv  Detail & Related papers  (2024-10-18T21:03:07Z)
• Absolute dimensionality of quantum ensembles [41.94295877935867]
  The dimension of a quantum state is traditionally seen as the number of superposed distinguishable states in a given basis.<n>We propose an absolute, i.e.basis-independent, notion of dimensionality for ensembles of quantum states.
  arXiv  Detail & Related papers  (2024-09-03T09:54:15Z)
• Utilizing Quantum Processor for the Analysis of Strongly Correlated Materials [34.63047229430798]
  This study introduces a systematic approach for analyzing strongly correlated systems by adapting the conventional quantum cluster method to a quantum circuit model. We have developed a more concise formula for calculating the cluster's Green's function, requiring only real-number computations on the quantum circuit instead of complex ones.
  arXiv  Detail & Related papers  (2024-04-03T06:53:48Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
  The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Topological Quantum Programming in TED-K [0.0]
  We describe a fundamental and natural scheme that we are developing, for typed functional (hence verifiable) topological quantum programming. It reflects the universal fine technical detail of topological q-bits, namely of symmetry-protected (or enhanced) topologically ordered Laughlin-type anyon ground states. The language system is under development at the "Center for Quantum and Topological Systems" at the Research Institute of NYU, Abu Dhabi.
  arXiv  Detail & Related papers  (2022-09-17T14:00:37Z)
• No-signalling constrains quantum computation with indefinite causal structure [45.279573215172285]
  We develop a formalism for quantum computation with indefinite causal structures. We characterize the computational structure of higher order quantum maps. We prove that these rules, which have a computational and information-theoretic nature, are determined by the more physical notion of the signalling relations between the quantum systems.
  arXiv  Detail & Related papers  (2022-02-21T13:43:50Z)
• A thorough introduction to non-relativistic matrix mechanics in multi-qudit systems with a study on quantum entanglement and quantum quantifiers [0.0]
  This article provides a deep and abiding understanding of non-relativistic matrix mechanics. We derive and analyze the respective 1-qubit, 1-qutrit, 2-qubit, and 2-qudit coherent and incoherent density operators. We also address the fundamental concepts of quantum nondemolition measurements, quantum decoherence and, particularly, quantum entanglement.
  arXiv  Detail & Related papers  (2021-09-14T05:06:47Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Compiling single-qubit braiding gate for Fibonacci anyons topological quantum computation [0.0]
  Topological quantum computation is an implementation of a quantum computer in a way that radically reduces decoherence. Topological qubits are encoded in the topological evolution of two-dimensional quasi-particles called anyons.
  arXiv  Detail & Related papers  (2020-08-08T15:34:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.