Related papers: Entangling gates for the SU(N) anyons
Finding physical realizations of topologically ordered states in experimental settings, from condensed matter to artificial quantum systems, has been the main challenge en route to utilizing their unconventional properties. We show how to…
Building a quantum computer is a daunting challenge since it requires good control but also good isolation from the environment to minimize decoherence. It is therefore important to realize quantum gates efficiently, using as few operations…
Quantum algorithms on near-term quantum processors are typically executed using shallow quantum circuits composed of one- and two-qubit gates. However, as circuit depth and gate number increase, gate imperfections and qubit decoherence…
We study systematically numerical method into constructing a universal quantum gate set for topological quantum computation (TQC) using SU(2)k anyon models. The F-matrices and R-symbol were computed through the q-deformed representation…
Topological quantum computers provide a fault-tolerant method for performing quantum computation. Topological quantum computers manipulate topological defects with exotic exchange statistics called anyons. The simplest anyon model for…
We investigate the topological quantum compilation of two-qubit operations within a system of Fibonacci anyons. Our primary goal is to generate gates that are approximately leakage-free and equivalent to the controlled-NOT (CNOT) gate up to…
It is shown, using level-rank duality that a universal topological quantum computer based on Chern-Simons theory for SU(2)$_3$ also implies an analogous universal quantum computer based on SU(3)$_2$. Suggestions are made for the possible…
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 is based on the observation that a universal set of quantum…
We investigate a promising conformal field theory realization scheme for topological quantum computation based on the Fibonacci anyons, which are believed to be realized as quasiparticle excitations in the $\mathbb{Z}_3$ parafermion…
In a topological quantum computer, universal quantum computation is performed by dragging quasiparticle excitations of certain two dimensional systems around each other to form braids of their world lines in 2+1 dimensional space-time. In…
In a topological quantum computer, braids of non-Abelian anyons in a (2+1)-dimensional space-time form quantum gates, whose fault tolerance relies on the topological, rather than geometric, properties of the braids. Here we propose to…
Optimal construction of quantum operations is a fundamental problem in the realization of quantum computation. We here introduce a newly discovered quantum gate, B, that can implement any arbitrary two-qubit quantum operation with minimal…
Topological quantum computation encodes quantum information in the internal fusion space of non-Abelian anyonic quasiparticles, whose braiding implements logical gates. This goes beyond Abelian topological order (TO) such as the toric code,…
We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the…
We have previously discussed the design of a neutral atom quantum computer with an on-demand interaction [E. Hosseini Lapasar, et al., J. Phys. Soc. Jpn. 80, 114003 (2011)]. In this contribution, we propose an experimental method to…
We propose a dual-architecture quantum simulation framework for modeling morphisms and stability conditions in the bounded derived category $\mathbf{D}^b(\mathrm{Coh}(X))$, with applications to D-brane physics on K\"ahler and non-K\"ahler…
We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper bounds on fault tolerant thresholds, and for understanding…
We show that universal quantum computation can be performed within the ground state of a topologically ordered quantum system, which is a naturally protected quantum memory. In particular, we show how this can be achieved using brane-net…
Topological quantum computing promises intrinsic fault tolerance by encoding quantum information in non-Abelian anyons, where quantum gates are implemented via braiding. While braiding operations are robust against local perturbations, a…
In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations…