Related papers: Exploiting Geometric Degrees of Freedom in Topolog…
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 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…
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…
Quantum gates in topological quantum computation are performed by braiding non-Abelian anyons. These braiding processes can presumably be performed with very low error rates. However, to make a topological quantum computation architecture…
We describe the mathematical theory of topological quantum computing with symmetry defects in the language of fusion categories and unitary representations. Symmetry defects together with anyons are modeled by G-crossed braided extensions…
A great part of the mathematical foundations of topological quantum computation is given by the theory of modular categories which provides a description of the topological phases of matter such as anyon systems. In the near future the…
Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic…
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…
We study various aspects of the topological quantum computation scheme based on the non-Abelian anyons corresponding to fractional quantum hall effect states at filling fraction 5/2 using the Temperley-Lieb recoupling theory. Unitary…
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations of such schemes in codes of all spatial dimensions. We…
Topological quantum codes are intrinsically fault-tolerant to local noise, and underlie the theory of topological phases of matter. We explore geometry to enhance the performance of topological quantum codes by rotating the four dimensional…
Topological phases of matter are a potential platform for the storage and processing of quantum information with intrinsic error rates that decrease exponentially with inverse temperature and with the length scales of the system, such as…
Topological quantum computing has recently proven itself to be a very powerful model when considering large- scale, fully error corrected quantum architectures. In addition to its robust nature under hardware errors, it is a software driven…
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…
We present a systematic numerical construction of a universal quantum gate set for topological quantum computation based on the non-semisimple Ising anyons model. By employing a Genetic Algorithm-enhanced Solovay-Kitaev Algorithm…
In this short review, I draw attention to new developments in the theory of fault tolerance in quantum computation that may give concrete direction to future work in the development of superconducting qubit systems. The basics of quantum…
Topological quantum computation has recently emerged as one of the most exciting approaches to constructing a fault-tolerant quantum computer. The proposal relies on the existence of topological states of matter whose quasiparticle…
This paper studies fault-tolerant quantum computation with gapped boundaries. We first introduce gapped boundaries of Kitaev's quantum double models for Dijkgraaf-Witten theories using their Hamiltonian realizations. We classify the…
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…
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$.…