Related papers: Braids, Motions and Topological Quantum Computing
We review the q-deformed spin network approach to topological quantum field theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. The simplest case of these models is 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…
Braid theories are applied to quantum computation processes, where to each crossing in the Braid diagram a unitary Yang-Baxter operator R is associated, representing either a Braiding matrix or a universal quantum gate. By operating with…
This is a systematic introduction for physicists to the theory of algebras and groups with braid statistics, as developed over the last three years by the author. There are braided lines, braided planes, braided matrices and braided groups…
We introduce a recoupling theory for virtual braided trees. This recoupling theory can be utilized to incorporate swap gates into anyonic models of quantum computation.
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…
We review the q-deformed spin network approact to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. These methods produce a concise proof…
The role of quantum groups and braid groups in the description of Standard Model particles is discussed. Some recent results on the use of the quantum group $SU_q(3)$ as a flavour symmetry are reviewed and a connection between two…
Topological qauntum field theory(TQFT) is a very powerful theoretical tool to study topological phases and phase transitions. In $2+1$D, it is well known that the Chern-Simons theory captures all the universal topological data of…
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…
In this paper, we will describe a topological model for elementary particles based on 3-manifolds. Here, we will use Thurston's geometrization theorem to get a simple picture: fermions as hyperbolic knot complements (a complement…
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…
In this paper, we use braiding diagrams to present rules of shapes and designs. That is, we design colour, design size, design brightness, design codes by means of braiding.
We consider topological quantum memories for a general class of abelian anyon models defined on spin lattices. These are non-universal for quantum computation when restricting to topological operations alone, such as braiding and fusion.…
This paper gives a criterion for detecting the entanglement of a quantum state, and uses it to study the relationship between topological and quantum entanglement. It is fundamental to view topological entanglements such as braids as…
The spin network quantum simulator relies on the su(2) representation ring (or its q-deformed counterpart at q= root of unity) and its basic features naturally include (multipartite) entanglement and braiding. In particular, q-deformed spin…
The deep connection among braids, knots and topological physics has provided valuable insights into studying topological states in various physical systems. However, identifying distinct braid groups and knot topology embedded in…
Exchanging particles on graphs, or more concretely on networks of quantum wires, has been proposed as a means to perform fault tolerant quantum computation. This was inspired by braiding of anyons in planar systems. However, exchanges on a…
Using von Neumann algebras, we extend the theory of quantum computation on a graph to a theory of computation on an arbitrary topological space.
Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and…