Quantum entanglement, unitary braid representation and Temperley-Lieb algebra

@article{Ho2010QuantumEU,
  title={Quantum entanglement, unitary braid representation and Temperley-Lieb algebra},
  author={C. L. Ho and Allan I. Solomon and C.H.Oh},
  journal={EPL},
  year={2010},
  volume={92},
  pages={30002}
}
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… Expand
A note on "eight-vertex" universal quantum gates
Many well-known and well-studied four by four universal quantum logic gates in the literature are of a specific form, the so called eight-vertex form \eqref{8vertexform} \cite{kaufman etalExpand
Cyclic groups and quantum logic gates
Abstract We present a formula for an infinite number of universal quantum logic gates, which are 4 by 4 unitary solutions to the Yang–Baxter (Y–B) equation. We obtain this family from a certainExpand
Entanglement negativity of fermions: Monotonicity, separability criterion, and classification of few-mode states
We study quantum information aspects of the fermionic entanglement negativity recently introduced in [Phys. Rev. B 95, 165101 (2017)] based on the fermionic partial transpose. In particular, we showExpand
Links and quantum entanglement
We discuss the analogy between topological entanglement and quantum entanglement, particularly for tripartite quantum systems.We illustrate our approach by first discussing two clearlyExpand
Encoding discrete quantum algebras in a hierarchy of binary words
  • T. Raptis
  • Mathematics, Physics
  • Journal of Physics: Conference Series
  • 2019
It is shown how to endow a hierarchy of sets of binary patterns with the structure of an abstract,normed C*-algebra. In the course we also recover an intermediate connection with the words of a DyckExpand
New classes of spin chains from (SÔ(q)(N), Sp̂(q)(N)) Temperley-Lieb algebras: Data transmission and (q, N) parametrized entanglement entropies
A Temperley-Lieb algebra is extracted from the operator structure of a new class of N2×N2 braid matrices presented and studied in previous papers and designated as SO(q)(N), Sp(q)(N) for theExpand
The open XXZ spin chain model and the topological basis realization
In this paper, it is shown that the Hamiltonian of the open spin-1 XXZ chain model can be constructed from the generators of the Birman–Murakami–Wenzl (B–M–W) algebra. Without the topologicalExpand
Topological basis associated with B–M–W algebra: Two-spin-1/2 realization
Abstract In this letter, we study the two-spin-1/2 realization for the Birman–Murakami–Wenzl (B–M–W) algebra and the corresponding Yang–Baxter R ˘ ( θ , ϕ ) matrix. Based on the two-spin-1/2Expand
Condition for tripartite entanglement
We propose a scheme for classifying the entanglement of a tripartite pure qubit state. This classification scheme consists of an ordered list of seven elements. These elements are the CayleyExpand
Solutions to the constant Yang-Baxter equation in all dimensions
We will present solutions to the constant Yang-Baxter equation, in any dimension $n$. More precisely, for any $n$, we will create an infinite family of $n^2$ by $n^2$ matrices which are solutions toExpand
...
1
2
...

References

SHOWING 1-10 OF 14 REFERENCES
Bell's theorem, quantum theory and conceptions of the universe
On a Theory of the Collapse of the Wave Function.- On the Measurement Problem of Quantum Mechanics.- A New Characteristic of a Quantum System Between Two Measurements - A "Weak Value".- Can theExpand
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
TLDR
An explicit and simplePolynomial quantum algorithm to approximate the Jones polynomial of an n strands braid with m crossings at any primitive root of unity e2πi/k, where the running time of the algorithm is polynometric in m, n and k. Expand
Going Beyond Bell’s Theorem
Bell’s Theorem proved that one cannot in general reproduce the results of quantum theory with a classical, deterministic local model. However, Einstein originally considered the case where one couldExpand
MATH
Abstract: About a decade ago, biophysicists observed an approximately linear relationship between the combinatorial complexity of knotted DNA and the distance traveled in gel electrophoresisExpand
Ann
Aaron Beck’s cognitive therapy model has been used repeatedly to treat depression and anxiety. The case presented here is a 34-year-old female law student with an adjustment disorder with mixedExpand
Bull
  • Am. Math. Soc. 12, 103
  • 1985
Proc
  • Roy. Soc. (Landon) A 322, 251
  • 1971
A
  • Chakrabarti, V.K. Dobrev, and S.G. 5 Mihov, J. Math. Phys. 48, 053508
  • 2007
A. and Q
A41
  • 055310
  • 2008
...
1
2
...