Related papers: Introduction to topological quantum computation wi…
In this paper, we will present some ideas to use 3D topology for quantum computing. Topological quantum computing in the usual sense works with an encoding of information as knotted quantum states of topological phases of matter, thus being…
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…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
Inspired by non-abelian vortex anyons in spinor Bose-Einstein condensates, we consider the quantum double $\mathcal{D}(Q_8)$ anyon model as a platform to carry out a particular instance of Shor's factorization algorithm. We provide the…
We propose a construction of anyon systems associated to quantum tori with real multiplication and the embedding of quantum tori in AF algebras. These systems generalize the Fibonacci anyons, with weaker categorical properties, and are…
We describe measurement-only topological quantum computation using both projective and interferometrical measurement of topological charge. We demonstrate how anyonic teleportation can be achieved using "forced measurement" protocols for…
We present experimental results approximating the Jones polynomial using 4 qubits in a liquid state nuclear magnetic resonance quantum information processor. This is the first experimental implementation of a complete problem for the…
We show that a topological quantum computer based on the evaluation of a Witten-Reshetikhin-Turaev TQFT invariant of knots can always be arranged so that the knot diagrams with which one computes are diagrams of hyperbolic knots. The…
I examine, in general, how tunable interactions may be used to perform anyonic teleportation and generate braiding transformations for non-Abelian anyons. I explain how these methods are encompassed by the "measurement-only" approach to…
We consider a hypothetical topological quantum computer where the qubits are comprised of either Ising or Fibonacci anyons. For each case, we calculate the time and number of qubits (space) necessary to execute the most computationally…
In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of computation that disregards even the topology of the particle…
Qubits in topological quantum computation are built from non-Abelian anyons. Adiabatic braiding of anyons is exploited as topologically protected logical gate operations. Thus, the adiabaticity upon which the notion of quantum statistics is…
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…
Ising-type non-Abelian anyons are likely to occur in a number of physical systems, including quantum Hall systems, where recent experiments support their existence. In general, non-Abelian anyons may be utilized to provide a topologically…
Creating and manipulating anyons and symmetry defects in topological phases, especially those with a non-Abelian character, constitutes a primitive for topological quantum computation. We provide a physical protocol for implementing the…
This paper is an introduction to relationships between quantum topology and quantum computing. We take a foundational approach, showing how knots are related not just to braiding and quantum operators, but to quantum set theoretical…
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 explain the use of category theory in describing certain sorts of anyons. Yoneda's lemma leads to a simplification of that description. For the particular case of Fibonacci anyons, we also exhibit some calculations that seem to be known…
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 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…