Topological Quantum Gate Construction by Iterative Pseudogroup Hashing
arXiv:1009.5808 · doi:10.1088/1367-2630/13/2/025023
Abstract
We describe the hashing technique to obtain a fast approximation of a target quantum gate in the unitary group SU(2) represented by a product of the elements of a universal basis. The hashing exploits the structure of the icosahedral group [or other finite subgroups of SU(2)] and its pseudogroup approximations to reduce the search within a small number of elements. One of the main advantages of the pseudogroup hashing is the possibility to iterate to obtain more accurate representations of the targets in the spirit of the renormalization group approach. We describe the iterative pseudogroup hashing algorithm using the universal basis given by the braidings of Fibonacci anyons. The analysis of the efficiency of the iterations based on the random matrix theory indicates that the runtime and the braid length scale poly-logarithmically with the final error, comparing favorably to the Solovay-Kitaev algorithm.
arXiv comment20 pages, 5 figures
References in corpus (23)
- Fault-tolerant quantum computation by anyons
- Non-Abelian Anyons and Topological Quantum Computation
- Anyons in an exactly solved model and beyond
- Paired states of fermions in two dimensions with breaking of parity and time-reversal symmetries, and the fractional quantum Hall effect
- Two-Bit Gates are Universal for Quantum Computation
- Beyond paired quantum Hall states: parafermions and incompressible states in the first excited Landau level
- Quantum Phases of Vortices in Rotating Bose-Einstein Condensates
- Electron correlation in the second Landau level; a competition between many, nearly degenerate quantum phases
- Simulation of topological field theories by quantum computers
- Braid Topologies for Quantum Computation
- New Class of Non-Abelian Spin-Singlet Quantum Hall States
- The two-eigenvalue problem and density of Jones representation of braid groups
- Topological Quantum Compiling
- Topological Quantum Computing with Only One Mobile Quasiparticle
- Non-Abelian spin-singlet quantum Hall states: wave functions and quasihole state counting
- Why should anyone care about computing with anyons?
- Resources Required for Topological Quantum Factoring
- Wavefunctions for topological quantum registers
- Constructing Functional Braids for Low-Leakage Topological Quantum Computing
- Quantum hashing with the icosahedral group
- A Blueprint for a Topologically Fault-tolerant Quantum Computer
- Exploiting Geometric Degrees of Freedom in Topological Quantum Computing
- Geometrical approach to SU(2) navigation with Fibonacci anyons