The construction of a universal quantum gate set for the SU(2)k (k=5,6,7) anyon models via GA-enhanced SK algorithm

• URL: http://arxiv.org/abs/2505.01774v2
• Date: Wed, 28 May 2025 09:47:44 GMT
• Title: The construction of a universal quantum gate set for the SU(2)k (k=5,6,7) anyon models via GA-enhanced SK algorithm
• Authors: Jiangwei Long, Jianxin Zhong, Lijun Meng,
• Abstract summary: We construct a universal quantum gate set for topological quantum computation using SU(2)k anyon models.<n>One-qubit gates were synthesized using a genetic algorithm-enhanced Solovay-Kitaev algorithm (GA-enhanced SKA)<n>We get exact implementations of the local equivalence class [SWAP] using nine EBMs in each SU(2)5, SU(2)6, and SU(2)7 configuration.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study systematically numerical method into constructing a universal quantum gate set for topological quantum computation (TQC) using SU(2)k anyon models. The F-symbol and R-symbol matrices were computed through the q-deformed representation theory of SU(2), enabling precise determination of elementary braiding matrices (EBMs) for SU(2)k anyon systems. Quantum gates were subsequently derived from these EBMs through systematic implementations. One-qubit gates were synthesized using a genetic algorithm-enhanced Solovay-Kitaev algorithm (GA-enhanced SKA), while two-qubit gates were constructed through brute-force search or GA optimization to approximate local equivalence classes of the CNOT gate. Implementing this framework for SU(2)5, SU(2)6, and SU(2)7 models successfully generated the canonical universal gate set {H-gate, T-gate, CNOT-gate}. Comparative benchmarking against the Fibonacci anyon model demonstrate that SU(2)5,6,7 implementations achieve comparable or superior fidelity in gate construction. These numerical results provide conclusive verification of the universal quantum computation capabilities inherent in SU(2)k anyon models. Furthermore, we get exact implementations of the local equivalence class [SWAP] using nine EBMs in each SU(2)5, SU(2)6, and SU(2)7 configuration.

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)
• A Unified Framework for Optimizing Uniformly Controlled Structures in Quantum Circuits [16.36662739600811]
  Unitaries of the form $_cketcbracotimes U_c$ are ubiquitous in quantum algorithms.<n>We study the general decomposition problem for UCG and UCG-like structure.
  arXiv  Detail & Related papers  (2025-12-09T14:56:50Z)
• Topological quantum compilation for non-semisimple Ising anyons via monte carlo simulations [4.355688294943852]
  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.
  arXiv  Detail & Related papers  (2025-11-17T10:01:19Z)
• Implementing a Universal Set of Geometric Quantum Gates through Dressed-State assisted STA [39.27725073249277]
  We analyze the implementation of single-qubit gates in a two-level system driven by a microwave field.<n>We show how the dynamical phase can be canceled to obtain purely geometric operations.<n>We extend the protocol to construct non two-qubit gates, highlighting its feasibility for scalable quantum information processing.
  arXiv  Detail & Related papers  (2025-09-10T16:14:34Z)
• Quantum circuit synthesis with SQiSW [10.12389814746236]
  The SQiSW gate, also known as the square root of iSWAP gate, has garnered considerable attention due to its outstanding experimental performance.<n>We introduce an exact synthesis scheme for Toffoli gate using only 8 SQiSW gates, which is grounded in numerical observation.
  arXiv  Detail & Related papers  (2024-12-19T13:17:43Z)
• Topological quantum compilation of two-qubit gates [0.0]
  We generate gates that are leakage-free and equivalent to the controlled-NOT gate up to single-qubit operations. Most of the generated classes are located near the edges of the Weyl chamber representation of two-qubit gates.
  arXiv  Detail & Related papers  (2024-08-13T18:02:54Z)
• Solving the homogeneous Bethe-Salpeter equation with a quantum annealer [34.173566188833156]
  The homogeneous Bethe-Salpeter equation (hBSE) was solved for the first time by using a D-Wave quantum annealer. A broad numerical analysis of the proposed algorithms was carried out using both the proprietary simulated-anneaing package and the D-Wave Advantage 4.1 system.
  arXiv  Detail & Related papers  (2024-06-26T18:12:53Z)
• One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum Computing [8.478982715648547]
  Scheme for qubits with $XX+YY$ coupling realizes any two-qubit gate up to single-qubit gates. We observe marked improvements across various applications, including generic $n$-qubit gate synthesis, quantum volume, and qubit routing.
  arXiv  Detail & Related papers  (2023-12-09T19:30:31Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Decomposition of Multi-controlled Special Unitary Single-Qubit Gates [1.412197703754359]
  Multi-controlled unitary gates have been a subject of interest in quantum computing since its inception. Current state-of-the-art approach to implementing n-qubit multi-controlled gates involves the use of a quadratic number of single-qubit and CNOT gates. We present a new decomposition of n-qubit multi-controlled SU(2) gates that requires a circuit with a number of CNOT gates proportional to 20n.
  arXiv  Detail & Related papers  (2023-02-13T14:08:53Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• Entangling power of symmetric two-qubit quantum gates [0.0]
  capacity of a quantum gate to produce entangled states on a bipartite system is quantified in terms of the entangling power. We focus on symmetric two-qubit quantum gates, acting on the symmetric two-qubit space. A geometric description of the local equivalence classes of gates is given in terms of the $mathfraksu(3)$ Lie algebra root vectors.
  arXiv  Detail & Related papers  (2021-07-27T08:06:32Z)
• Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach [94.37521840642141]
  We study the correlation clustering problem using the quantum approximate optimization algorithm (QAOA) and qudits. Specifically, we consider a neutral atom quantum computer and propose a full stack approach for correlation clustering. We show the qudit implementation is superior to the qubit encoding as quantified by the gate count.
  arXiv  Detail & Related papers  (2021-06-22T11:07:38Z)
• Synthesis of CNOT-Dihedral circuits with optimal number of two qubit gates [0.0]
  We present explicit canonical forms for all the elements in the two-qubit CNOT-Dihedral group, with minimal numbers of controlled-S (CS) and controlled-X ( CX) gates. We provide an algorithm to successively construct the n-qubit CNOT-Dihedral group, asserting an optimal number of controlled-X ( CX) gates.
  arXiv  Detail & Related papers  (2020-06-22T07:28:15Z)
• 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)

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.