Topological quantum compilation for non-semisimple Ising anyons via monte carlo simulations

• URL: http://arxiv.org/abs/2511.13194v1
• Date: Mon, 17 Nov 2025 10:01:19 GMT
• Title: Topological quantum compilation for non-semisimple Ising anyons via monte carlo simulations
• Authors: Jiangwei Long, Yizhi Li, Jianxin Zhong, Lijun Meng,
• Abstract summary: We present a systematic numerical construction of a universal quantum gate set for topological quantum computation.<n>We achieve high-fidelity approximations of standard one-qubit gates.<n>This work establishes a new pathway towards universal quantum computation using non-semisimple Ising anyons.
• Score: 4.355688294943852
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a systematic numerical construction of a universal quantum gate set for topological quantum computation based on the non-semisimple Ising anyons model. Using the elementary braiding matrices (EBMs) of this model by the Monte Carlo-enhanced Solovay-Kitaev algorithm (MC-enhanced SKA), we achieve high-fidelity approximations of standard one-qubit gates (Hadamard H-gate and phase T-gate). Remarkably, a recursion level of just three suffices to meet the fidelity requirements for fault-tolerant quantum computation. Our numerical results demonstrate that for the parameter α /in (2, 2.031], a single braiding operation can approximate the local equivalence class [CNOT] with high precision and great unitary measurement. Specifically, at α = 2.031, 2.047, and 2.063, we successfully construct a universal gate set {H-gate, T-gate, CNOT-gate} with high accuracy. This work establishes a new pathway towards universal quantum computation using non-semisimple Ising anyons.

Related papers

• Realizing a Universal Quantum Gate Set via Double-Braiding of SU(2)k Anyon Models [7.648391361564701]
  We investigate the implementation of a universal gate set via double-braiding within SU(2)k anyon models.<n>For two-qubit entangling gates, Genetic Algorithm (GA) yields braidwords of 30 braiding operations that approximate the local equivalence class [CNOT]<n>Our numerical results provide strong evidence that double-braiding in SU(2)k anyons models is capable of universal quantum computation.
  arXiv  Detail & Related papers  (2026-02-17T03:11:09Z)
• Universal Quantum Computation with the $S_3$ Quantum Double: A Pedagogical Exposition [0.0]
  We show how anyon braiding and measurement in $S_3$ TO are primitives for topological quantum computation.<n>This provides a roadmap for near-term quantum platforms.
  arXiv  Detail & Related papers  (2025-02-20T19:07:31Z)
• Tensor decomposition technique for qubit encoding of maximal-fidelity Lorentzian orbitals in real-space quantum chemistry [0.0]
  We propose an efficient scheme for encoding an MO as a many-qubit state from a Gaussian-type solution.<n>We demonstrate via numerical simulations that the proposed scheme is a powerful tool for encoding MOs of various quantum chemical systems.
  arXiv  Detail & Related papers  (2025-01-13T11:08:20Z)
• Topological quantum compilation of metaplectic anyons based on the genetic optimized algorithms [0.0]
  We obtain a total of 6 anyon models utilizing textitF-matrices, textitR-symbols, and fusion rules of metaplectic anyon.<n>For one-qubit case, the classical textitH- and textitT-gate can be well constructed using the genetic algorithm enhanced Solovay-Kitaev algorithm.
  arXiv  Detail & Related papers  (2025-01-03T10:18:16Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Linear Circuit Synthesis using Weighted Steiner Trees [45.11082946405984]
  CNOT circuits are a common building block of general quantum circuits. This article presents state-of-the-art algorithms for optimizing the number of CNOT gates. A simulated evaluation shows that the suggested is almost always beneficial and reduces the number of CNOT gates by up to 10%.
  arXiv  Detail & Related papers  (2024-08-07T19:51:22Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• 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)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

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.