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)
- Fault-tolerant quantum computation by anyons
- Non-Abelian Anyons and Topological Quantum Computation
- Surface codes: Towards practical large-scale quantum computation
- Realizing Majorana zero modes in superconductor-semiconductor heterostructures
- Majorana quantization and half-integer thermal quantum Hall effect in a Kitaev spin liquid
- Fault-tolerant quantum computation with high threshold in two dimensions
- Roads towards fault-tolerant universal quantum computation
- High threshold universal quantum computation on the surface code
- A geometric theory of non-local two-qubit operations
- Majorana Fermions and Topology in Superconductors
- Nonlocal properties of two-qubit gates and mixed states and optimization of quantum computations
- A Short Introduction to Topological Quantum Computation
- Braid Topologies for Quantum Computation
- Introduction to topological quantum computation with non-Abelian anyons
- The two-eigenvalue problem and density of Jones representation of braid groups
- Asymptotically Optimal Topological Quantum Compiling
- Universal Quantum Computation with Metaplectic Anyons
- Ordered and tunable Majorana-zero-mode lattice in naturally strained LiFeAs
- Fibonacci anyons and charge density order in the 12/5 and 13/5 plateaus
- Topological Quantum Compiling
- Topological Quantum Compiling with Reinforcement Learning
- Hunting for Majoranas
- Theory of Majorana zero modes in unconventional superconductors
- Fibonacci Anyons From Abelian Bilayer Quantum Hall States
- Topological Entanglement Entropy with a Twist
- Fault-Tolerant Quantum Gates with Defects in Topological Stabiliser Codes
- Universal Gates via Fusion and Measurement Operations on SU Anyons
- Constructing Functional Braids for Low-Leakage Topological Quantum Computing
- Fibonacci anyons versus Majorana fermions
- Quantum hashing with the icosahedral group
- Tunable vortex Majorana modes controlled by strain in homogeneous LiFeAs
- Systematically generated two-qubit anyon braids
- Braid Matrices and Quantum Gates for Ising Anyons Topological Quantum Computation
- Genetic braid optimization: A heuristic approach to compute quasiparticle braids
- Unified approach to topological quantum computation with anyons: From qubit encoding to Toffoli gate
- Detecting Majorana fermions by use of superconductor-quantum Hall liquid junctions
- Universal quantum computation using Ising anyons from a non-semisimple Topological Quantum Field Theory
- Topological quantum compilation of metaplectic anyons based on the genetic optimized algorithms
- Topological quantum compilation of two-qubit gates
- Optimized Topological Quantum Compilation of Three-Qubit Controlled Gates in the Fibonacci Anyon Model: A Controlled-Injection Approach
- Genetic algorithm enhanced Solovay-Kitaev algorithm for quantum compiling of Fibonacci anyons
- Entangling gates from cabling of knots