Related papers: Photonic simulation of Majorana-based Jones polyno…
Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows…
We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl…
This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a…
This thesis details a Python-based software designed to calculate the Jones polynomial, a vital mathematical tool from Knot Theory used for characterizing the topological and geometrical complexity of curves in \( \mathbb{R}^3 \), which is…
It is a challenging problem to construct an efficient quantum algorithm which can compute the Jones' polynomial for any knot or link obtained from platting or capping of a $2n$-strand braid. We recapitulate the construction of braid-group…
We provide an elementary introduction to topological quantum computation based on the Jones representation of the braid group. We first cover the Burau representation and Alexander polynomial. Then we discuss the Jones representation and…
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…
Electrons are indivisible elementary particles, yet paradoxically a collection of them can act as a fraction of a single electron, exhibiting exotic and useful properties. One such collective excitation, known as a topological Majorana…
We summarize the key ingredients required for universal topological quantum computation using Majorana zero modes in networks of topological superconductor nanowires. Particular emphasis is placed on the use of both sparse and dense logical…
Majorana fermions feature non-Abelian exchange statistics and promise fascinating applications in topological quantum computation. Recently, second-order topological superconductors (SOTSs) have been proposed to host Majorana fermions as…
We analyze the connections between the mathematical theory of knots and quantum physics by addressing a number of algorithmic questions related to both knots and braid groups. Knots can be distinguished by means of `knot invariants', among…
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…
We introduce a scheme for preparation, manipulation, and readout of Majorana zero modes in semiconducting wires with mesoscopic superconducting islands. Our approach synthesizes recent advances in materials growth with tools commonly used…
We provide a current perspective on the rapidly developing field of Majorana zero modes in solid state systems. We emphasize the theoretical prediction, experimental realization, and potential use of Majorana zero modes in future…
This is a tutorial review of methods to braid the world lines of non-Abelian anyons (Majorana zero-modes) in topological superconductors. That "Holy Grail" of topological quantum information processing has not yet been reached in the…
The colored Jones polynomial is a knot invariant that plays a central role in low dimensional topology. We give a simple and an efficient algorithm to compute the colored Jones polynomial of any knot. Our algorithm utilizes the walks along…
A remarkable property of quantum mechanics in two-dimensional (2D) space is its ability to support "anyons," particles that are neither fermions nor bosons. Theory predicts that these exotic excitations can be realized as bound states…
Non-Abelian braiding has attracted significant attention because of its pivotal role in describing the exchange behaviors of anyons--a candidate for realizing quantum logics. The input and outcome of non-Abelian braiding are connected by a…
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 construct a quantum algorithm to approximate efficiently the colored Jones polynomial of the plat presentation of any oriented link L at a fixed root of unity q. Our construction is based on SU(2) Chern-Simons topological quantum field…