paper

The construction of a universal quantum gate set for the anyon models via genetic optimized algorithm

arXiv:2505.01774 · doi:10.1016/j.physleta.2025.131142

Abstract

We systematically study a numerical method for constructing a universal quantum gate set for topological quantum computation (TQC) using anyon models. The -matrices and -symbols are computed through the -deformed representation theory of , enabling precise determination of elementary braiding matrices (EBMs) for anyon systems. Quantum gates are derived from these EBMs. One-qubit gates are synthesized using a genetic algorithm-enhanced Solovay--Kitaev algorithm (GA-enhanced SKA), while two-qubit gates are constructed through brute-force search or GA optimization to approximate the local equivalence class . Implementing this framework for the , , and models successfully generates the canonical universal gate set . These numerical results provide conclusive verification of the universal quantum computation capabilities inherent in anyon models. Furthermore, we obtain exact implementations of the local equivalence class using nine EBMs in each model.

arXiv comment29 pages, 5 figures

References in corpus (42)