Paper Info
Title
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. DOI: 10.1103/PhysRevB.87.054414
Year
DOI
Venue
2012
10.1103/PhysRevB.87.054414
PHYSICAL REVIEW B
Field
DocType
Volume
Heuristic,Braid,Quantum gate,Matrix (mathematics),Quantum computer,Topological quantum computer,Quasiparticle,Condensed matter physics,Physics
Journal
87
Issue
ISSN
Citations 
5
1098-0121
2
PageRank 
References 
Authors
0.38
0
2
Name
Order
Citations
PageRank
Ross B. McDonald130.74
Helmut G. Katzgraber2165.02