99 citations · 389 across the 7 of their papers we have counts for
4 papers · 1 filter
Minimal Quantum Circuits for Simulating Fibonacci Anyons
Sary Bseiso, Joel Pommerening, Richard R. Allen +2
The Fibonacci topological order is the prime candidate for the realization of universal topological quantum computation. We devise minimal quantum circuits to demonstrate the non-A…
Topological Quantum Computing with Read-Rezayi States
L. Hormozi, N. E. Bonesteel, S. H. Simon
Read-Rezayi fractional quantum Hall states are among the prime candidates for realizing non-Abelian anyons which in principle can be used for topological quantum computation. We pr…
Topological Quantum Compiling
L. Hormozi, G. Zikos, N. E. Bonesteel +1
A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so-called Fibonacci anyon model is developed. The method i…
Topological Quantum Computing with Only One Mobile Quasiparticle
S. H. Simon, N. E. Bonesteel, M. H. Freedman +2
In a topological quantum computer, universal quantum computation is performed by dragging quasiparticle excitations of certain two dimensional systems around each other to form bra…