most citedTopological quantum compilation of metaplectic anyons based on the genetic optimized algorithms

3 citations · 4 across the 4 of their papers we have counts for

collaborators

5 papers

quant-ph2026

Universal Quantum Gate Compilation in Anyon Models via Multiple-Braiding

Jiangwei Long, Zihui Liu, Yizhi Li +2

We investigate the capability of multiple-braiding in anyon models to realize universal quantum computation. The multiple elementary braiding matrices (MEBMs) are derived…

quant-ph2025

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

Jiangwei Long, Zihui Liu, Yizhi Li +2

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 Ge…

quant-ph2025

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

Jiangwei Long, Yizhi Li, Jianxin Zhong +1

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-sy…

quant-ph2025★ 1 cited

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

Jiangwei Long, Xuyang Huang, Jianxin Zhong +1

Quantum compiling, which aims to approximate target qubit gates by finding optimal sequences (braidwords) of basic braid operations, constitutes a fundamental challenge in quantum…

quant-ph2025★ 3 cited

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

Jiangwei Long, Jianxin Zhong, Lijun Meng

Topological quantum computing holding global anti-interference ability is realized by braiding some anyons, such as well-known Fibonacci anyons. Here, based on theory we…