Next Article in Journal
Single-Valued Neutrosophic Power Shapley Choquet Average Operators and Their Applications to Multi-Criteria Decision-Making
Previous Article in Journal
Cournot Duopoly Games: Models and Investigations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Unitary Representations of the Braid Group B6

by
Malak M. Dally
and
Mohammad N. Abdulrahim
*
Department of Mathematics and Computer Science, Faculty of Science, Beirut Arab University, P.O. Box 11-5020 Beirut, Lebanon
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(11), 1080; https://doi.org/10.3390/math7111080
Submission received: 28 September 2019 / Revised: 6 November 2019 / Accepted: 7 November 2019 / Published: 9 November 2019
(This article belongs to the Section Mathematics and Computer Science)

Abstract

:
We consider a non-abelian leakage-free qudit system that consists of two qubits each composed of three anyons. For this system, we need to have a non-abelian four dimensional unitary representation of the braid group B 6 to obtain a totally leakage-free braiding. The obtained representation is denoted by ρ . We first prove that ρ is irreducible. Next, we find the points y C * at which the representation ρ is equivalent to the tensor product of a one dimensional representation χ ( y ) and μ ^ 6 ( ± i ) , an irreducible four dimensional representation of the braid group B 6 . The representation μ ^ 6 ( ± i ) was constructed by E. Formanek to classify the irreducible representations of the braid group B n of low degree. Finally, we prove that the representation χ ( y ) μ ^ 6 ( ± i ) is a unitary relative to a hermitian positive definite matrix.

1. Introduction

Due to Artin, the braid group B n is represented in the group A u t ( F n ) of automorphisms of the free group F n generated by x 1 , , x n . The matrix representation of B n was published by W. Burau in 1936. This representation was known as a Burau representation. Since then, other matrix representations of B n have been constructed. For more details, see [1].
Braid group unitary representations have been essential in topological quantum computations. To understand the d-dimensional systems in which anyons are exchanged, a lot of work has been made. The exchange of n anyons inside the qudit system, the d-dimensional analogues of qubits, has been governed by the braid group B n which has n 1 generators τ 1 , , τ n 1 . Here, τ i exchanges the particle i with its neighbor, particle i + 1 .
When the topological charge of the qudits changes due to the braiding of the anyons from different qudits, a leakage of some of the information will occur in the computational Hilbert space, the fusion space of the anyons.
The leakage-free braiding of anyons has been under investigation for a while. To perform universal quantum computation without any leakage, the requirement would be to consider two-qubit gates. This would be very restrictive and this property can only be realized for two-qubit systems related to the Ising-like anyons model [2].
R. Ainsworth and J.K. Slingerland showed that a non-abelian, leakage-free qudit of dimension d involving n anyons is equivalent to a non-abelian d-dimensional representation of the braid group B n . Here, n is the sum of the number of anyons n 1 inside the first qudit and the number of anyons n 2 inside the second qudit. As for the dimension d of the representation of B n , it is the product of the dimensions d 1 and d 2 of the Hilbert spaces of the individual qudits.
Moreover, it was proved in [2] that the number of anyons per qubit is either 3 or 4. Thus, there are mainly 3 different types of two-qubit systems and a 4-dimensional representation of the corresponding braid group is constructed for each. Taking into account E. Formanek’s result that there is no d-dimensional representation of B n with d n 2 , it was verified in [2] that the only possible type of two-qubit system is having 2 qubits of which each is composed of 3 anyons.
This system is a non-abelian leakage-free qudit system of dimension 4 involving 6 anyons. It is equivalent to a non-abelian 4-dimensional representation of the braid group B 6 . This representation is denoted by ρ . Since the number of anyons is 6, there are 5 elementary exchanges τ 1 , , τ 5 . The exchanges τ 1 , τ 2 , τ 4 , and τ 5 satisfy the following relations:
ρ ( τ i ) = ρ 1 ( τ i ) I d 2 ( 1 i n 1 1 )
and
ρ ( τ i ) = I d 1 ρ 2 ( τ i ) ( n 1 + 1 i n 1 ) ,
where ρ 1 and ρ 2 are the d 1 and d 2 - dimensional representations of B n 1 and B n 2 on the Hilbert spaces of the first and second qudit respectively. I d 1 and I d 2 are the d 1 and d 2 -dimensional identity matrices respectively. Here, n 1 = n 2 = 3 and d 1 = d 2 = 2.
The matrix ρ ( τ 3 ) is constructed by imposing braid group relations. For more details, see [2].
In our work, we consider the unitary representation ρ and the irreducible representation μ ^ 6 ( ± i ) which is defined by E. Formanek in [3]. Both representations are 4-dimensional representations of the braid group B 6 .
First, we prove that the unitary representation ρ : B 6 G L 4 ( C ) is irreducible.
As the representation ρ is proved to be irreducible, it follows that it is equivalent to the tensor product of a one-dimensional representation χ ( y ) and the irreducible 4-dimensional representation μ ^ 6 ( ± i ) , where y C * . For more details, see [3].
We then determine the points y C * at which the two representations ρ and χ ( y ) μ ^ 6 ( ± i ) are equivalent.
Finally, we show that the representation χ ( y ) μ ^ 6 ( ± i ) is a unitary relative to a hermitian positive definite matrix.

2. Preliminaries

Definition 1
(See [4]). The braid group on n strings, B n , is the abstract group with presentation B n = { σ 1 , , σ n 1 | σ i σ j = σ j σ i if | i j | 2 , σ i σ i + 1 σ i = σ i + 1 σ i σ i + 1 for i = 1 , , n 2 }.
The Hecke algebra representation of B 6 was constructed by V.F.R. Jones in [5]. E. Formanek obtained a low-degree representation of B 6 by conjugating the representation constructed by V.F.R. Jones by a certain permutation matrix. For more details, see [3].
Definition 2
(See [3]). The representation μ 6 : B 6 G L 5 ( Z [ t ± 1 ] ) is given by:
μ 6 ( σ 1 ) = 1 0 0 0 t 0 t 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 0 0 t , μ 6 ( σ 2 ) = t 0 0 0 0 0 1 t 0 0 0 0 t 0 0 1 0 0 1 0 1 0 0 0 1 ,
μ 6 ( σ 3 ) = 1 0 0 t 0 0 t 0 0 0 0 1 1 0 0 0 0 0 t 0 0 1 0 0 1 , μ 6 ( σ 4 ) = t 0 0 0 0 0 1 0 0 t 1 0 1 0 0 1 0 0 1 0 0 0 0 0 t ,
and
μ 6 ( σ 5 ) = 1 0 t 0 0 0 t 0 0 0 0 0 t 0 0 0 1 0 1 0 0 1 0 0 1 .
The restriction of μ 6 to B 5 is denoted by μ 5 : B 5 G L 5 ( C ) . For z C * , the complex specializations μ 6 ( z ) and μ 5 ( z ) are obtained from μ 6 and μ 5 respectively by letting t = z .
Definition 3
(See [3]). A representation ρ : B n G L r ( C ) is of Burau type if r 2 and it is equivalent to an irreducible representation χ ( y ) β n ( z ) : B n G L n 1 ( C ) or χ ( y ) β ^ n ( z ) : B n G L n 2 ( C ) where χ ( y ) is a one-dimensional representation, β n ( z ) is the reduced Burau representation, and β ^ n ( z ) is the composition factor of the reduced Burau representation.
Definition 4
(See [3]). Let y C * . The representation χ ( y ) : B n C * is the one-dimensional representation defined by χ ( y ) ( σ i ) = y .
Theorem 1
(See [3]).
1.
For z C * , μ 5 ( z ) and μ 6 ( z ) are irreducible unless z is a root of ( t 2 + t + 1 ) ( t 2 + 1 ) ;
2.
If z is a root of t 2 + t + 1 , then the composition factors of μ 6 ( z ) are χ ( z ) and β 6 ^ ( z ) and the composition factors of μ 5 ( z ) are χ ( z ) and β 5 ( z ) ;
3.
If z is a root of t 2 + 1 , then the composition factors of μ 6 ( z ) are χ ( 1 ) and an irreducible representation μ 6 ^ ( z ) : B 6 G L 4 ( C ) , where μ 6 ^ ( z ) ( σ 1 ) has eigen values 1 , 1 , z , z . The composition factors of μ 5 ( z ) are χ ( 1 ) and an irreducible representation μ 5 ^ ( z ) , which is the restriction of μ 6 ^ ( z ) to B 5 .
Theorem 2
(See [3]). Let ρ : B 6 G L r ( C ) be an irreducible representation, where 2 r 5 . Then one of the following is true.
1.
The representation ρ is of a Burau type;
2.
For some y C * , ρ is equivalent to χ ( y ) μ 6 ^ ( ± i ) : B 6 G L 4 ( C ) . Distinct pairs ( y , ± i ) give inequivalent representations;
3.
For some y , z C * , ρ is equivalent to χ ( y ) μ 6 ( z ) : B 6 G L 5 ( C ) , where z is not a root of ( t 2 + t + 1 ) ( t 2 + 1 ) .

3. Irreducibility of ρ : B 6 G L 4 ( C )

The construction of a two-qubit system with a minimum amount of leakage has been of great interest. The only two-qubit system that can be realized without leakage is the system of two 3-anyon qubits. This system is equivalent to a 4-dimensional representation of the braid group B 6 . This representation which was constructed in [2] is denoted by ρ .
In this section, we prove that ρ : B 6 G L 4 ( C ) is irreducible. We denote τ i , the exchange of the i t h and ( i + 1 ) t h anyon, by σ i where 1 i 5 .
Definition 5
(See [2]). The representation ρ : B 6 G L 4 ( C ) is defined as follows:
ρ ( σ 1 ) = a 0 0 0 0 a 0 0 0 0 a ¯ 0 0 0 0 a ¯ , ρ ( σ 2 ) = 1 a a 3 0 c 0 0 1 a a 3 0 c c 0 1 a ¯ a ¯ 3 0 0 c 0 1 a ¯ a ¯ 3 ,
ρ ( σ 3 ) = x 0 0 0 0 x ¯ 0 0 0 0 x ¯ 0 0 0 0 x , ρ ( σ 4 ) = 1 f f 3 e 0 0 e 1 f ¯ f ¯ 3 0 0 0 0 1 f f 3 e 0 0 e 1 f ¯ f ¯ 3 ,
and
ρ ( σ 5 ) = f 0 0 0 0 f ¯ 0 0 0 0 f 0 0 0 0 f ¯ .
In [2], it was shown that the multiplicities among the eigen values of the generators of the braid group result in the formation of topological charges during the fusion of the anyons in the system. As the system considered in our work is leakage-free, the eigen values of the generators σ i of the representation ρ should be the same. Thus, f = a or f = a ¯ and e = c = 1 1 2 a 2 a ¯ 2 .
By simple computations, the relation ρ ( σ 2 ) ρ ( σ 3 ) ρ ( σ 2 ) = ρ ( σ 3 ) ρ ( σ 2 ) ρ ( σ 3 ) yields the equation a 2 = a ¯ 2 . But, a = e i θ . Therefore, e 2 i θ = e 2 i θ . This implies that e 4 i θ = 1 . Consequently, e 8 i θ = 1 . That is, a must be a primitive eighth root of unity. Furthermore, c = 1 1 2 a 2 a ¯ 2 = 1 1 2 = 1 2 .
Note that since a is a primitive eighth root of unity, a 8 = 1 and a 2 1 . Then, a 3 a . Consequently, a ¯ 3 a ¯ , f f 3 , and f ¯ f ¯ 3 . This emphasizes that the defined matrices ρ ( σ i ) , 1 i 5 , are well-defined.
Now we study the irreducibility of ρ . For simplicity, we denote ρ ( σ i ) by σ i for 1 i 5 .
Lemma 1.
The representation ρ : B 6 G L 4 ( C ) has no non trivial proper invariant subspaces of dimension 1.
Proof. 
Let S be a proper invariant subspace of dimension 1. We consider all the possible cases.
Case 1: S = e i , i = 1 , 2 , 3 , 4 .
For simplicity, we take i = 1 . Since S is invariant, it follows that σ 2 ( e 1 ) = 1 a a 3 0 c 0 S .
This implies that c = 0 , a contradiction.
Case 2: S = e i + u e i + 1 , i = 1 , 3 , u C * .
For simplicity, we take i = 1 . Since S is invariant, it follows that σ 2 ( e 1 + u e 2 ) = 1 a a 3 u a a 3 c c u S .
This implies that c = 0 , a contradiction.
Thus, there are no non trivial proper invariant subspaces of dimension 1. □
Lemma 2.
The representation ρ : B 6 G L 4 ( C ) has no non trivial proper invariant subspace of dimension 2.
Proof. 
Let S be a proper invariant subspaces of dimension 2. We consider all the possible cases.
Case 1: S = e i , e i + 1 , i = 1 , 3 .
For simplicity, we take i = 1 . Since S is invariant, it follows that σ 2 ( e 1 ) = 1 a a 3 0 c 0 S .
This implies that c = 0 , a contradiction.
Case 2: S = e i , e j , i = 1 , 2 , j = 3 , 4 .
For simplicity, we take i = 1 . Since S is invariant, it follows that σ 4 ( e 1 ) = 1 f f 3 e 0 0 S .
This implies that e = 0 . But, e = c . Thus, c = 0 , a contradiction.
Case 3: S = e i , e 1 + u e 2 , i = 3 , 4 , u C * .
For simplicity, we take i = 3 . Since S is invariant, it follows that σ 4 ( e 3 ) = 0 0 1 f f 3 e S .
This implies that e = 0 . But, e = c . Thus, c = 0 , a contradiction.
Case 4: S = e i , e 3 + v e 4 , i = 1 , 2 , u C * .
For simplicity, we take i = 1 . Since S is invariant, it follows that σ 4 ( e 1 ) = 1 f f 3 e 0 0 S .
This implies that e = 0 . But, e = c . Thus, c = 0 , a contradiction.
Case 5: S = e 1 + u e 2 , e 3 + v e 4 , u , v C * .
Since S is invariant, it follows that σ 3 ( e 1 + u e 2 ) = x x ¯ u 0 0 S . This implies that a = a ¯ . That is, a 2 a ¯ 2 = 0 . But, from the equation σ 2 σ 3 σ 2 = σ 3 σ 2 σ 3 , we have a 2 + a ¯ 2 = 0 . Thus, 2 a 2 = 0 which gives a contradiction.
Thus, there are no non trivial proper invariant subspaces of dimension 2. □
Now, we state the theorem of irreducibility.
Theorem 3.
The representation ρ : B 6 G L 4 ( C ) is irreducible.
Proof. 
By Lemma 1 and Lemma 2, there are no proper invariant subspaces of dimensions 1 and 2. Clearly, the representation ρ is unitary, that is σ i σ i * = I 4 for 1 i 5 .
We note that if the representation is unitary, then the orthogonal complement of a proper invariant subspace is again a proper invariant subspace. As there is no proper invariant subspace of dimension 1, there is no proper invariant subspace of dimension 3.
As a result, all the possible proper subspaces are not invariant. Consequently, ρ is irreducible. □

4. The Representations ρ and χ ( y ) μ 6 ^ ( ± i ) Are Equivalent

By Theorem 3, the representation ρ is irreducible. The eigen values of ρ ( σ i ) for 1 i 5 are different from those of β ^ 4 ( z ) , the composition factor of the reduced Burau representation. Therefore, the representation ρ is not equivalent to the tensor product of a one dimensional representation χ ( y ) and β ^ 4 ( z ) . That is, ρ is not of a Burau type.
Moreover, ρ is a 4-dimensional representation. Consequently, Theorem 2 implies that the representation ρ is equivalent to the representation χ ( y ) μ 6 ^ ( ± i ) for some y C * .
Note that, by Theorem 1, the representation μ ^ 6 ( z ) is irreducible for z = ± i since the roots of the polynomial t 2 + 1 are clearly ± i .
In this section, we determine the points y C * at which the representations ρ and χ ( y ) μ ^ 6 ( ± i ) are equivalent.
Since the two representations are equivalent, the determinants of the matrices ( χ ( y ) μ 6 ^ ( ± i ) ) ( σ i ) and ρ ( σ i ) are equal for 1 i 5 .
By simple computations, the determinant D e t [ ( χ ( y ) μ 6 ^ ( ± i ) ) ( σ i ) ] = y 4 and D e t [ ρ ( σ i ) ] = 1 for all i = 1 , 2 , 3 , 4 , 5 . Thus, y 4 = 1 . This implies that y = ± ( ± i ) .
As a result, the two considered representations are equivalent at the following points: y 1 = i , y 2 = i , y 3 = i , and y 4 = i , where i is the complex number such that i 2 = 1 .

5. Unitarity of χ ( y ) μ 6 ^ ( ± i ) : B 6 G L 4 ( C )

As the representation ρ is proved to be unitary and equivalent to the representation χ ( y ) μ 6 ^ ( ± i ) for some y C * , the representation χ ( y ) μ 6 ^ ( ± i ) is a unitary relative to a matrix M.
In this section, we find the matrix M and we prove that M is a hermitian and positive definite.
Definition 6
(See [3]). The representation μ 6 ^ ( ± i ) : B 6 G L 4 ( C ) is defined as follows:
σ 1 ± i 0 0 0 1 1 0 0 0 0 ± i 0 0 0 1 1 , σ 2 1 ± i 0 0 0 ± i 0 0 0 0 1 ± i 0 0 0 ± i ,
σ 3 1 0 0 0 1 ± i 0 0 0 0 ± i 0 0 0 1 1 , σ 4 ( 1 / 2 ) 1 ± i 0 1 ± i 0 0 1 ± i 0 1 ± i 1 ± i 0 1 ± i 0 0 1 ± i 0 1 ± i ,
and σ 5 1 0 0 0 0 1 0 0 0 0 ± i 0 0 0 0 ± i .
Now, we state the following theorem:
Theorem 4.
The images of the generators of B 6 under μ 6 ^ ( ± i ) are unitary relative to a hermitian positive definite matrix M.
Proof. 
Let,
M = 2 1 i 0 0 1 + i 2 0 0 0 0 2 1 i 0 0 1 + i 2 .
Here, i is the complex number such that i 2 = 1 and M is an invertible matrix whose determinant equals 4.
For simplicity, we denote ( μ 6 ^ ( ± i ) ) ( σ i ) by σ i for 1 i 5 .
By direct computations, σ 1 M σ 1 * = σ 2 M σ 2 * = σ 3 M σ 3 * = σ 4 M σ 4 * = σ 5 M σ 5 * = M , where σ i * is the complex conjugate transpose of σ i for 1 i 5 . Therefore, the representation μ ^ 6 ( ± i ) is a unitary relative to the matrix M.
Let M * be the complex conjugate transpose of M. Clearly, M * = M . This implies that the invertible matrix M is hermitian.
By computations, the eigen values of the matrix M are 2 + 2 and 2 2 . Clearly, both values are positive. Consequently, M is a positive definite matrix.
As a result, the representation μ ^ 6 ( ± i ) is a unitary relative to an invertible hermitian positive definite matrix M. □
Note that the unitarity of the representation μ 6 ^ ( ± i ) relative to the matrix M clearly implies that the representation χ ( y ) μ 6 ^ ( ± i ) is also a unitary relative to the same matrix M.

Author Contributions

Formal analysis, M.M.D.; Validation, M.N.A.

Funding

This research received no external funding.

Acknowledgments

The authors would like to thank the referees for their valuable help in improving the presentation of the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Birman, J.; Wenzl, H. Braids, Link Polynomials and a New Algebra. Trans. Am. Math. Soc. 1989, 313, 249–273. [Google Scholar] [CrossRef]
  2. Ainsworth, R.; Slingerland, J.K. Topological Qubit Design and Leakage. New J. Phys. 2011, 13, 065030. [Google Scholar] [CrossRef]
  3. Formanek, E. Braid Group Representations of Low Degree. Proc. Lond. Math. Soc. 1996, 3, 279–322. [Google Scholar] [CrossRef]
  4. Hansen, V. The Braid Group Presentation. In Braids and Coverings; Cambridge University Press: Cambridge, UK, 1989; pp. 9–39. [Google Scholar]
  5. Jones, V.F.R. Hecke Algebra Representations of Braid Groups and Link Polynomials. Ann. Math. 1987, 126, 335–388. [Google Scholar] [CrossRef]

Share and Cite

MDPI and ACS Style

Dally, M.M.; Abdulrahim, M.N. On the Unitary Representations of the Braid Group B6. Mathematics 2019, 7, 1080. https://doi.org/10.3390/math7111080

AMA Style

Dally MM, Abdulrahim MN. On the Unitary Representations of the Braid Group B6. Mathematics. 2019; 7(11):1080. https://doi.org/10.3390/math7111080

Chicago/Turabian Style

Dally, Malak M., and Mohammad N. Abdulrahim. 2019. "On the Unitary Representations of the Braid Group B6" Mathematics 7, no. 11: 1080. https://doi.org/10.3390/math7111080

APA Style

Dally, M. M., & Abdulrahim, M. N. (2019). On the Unitary Representations of the Braid Group B6. Mathematics, 7(11), 1080. https://doi.org/10.3390/math7111080

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop