Genetic algorithm enhanced Solovay-Kitaev algorithm for quantum compiling of Fibonacci anyons
arXiv:2501.01746 · doi:10.1088/1402-4896/ae1d30
Abstract
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.
16 pages, 6 figures
References in corpus (19)
- Non-Abelian Anyons and Topological Quantum Computation
- Signatures of Majorana fermions in hybrid superconductor-semiconductor nanowire devices
- Surface codes: Towards practical large-scale quantum computation
- Evidence for Majorana bound state in an iron-based superconductor
- High threshold universal quantum computation on the surface code
- Observation of half-integer thermal Hall conductance
- Resonantly-paired fermionic superfluids
- Braid Topologies for Quantum Computation
- A Periodic Genetic Algorithm with Real-Space Representation for Crystal Structure and Polymorph Prediction
- Introduction to topological quantum computation with non-Abelian anyons
- Asymptotically Optimal Topological Quantum Compiling
- Fibonacci anyons and charge density order in the 12/5 and 13/5 plateaus
- Topological Quantum Compiling
- Topological Quantum Compiling with Reinforcement Learning
- Fibonacci Anyons From Abelian Bilayer Quantum Hall States
- Kondo-based Qubits for Topological Quantum Computation
- Fibonacci anyons versus Majorana fermions
- Quantum hashing with the icosahedral group
- Genetic braid optimization: A heuristic approach to compute quasiparticle braids