A probabilistic evolutionary optimization approach to compute quasiparticle braids

2014-10-02 · Roberto Santana, Ross B. McDonald, Helmut G. Katzgraber

Topological quantum computing is an alternative framework for avoiding the quantum decoherence problem in quantum computation. The problem of executing a gate in this framework can be posed as the problem of braiding quasiparticles. Because these are not Abelian, the problem can be reduced to finding an optimal product of braid generators where the optimality is defined in terms of the gate approximation and the braid's length. In this paper we propose the use of different variants of estimation of distribution algorithms to deal with the problem. Furthermore, we investigate how the regularities of the braid optimization problem can be translated into statistical regularities by means of the Boltzmann distribution. We show that our best algorithm is able to produce many solutions that approximates the target gate with an accuracy in the order of $10^{-6}$, and have lengths up to 9 times shorter than those expected from braids of the same accuracy obtained with other methods.

📄 PDF Abstract BibTeX arXiv:1410.0602

Code (0)

등록된 구현이 없습니다.

Machine learning discovers invariants of braids and flat braids

2023-07-22 · Alexei Lisitsa, Mateo Salles, Alexei Vernitski

We use machine learning to classify examples of braids (or flat braids) as trivial or non-trivial. Our ML takes form of supervised learning using neural networks (multilayer perceptrons). When they achieve good results i…

Untangling Braids with Multi-agent Q-Learning

2021-09-29 · Abdullah Khan, Alexei Vernitski, Alexei Lisitsa

We use reinforcement learning to tackle the problem of untangling braids. We experiment with braids with 2 and 3 strands. Two competing players learn to tangle and untangle a braid. We interface the braid untangling prob…

OpenAI Gym Q-Learning reinforcement-learning Reinforcement Learning+1

An application of neural networks to a problem in knot theory and group theory (untangling braids)

2022-06-10 · Alexei Lisitsa, Mateo Salles, Alexei Vernitski

We report on our success on solving the problem of untangling braids up to length 20 and width 4. We use feed-forward neural networks in the framework of reinforcement learning to train the agent to choose Reidemeister m…

reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

From Constraints to Resolution Rules, Part II: chains, braids, confluence and T&E

2013-04-11 · Denis Berthier

In this Part II, we apply the general theory developed in Part I to a detailed analysis of the Constraint Satisfaction Problem (CSP). We show how specific types of resolution rules can be defined. In particular, we intro…

Learning Disordered Topological Phases by Statistical Recovery of Symmetry

2017-09-18 · Nobuyuki Yoshioka, Yutaka Akagi, Hosho Katsura

In this letter, we apply the artificial neural network in a supervised manner to map out the quantum phase diagram of disordered topological superconductor in class DIII. Given the disorder that keeps the discrete symmet…