We give an elementary construction of the Fibonacci model, a unitary braid group representation that is universal for quantum computation. This paper is dedicated to Professor C. N. Yang, on his 85th birthday.
Important developments in fault-tolerant quantum computation using the braiding of anyons have placed the theory of braid groups at the very foundation of topological quantum computing. Furthermore, the realization by Kauffman and Lomonaco that a specific braiding operator from the solution of the Yang-Baxter equation, namely the Bell matrix, is universal implies that in principle all quantum gates can be constructed from braiding operators together with single qubit gates. In this paper we present a new class of braiding operators from the Temperley-Lieb algebra that generalizes the Bell matrix to multi-qubit systems, thus unifying the Hadamard and Bell matrices within the same framework. Unlike previous braiding operators, these new operators generate directly , from separable basis states, important entangled states such as the generalized Greenberger-Horne-Zeilinger states, cluster-like states, and other states with varying degrees of entanglement.
A method of constructing Temperley-Lieb algebra (TLA) representations has been introduced in [Xue et al. arXiv:0903.3711]. Using this method, we can obtain another series of n2 × n2 matrices U which satisfy the TLA with the single loop [Formula: see text]. Specifically, we present a 9 × 9 matrix U with [Formula: see text]. Via Yang-Baxterization approach, we obtain a unitary [Formula: see text]-matrix, a solution of the Yang-Baxter equation. This 9 × 9 Yang-Baxter matrix is universal for quantum computing.
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 unitary representation of the braid group. We discuss the evaluation of the polynomial as a generalized quantum amplitude and show how the braiding part of the evaluation can be construed as a quantum computation when the braiding representation is unitary. The question of an efficient quantum algorithm for computing the whole polynomial remains open.