Systematically generated two-qubit anyon braids
arXiv:1511.00719 · doi:10.1103/PhysRevA.93.052328
Abstract
Fibonacci anyons are non-Abelian particles for which braiding is universal for quantum computation. Reichardt has shown how to systematically generate nontrivial braids for three Fibonacci anyons which yield unitary operations with off-diagonal matrix elements that can be made arbitrarily small in a particular natural basis through a simple and efficient iterative procedure. This procedure does not require brute force search, the Solovay-Kitaev method, or any other numerical technique, but the phases of the resulting diagonal matrix elements cannot be directly controlled. We show that despite this lack of control the resulting braids can be used to systematically construct entangling gates for two qubits encoded by Fibonacci anyons.
arXiv comment9 pages, 6 figures
References in corpus (24)
- Fault-tolerant quantum computation by anyons
- Non-Abelian Anyons and Topological Quantum Computation
- New directions in the pursuit of Majorana fermions in solid state systems
- String-net condensation: A physical mechanism for topological phases
- Beyond paired quantum Hall states: parafermions and incompressible states in the first excited Landau level
- Quantum Phases of Vortices in Rotating Bose-Einstein Condensates
- Universal topological quantum computation from a superconductor/Abelian quantum Hall heterostructure
- Braid Topologies for Quantum Computation
- A short introduction to Fibonacci anyon models
- Quantum computation with Turaev-Viro codes
- Asymptotically Optimal Topological Quantum Compiling
- Topological Quantum Compiling
- Topological Quantum Computing with Only One Mobile Quasiparticle
- Superconducting analogue of the parafermion fractional quantum Hall states
- Topological Quantum Computing with Read-Rezayi States
- Quantum Circuits for Measuring Levin-Wen Operators
- Constructing Functional Braids for Low-Leakage Topological Quantum Computing
- Quantum error correction of systematic errors using a quantum search framework
- Quantum hashing with the icosahedral group
- Exploiting Geometric Degrees of Freedom in Topological Quantum Computing
- Topological Quantum Gate Construction by Iterative Pseudogroup Hashing
- Composite anyon coding and the initialization of a topological quantum computer
- Geometrical approach to SU(2) navigation with Fibonacci anyons
- Methodology for bus layout for topological quantum error correcting codes
Cited by in corpus (8)
- Introduction to topological quantum computation with non-Abelian anyons
- Topological Quantum Compiling with Reinforcement Learning
- Fibonacci Numbers and the Golden Ratio in Biology, Physics, Astrophysics, Chemistry and Technology: A Non-Exhaustive Review
- Universal quantum computation using Ising anyons from a non-semisimple Topological Quantum Field Theory
- Topological quantum compilation of two-qubit gates
- Optimized Topological Quantum Compilation of Three-Qubit Controlled Gates in the Fibonacci Anyon Model: A Controlled-Injection Approach
- Weighted Quantum Channel Compiling through Proximal Policy Optimization
- The construction of a universal quantum gate set for the anyon models via genetic optimized algorithm