Related papers: Entangling gates for the SU(N) anyons
We remove the need to physically transport computational anyons around each other from the implementation of computational gates in topological quantum computing. By using an anyonic analog of quantum state teleportation, we show how the…
We provide a comprehensive systematic method for the numerical computation of elementary braid operations in topological quantum computation (TQC). This {procedure} is systematically applicable to all anyon models, including $SU(2)_k$.…
This work proposes a scalable framework for topological quantum computing using Matryoshka-type Sine-Cosine chains. These chains support high-dimensional qudit encoding within single systems, reducing the physical resource overhead compared…
Chern-Simons theory in application to the quantum computing is actively developing at the present. However, most discussed are the questions of using materials with known parameters and building corresponding quantum gates and algorithms.…
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons…
We examine how best to design qubits for use in topological quantum computation. These qubits are topological Hilbert spaces associated with small groups of anyons. Op- erations are performed on these by exchanging the anyons. One might…
Topological quantum computation relies on control of non-Abelian anyons for inherently fault-tolerant storage and processing of quantum information. By now, blueprints for topological qubits are well developed for electrically active…
This review presents an entry-level introduction to topological quantum computation -- quantum computing with anyons. We introduce anyons at the system-independent level of anyon models and discuss the key concepts of protected fusion…
Topological quantum computing holding global anti-interference ability is realized by braiding some anyons, such as well-known Fibonacci anyons. Here, based on $SO(3)_2 $ theory we obtain a total of 6 anyon models utilizing…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
Fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding. However there is no known braid that entangles two…
A quantum computer can perform exponentially faster than its classical counterpart. It works on the principle of superposition. But due to the decoherence effect, the superposition of a quantum state gets destroyed by the interaction with…
We study the implementation of a universal quantum gate set via multiple-braiding within $SU(2)_k$ ($k > 2$, $k \neq 4$) anyon models. The multiple elementary braiding matrices (MEBMs) are derived from the $q$-deformed representation theory…
The topological model for quantum computation is an inherently fault-tolerant model built on anyons in topological phases of matter. A key role is played by the braid group, and in this survey we focus on a selection of ways that the…
We review the general strategy of topologically protected quantum information processing based on non-Abelian anyons, in which quantum information is encoded into the fusion channels of pairs of anyons and in fusion paths for multi-anyon…
Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…
Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme…
We provide ways to turn ancillas into phase gates (chapter 1), leading to irrational phase gates (chapter 2). We realize all the 2-qubit permutation gates (chapter 3).
The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations. The ability to execute parallel entangling quantum gates offers clear…
The anyonic excitations of topological two-body color code model are used to implement a set of gates. Because of two-body interactions, the model can be simulated in optical lattices. The excitations have nontrivial mutual statistics, and…