arXiv subjects

Jiangwei Long

Publications and source records attributed to Jiangwei Long.

5 recordsLinked to original sources

arXiv2026

Universal Quantum Gate Compilation in $SU(2)_k$ Anyon Models via Multiple-Braiding

We investigate the capability of multiple-braiding in $SU(2)_k$ anyon models to realize universal quantum computation. The multiple elementary braiding matrices (MEBMs) are derived from the $q$-deformed representation theory of $SU(2)$. Through a general analysis of the MEBMs, we find that multiple-braiding loses its universality only when the braiding multiplicity $m$ causes the MEBMs to collapse to a scalar (up to a global phase). Our numerical analysis of the MEBMs of $SU(2)_k$ anyon models with $k = 3, 5, 6, 7$, and $m \in [2, 9]$, shows that the values of $m$ at which the braid group representation fails to be dense agree exactly with the theoretical prediction. For those $m$ that support universality, single-qubit gates are compiled to high precision by a genetic algorithm-enhanced Solovay-Kitaev algorithm (GA-enhanced SKA), and a genetic algorithm (GA) search with progressively increasing braid length yields an approximately the local equivalence class $[CNOT]$. Notably, even-order braiding operations offer a physical advantage by reducing the number of non-Abelian anyons required in braiding-based topological quantum computation (TQC). Our analytical and numerical results together provide strong evidence for identifying which braiding multiplicities $m$ support universal quantum computation in $SU(2)_k$ anyon models.

quant-ph↗

arXiv2025

High-Fidelity Universal Quantum Gate Compilation for Non-semisimple Ising Anyons via Genetic Algorithm-Optimized Solovay-Kitaev Decomposition

We present a systematic numerical construction of a universal quantum gate set for topological quantum computation based on the non-semisimple Ising anyons model. By employing a Genetic Algorithm-enhanced Solovay-Kitaev Algorithm (GA-enhanced SKA), we achieve high-fidelity approximations of standard single-qubit gates (Hadamard H-gate and phase T-gate) with a recursion level of just three, meeting the fidelity requirements for fault-tolerant quantum computation. Our numerical results demonstrate that for the critical parameter range {\alpha} \in [2.001, 2.022], a few braiding operations can approximate the local equivalence class [CNOT] with high precision. Specifically, at {\alpha} =2.012, 2.015, 2.020, and 2.022, we successfully construct a universal gate set {H, T, CNOT} with leakage errors of two-qubit gate below 0.07,0.08,0.09 and 0.10, respectively. This work establishes a new pathway towards universal quantum computation using non-semisimple Ising anyons, overcoming the limitations of traditional Ising models through optimized braiding sequences and Genetic Algorithm-driven compilation.

quant-ph↗

arXiv2025

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

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-matrices and R-symbol 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 derived from these EBMs. 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 [CNOT]. 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}. 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 model.

quant-ph↗

arXiv2025

Genetic algorithm enhanced Solovay-Kitaev algorithm for quantum compiling of Fibonacci anyons

Quantum compiling, which aims to approximate target qubit gates by finding optimal sequences (braidwords) of basic braid operations, constitutes a fundamental challenge in quantum computing. We develop a genetic algorithm (GA)-enhanced Solovay-Kitaev algorithm (SKA) for approximating single-qubit gates using four elementary braiding matrices (EBMs) derived from Fibonacci anyons. The GA-enhanced SKA demonstrates robust performance, efficiently identifying optimal braidwords within exponentially large search spaces. Notably, the approximation precision achieved by our method surpasses that of Monte Carlo (MC)-enhanced SKA and becomes comparable to deep reinforcement learning (RL) approaches when braidword lengths exceed 25. Implementing 2- and 3-order approximations with the GA-enhanced SKA yields optimal braidword (initial braiding lengths l0=50 and 30 respectively) achieving gate distances of 5.9*10-7 - sufficient precision for most quantum computing applications. This work develops an optimized compilation framework for non-Abelian anyon gates, providing an essential methodology for enhancing future topological quantum computation architectures through gate optimization.

quant-ph↗

arXiv2025

Topological quantum compilation of metaplectic anyons based on the genetic optimized algorithms

Topological quantum computing holding global anti-interference ability is realized by braiding some anyons, such as well-known Fibonacci anyons. Here, based on $SO(3)_2 $ theory we obtain a total of 6 anyon models utilizing \textit{F}-matrices, \textit{R}-symbols, and fusion rules of metaplectic anyon.We obtain the elementary braiding matrices (EBMs) by means of unconventional encoding. After braiding \textit{X} and $X^\prime$, we insert a pair of \textit{Z} anyons into them to ensure that the initial order of anyons remains unchanged. In this process only fusion is required, and measurement is not necessary. Three of them $\{V^{113}_3,V^{131}_3,V^{133}_1\}$ are studied in detail. We study systematically the compilation of these three models through EBMs obtained analytically. For one-qubit case, the classical \textit{H}- and \textit{T}-gate can be well constructed using the genetic algorithm enhanced Solovay-Kitaev algorithm (GA-enhanced SKA) by $\{V^{113}_3,V^{131}_3,V^{133}_1\}$. The obtained accuracy of the \textit{H}/\textit{T}-gate by $\{V^{113}_3,V^{133}_1\}$ is slightly inferior to the corresponding gates of the Fibonacci anyon model, but it also can meet the requirements of fault-tolerant quantum computing, $V^{131}_3$ giving the best performance of these four models. For the two-qubit case, we use the exhaustive method for short lengths and the GA for long lengths to obtain braidword for $\{V^{113}_3,V^{131}_3,V^{133}_1\}$ models. The resulting matrices can well approximate the local equivalence class of the CNOT-gate, while demonstrating a much smaller error than the Fibonacci model, especially for the $V^{113}_3$.The braiding processes of conventional encoding (using identical anyons) and unconventional encoding (using distinct anyons) are compared. Finally, we attempt to generalize the model to the \textit{N}-qubit case.

quant-ph↗