Genetic braid optimization: A heuristic approach to compute quasiparticle braids

Abstract

In topologically-protected quantum computation, quantum gates can be carried out by adiabatically braiding two-dimensional quasiparticles, reminiscent of entangled world lines. Bonesteel et al. [Phys. Rev. Lett. 95, 140503 (2005)], as well as Leijnse and Flensberg [Phys. Rev. B 86, 104511 (2012)] recently provided schemes for computing quantum gates from quasiparticle braids. Mathematically, the problem of executing a gate becomes that of finding a product of the generators (matrices) in that set that approximates the gate best, up to an error. To date, efficient methods to compute these gates only strive to optimize for accuracy. We explore the possibility of using a generic approach applicable to a variety of braiding problems based on evolutionary (genetic) algorithms. The method efficiently finds optimal braids while allowing the user to optimize for the relative utilities of accuracy and/or length. Furthermore, when optimizing for error only, the method can quickly produce efficient braids.

6 pages 4 figures

References in corpus (13)

• Topological Quantum Distillation
• Detecting Non-Abelian Statistics in the nu=5/2 Fractional Quantum Hall State
• Atomic quantum simulator for lattice gauge theories and ring exchange models
• Three dimensional resonating valence bond liquids and their excitations
• Topological Quantum Compiling
• A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
• Topological Quantum Computing with Read-Rezayi States
• Spin liquid phase in a $S=1/2$ quantum magnet on the kagome lattice
• An extended Hubbard model with ring exchange: a route to a non-Abelian topological phase
• Using hybrid topological-spin qubit systems for two-qubit-spin gates
• Constructing Functional Braids for Low-Leakage Topological Quantum Computing
• Transport in the Laughlin quasiparticle interferometer: Evidence for topological protection in an anyonic qubit
• Engineering exotic phases for topologically-protected quantum computation by emulating quantum dimer models

Cited by in corpus (2)

• A genetic-algorithm-based method to find the unitary transformations for any de- sired quantum computation and application to a one-bit oracle decision problem
• A probabilistic evolutionary optimization approach to compute quasiparticle braids