Related papers: Towards Topological Quantum Computation? - Knottin…
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 problem of universality in the anyon model described by the $SU(2)$ Witten-Chern-Simons theory at level $k$. A classic theorem of Freedman-Larsen-Wang states that for $k \geq 3, \ k \neq 4$, braiding of the anyons of…
We show that the braid-group extension of the monodromy-based topological quantum computation scheme of Das Sarma et al. can be understood in terms of the universal R matrix for the Ising model giving similar results to those obtained by…
We present a scheme for universal topological quantum computation based on Clifford complete braiding and fusion of symmetry defects in the 3-Fermion anyon theory, supplemented with magic state injection. We formulate a fault-tolerant…
Harnessing non-abelian statistics of anyons to perform quantum computational tasks is getting closer to reality. While the existence of universal anyons by braiding alone such as the Fibonacci anyon is theoretically a possibility,…
Topological quantum states of matter, both Abelian and non-Abelian, are characterized by excitations whose wavefunctions undergo non-trivial statistical transformations as one excitation is moved (braided) around another. Topological…
In topological quantum computation, quantum information is stored in states which are intrinsically protected from decoherence, and quantum gates are carried out by dragging particle-like excitations (quasiparticles) around one another in…
Exactly solvable models of topologically ordered phases with non-abelian anyons typically require complicated many-body interactions which do not naturally appear in nature. This motivates the "inverse problem" of quantum many-body physics:…
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…
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…
We compute the quantum double, braiding and other canonical Hopf algebra constructions for the bicrossproduct Hopf algebra $H$ associated to the factorization of a finite group into two subgroups. The representations of the quantum double…
To formulate the universal constraints of quantum statistics data of generic long-range entangled quantum systems, we introduce the geometric-topology surgery theory on spacetime manifolds where quantum systems reside, cutting and gluing…
Schemes for topological quantum computation are usually based on the assumption that the system is initially prepared in a specific state. In practice, this state preparation is expected to be challenging as it involves non-topological…
Topological quantum computation provides an elegant way around decoherence, as one encodes quantum information in a non-local fashion that the environment finds difficult to corrupt. Here we establish that one of the key…
Topological quantum computation started as a niche area of research aimed at employing particles with exotic statistics, called anyons, for performing quantum computation. Soon it evolved to include a wide variety of disciplines. Advances…
Fibonacci anyons provide the simplest possible model of non-Abelian fusion rules: [1] x [1] = [0] + [1]. We propose a conformal field theory construction of topological quantum registers based on Fibonacci anyons realized as quasiparticle…
Quantum computation provides a unique opportunity to explore new regimes of physical systems through the creation of non-trivial quantum states far outside of the classical limit. However, such computation is remarkably sensitive to noise…
Indistinguishability of particles is a fundamental principle of quantum mechanics. For all elementary and quasiparticles observed to date - including fermions, bosons, and Abelian anyons - this principle guarantees that the braiding of…
We present two paradigms relating algebraic, topological and quantum computational statistics for the topological model for quantum computation. In particular we suggest correspondences between the computational power of topological quantum…
We have studied ${\rm SU}(2)_k$ anyon models, assessing their prospects for topological quantum computation. In particular, we have compared the Ising ($k=2$) anyon and Fibonacci ($k=3$) anyon models, motivated by their potential for future…