Abstract
A new kind of quantum gates, higher braiding gates, as matrix solutions of the polyadic braid equations (different from the generalized Yang–Baxter equations) is introduced. Such gates lead to another special multiqubit entanglement that can speed up key distribution and accelerate algorithms. Ternary braiding gates acting on three qubit states are studied in detail. We also consider exotic non-invertible gates, which can be related with qubit loss, and define partial identities (which can be orthogonal), partial unitarity, and partially bounded operators (which can be non-invertible). We define two classes of matrices, star and circle ones, such that the magic matrices (connected with the Cartan decomposition) belong to the star class. The general algebraic structure of the introduced classes is described in terms of semigroups, ternary and 5-ary groups and modules. The higher braid group and its representation by the higher braid operators are given. Finally, we show, that for each multiqubit state, there exist higher braiding gates that are not entangling, and the concrete conditions to be non-entangling are given for the obtained binary and ternary gates.
1. Introduction
The modern development of the quantum computing technique implies various extensions of its foundational concepts [1,2,3]. One of the main problems in the physical realization of quantum computers is the presence of errors, which implies that it is desirable that quantum computations be provided with error correction, or that ways be found to make the states more stable, which leads to the concept of topological quantum computation (for reviews, see, e.g., [4,5,6], and references therein). In the Turaev approach [7], link invariants can be obtained from the solutions of the constant Yang–Baxter equation (the braid equation). It was realized that the topological entanglement of knots and links is deeply connected with quantum entanglement [8,9]. Indeed, if the solutions to the constant Yang–Baxter Equation [10] (Yang–Baxter operators/maps [11,12]) are interpreted as a special class of quantum gate, namely braiding quantum gates [13,14], then the inclusion of non-entangling gates does not change the relevant topological invariants [15,16]. For further properties and applications of braiding quantum gates, see [17,18,19,20].
In this paper, we obtain and study the solutions to the higher arity (polyadic) braid equations introduced in [21,22], as a polyadic generalization of the constant Yang–Baxter equation (which is considerably different from the generalized Yang–Baxter equation of [23,24,25,26]). We introduce special classes of matrices (star and circle types), to which most of the solutions belong, and find that the so-called magic matrices [18,27,28] belong to the star class. We investigate their general non-trivial group properties and polyadic generalizations. We then consider the invertible and non-invertible matrix solutions to the higher braid equations as the corresponding higher braiding gates acting on multi-qubit states. It is important that multi-qubit entanglement can speed up quantum key distribution [29] and accelerate various algorithms [30]. As an example, we have made detailed computations for the ternary braiding gates as solutions to the ternary braid equations [21,22]. A particular solution to the n-ary braid equation is also presented. It is shown that for each multi-qubit state, there exist higher braiding gates that are not entangling, and the concrete relations for those are obtained, which can allow us to build non-entangling networks.
2. Yang–Baxter Operators
Recall here [9,13] the standard construction of the special kind of gates we will consider, the braiding gates, in terms of solutions to the constant Yang–Baxter equation [10] (called also algebraic Yang–Baxter equation [31]), or the (binary) braid equation [21].
2.1. Yang–Baxter Maps and Braid Group
First, we consider a general abstract construction of the (binary) braid equation. Let be a vector space over a field and the mapping , where is the tensor product over . A linear operator (braid operator) is called a Yang–Baxter operator (denoted by R in [13] and by B in [10]) or Yang–Baxter map [12] (denoted by F in [11]), if it satisfies the braid equation [32,33,34]
where , is the identity operator in . The connection of with the R-matrix is given by , where is the flip operation [10,11,32].
Let us introduce the operators by
If is invertible, then is also the Yang–Baxter map with and . Therefore, the operators represent the braid group by the mapping as
The representation of the braid group with m strands
can be obtained using operators VV analogous to Equation (2)
by the mapping V in the following way
2.2. Constant Matrix Solutions to the Yang–Baxter Equation
Consider next a concrete version of the vector space that is used in the quantum computation, a d-dimensional euclidean vector space over complex numbers with a basis , . A linear operator is given by a complex matrix, the identity operator becomes the identity matrix , and the Yang–Baxter map is a matrix (denoted by R in [31]) satisfying the matrix algebraic Yang–Baxter equation
being an equality between two matrices of size . We use the unified notations which can be straightforwardly generalized for higher braid operators. In components
the Yang–Baxter equation (8) has the shape (where summing is by primed indices)
The system Equation (10) is highly overdetermined, because the matrix contains unknown entries, while there are cubic polynomial equations for them. So, for we have 64 equations for 16 unknowns, while for there are 729 equations for the 81 unknown entries of . The unitarity of imposes a further quadratic equations, and so for we have in total 68 equations for 16 unknowns. This makes the direct discovery of solutions for the matrix Yang–Baxter Equation (10) very cumbersome. Nevertheless, using a conjugation classes method, the unitary solutions and their classification for were presented in [31].
In the standard matrix form, Equation (9) can be presented by introducing the 4-dimensional vector space with the natural basis , where is a cumulative index. The linear operator corresponding to Equation (9) is given by matrix as . The operators (2) become two matrices as
where is the Kronecker product of matrices and is the identity matrix. In this notation (which is universal and also used for higher braid equations) the operator binary braid Equation (134) become a single matrix equation
which we call the matrix binary braid equation (and also the constant Yang–Baxter Equation [31]). In component form, Equation (12) is a highly overdetermined system of 64 cubic equations for 16 unknowns, the entries of .
The matrix Equation (12) has the following “gauge invariance”, which allows a classification of Yang–Baxter maps [35]. Introduce an invertible operator in the two-dimensional vector space . In the basis its matrix q is given by . In the natural 4-dimensional basis the tensor product of operators is presented by the Kronecker product of matrices . If the matrix is a fixed solution to the Yang–Baxter Equation (12), then the family of solutions corresponding to the invertible matrix q is the conjugation of by such that
which follows from conjugating Equation (12) by and using Equation (11). If we include the obvious invariance of Equation (12) with respect to an overall factor , the general family of solutions becomes (cf. the Yang–Baxter equation [35])
It follows from Equation (13) that the matrix is defined up to a complex non-zero factor. In this case, we can put
and the manifest form of is
The matrix (where ★ represents Hermitian conjugation) is diagonal (this case is important in a further classification similar to the binary one [31]), when the condition
holds, and so the matrix q takes the special form (depending on 2 complex parameters)
We call two solutions and of the constant Yang–Baxter Equation (12) q-conjugated, if
and we will not distinguish between them. The q-conjugation in the form Equation (19) does not require the invertibility of the matrix q, and therefore the solutions of different ranks (or invertible and not invertible) can be q-conjugated (for the invertible case, see [35,36,37,38]).
The matrix Equation (12) does not imply the invertibility of solutions, i.e., matrices being of full rank (in the binary Yang–Baxter case of rank 4 and ). Therefore, below we introduce in a unified way invertible and non-invertible solutions to the matrix Yang–Baxter Equation (10) for any rank of the corresponding matrices.
2.3. Partial Identity and Unitarity
To be as close as possible to the invertible case, we introduce “non-invertible analogs” of identity and unitarity. Let M be a diagonal matrix of rank , and therefore with zeroes on the diagonal. If the other diagonal elements are units, such a diagonal M can be reduced by row operations to a block matrix, being a direct sum of the identity matrix and the zero matrix . We call such a diagonal matrix a block r-partial identity , and without the block reduction—a shuffle r-partial identity (these are connected by conjugation). We will use the term partial identity and to denote any matrix of this form. Obviously, with the full rank we have , where is the identity matrix. As with the invertible case and identities, the partial identities (of the corresponding form) are, obviously, trivial solutions of the Yang–Baxter equation.
If a matrix of size and rank r satisfies the following r-partial unitarity condition
where is the conjugate-transposed matrix and , are partial identities (of any kind, they can be different), then is called a r-partial unitary matrix. In the case, when , the matrix is called normal. If , then it is called r-partial self-adjoint. In the case of full rank , the conditions Equations (20) and (21) become ordinary unitarity, and becomes an unitary (and normal) matrix, while a r-partial self-adjoint matrix becomes a self-adjoint matrix or Hermitian matrix.
As an example, we consider a matrix of rank 3
which satisfies the 3-partial unitarity conditions Equations (20) and (21) with two different 3-partial identities on the r.h.s.
For a non-invertible matrix , one can define a pseudoinverse (or the Moore–Penrose inverse, see, e.g., for a review [39]) by
and , are Hermitian. In the case of Equation (22) the partial unitary matrix coincides with its pseudoinverse
which is similar to the standard unitarity for an invertible matrix . It is important that Equation (22) is a solution of the matrix Yang–Baxter Equation (12), and so is an example of a non-invertible Yang–Baxter map.
If only the first (second) of the conditions Equations (20) and (21) holds, we call such a left (right) r-partial unitary matrix. An example of such a non-invertible Yang–Baxter map of rank 2 is the left 2-partial unitary matrix
which satisfies Equation (20), but not Equation (21), and so is not normal
Nevertheless, the property Equation (25) still holds and .
2.4. Permutation and Parameter-Permutation 4-Vertex Yang–Baxter Maps
The system Equation (12) with respect to all 16 variables is too cumbersome for direct solutions. The classification of all solutions can only be accomplished in special cases, e.g., for matrices over finite fields [35] or for fewer than 16 vertices. Here, we will start from 4-vertex permutation and parameter-permutation matrix solutions and investigate their group structure. It was shown [13,31] that the special 8-vertex solutions to the Yang–Baxter equation are most important for further applications including braiding gates. We will therefore study the 8-vertex solutions in the most general way: over and in various configurations, invertible and not invertible, and also consider their group structure.
First, we introduce the permutation Yang–Baxter maps, which are presented by the permutation matrices (binary matrices with a single 1 in each row and column), i.e., 4-vertex solutions. In total, there are 64 permutation matrices of size , while only 4 of them have the full rank 4 and simultaneously satisfy the Yang–Baxter Equation (12). These are the following
Here and next we list eigenvalues to understand which matrices are conjugated, and after that, if and only if the conjugation matrix is of the form Equation (16), then such solutions to the Yang–Baxter Equation (12) coincide. The traces are important in the construction of corresponding link invariants [7] and local invariants [40,41], and determinants are connected with the concurrence [42,43]. Note that the first matrix in Equation (28) is the SWAP quantum gate [1].
To understand symmetry properties of Equations (28)–(30), we introduce the so called reverse matrix of size by . For it is
For any matrix the matrix is the matrix M reflected vertically, and the product is M reflected horizontally. In addition to the standard symmetric matrix satisfying (T is the transposition), one can introduce
Thus, a persymmetric matrix is symmetric with respect to the minor diagonal, while a 90°-symmetric matrix is symmetric under 90°-rotations. A bisymmetric matrix is symmetric and persymmetric simultaneously. In this notation, the first family of the permutation solutions Equation (28) are bisymmetric, but not 90°-symmetric, while the second family of the solutions Equation (30) are, oppositely, 90°-symmetric, but not symmetric and not persymmetric (which explains their notation).
In the next step, we define the corresponding parameter-permutation solutions replacing the units in Equation (28) by parameters. We found the following four 4-vertex solutions to the Yang–Baxter Equation (12) over
The first pair of solutions Equation (35) correspond to the bi-symmetric permutation matrices Equation (28), and we call them star-like solutions, while the second two solutions Equation (37) correspond to the 90°-symmetric matrices Equation (28), which are called circle-like solutions.
The first (second) star-like solution in Equation (35) with () becomes symmetric (persymmetric), while on the other hand with () it becomes persymmetric (symmetric). They become bisymmetric parameter-permutation solutions if all the parameters are equal . The circle-like solutions Equation (37) are 90°-symmetric when .
2.5. Group Structure of 4-Vertex and 8-Vertex Matrices
Let us analyze the group structure of 4-vertex matrices Equations (35)–(37) with respect to matrix multiplication, i.e., which kinds of subgroups in they can form. For this, we introduce four 4-vertex matrices over : two star-like matrices
and two circle-like matrices
Denoting the corresponding sets by and , these do not intersect and are closed with respect to the following multiplications
Note that there are no closed binary multiplications among the sets of 4-vertex matrices Equations (39) and (40).
To give a proper group interpretation of Equations (42)–(45), we introduce a k-ary (polyadic) general linear semigroup , where is the set of matrices over and is an ordinary product of k matrices. The full semigroup is derived in the sense that its product can be obtained by repeating the binary products that are (binary) closed at each step. However, matrices of special shape can form k-ary subsemigroups of , which can be closed with respect to the product of at minimum k matrices, but not of 2 matrices, and we call such semigroups k-non-derived. Moreover, we have for the sets and
A simple example of a 3-nonderived subsemigroup of the full semigroup is the set of antidiagonal matrices (having nonzero elements on the minor diagonal only): the product of 3 matrices from is closed, and therefore is a subsemigroup of the full ternary general linear semigroup with the multiplication as the ordinary triple matrix product.
In the theory of polyadic groups [44], an analog of the binary inverse is given by the querelement, which is denoted by and in the matrix k-ary case is defined by
where can be on any place. If each element of the k-ary semigroup (or its subsemigroup) has its querelement , then this semigroup is a k-ary general linear group .
In the set of matrices, the binary (ordinary) product is defined (even it is not closed), and for invertible matrices we formally determine the standard inverse , but for arity it does not coincide with the querelement , because, as follows from Equation (47) and cancellativity in that
The k-ary (polyadic) identity in is defined by
which holds when M in the l.h.s. is on any place. If M is only on one or another side (but not in the middle places) in Equation (49), is called left (right) polyadic identity. For instance, in the subsemigroup (in ) of antidiagonal matrices the ternary identity can be chosen as the reverse matrix Equation (32) having units on the minor diagonal, while the ordinary unit matrix is not in . It follows from Equation (49) that for matrices over the (left, right) polyadic identity is
which means that for the ordinary matrix product is a -root of (or is a reflection of degree), while both sides cannot belong to a subsemigroup of under consideration (as in ). As the solutions of (50) are not unique, there can be many k-ary identities in a k-ary matrix semigroup. We denote the set of k-ary identities by . In the case of the ternary identity can be chosen as any of the reverse matrices Equation (32) with unit complex numbers , on the minor diagonal, where satisfy additional conditions depending on the semigroup. In the concrete case of the conditions, giving Equation (50), are , , .
In the framework of the above definitions, we can interpret the closed products Equations (42) and (43) as the multiplications of the ternary semigroups . The corresponding querelements are given by
The ternary semigroups having querelements for each element (i.e., the additional operation defined by Equation (52)) are the ternary groups , which are two (non-intersecting because ) subgroups of the ternary general linear group . The ternary identities in are the following different continuous sets , where
In the particular case , , the ternary identities Equations (53) and (54) coincide with the bisymmetric permutation matrices Equation (28).
Next we treat the closed set products Equations (44) and (45) as the multiplications of the 5-ary semigroups . The querelements are
, and the corresponding 5-ary groups which are two (non-intersecting because ) subgroups of the 5-ary general linear group . We have the following continuous sets of 5-ary identities in satisfying
In the case , , the 5-ary identities Equations (56) and (57) coincide with the 90°-symmetric permutation matrices (30).
Thus, it follows from Equations (52)–(57) that the 4-vertex star-like (39) and circle-like Equation (40) matrices form subgroups of the k-ary general linear group with significantly different properties: they have different querelements and (sets of) polyadic identities, and even the arities of the subgroups and do not coincide Equations (42)–(45). If we take into account that 4-vertex star-like Equation (39) and circle-like Equation (40) matrices are (binary) additive and distributive, then they form (with respect to the binary matrix addition and the multiplications and ) the -ring and -ring .
Next we consider the “interaction” of the 4-vertex star-like Equation (39) and circle-like Equation (40) matrix sets, i.e., their exotic module structure. For this, let us recall the ternary (polyadic) module [45] and s-place action [46] definitions, which are suitable for our case. An abelian group is a ternary left (middle, right) -module (or a module over ), if there exists a ternary operation (, ) which satisfies some compatibility conditions (associativity and distributivity) which hold in the matrix case under consideration (and where the module operation is the triple ordinary matrix product) [45]. A 5-ary left (right) module over is a 5-ary operation () with analogous conditions (and where the module operation is the pentuple matrix product) [46].
First, we have the triple relations “inside” star and circle matrices
We observe the following module structures on the left column above (elements of the corresponding module are in brackets, and we informally denote modules by their sets):
Note that the sum of 4-vertex star solutions of the Yang–Baxter Equation (35) (with different parameters) gives the shape of 8-vertex matrices, and the same with the 4-vertex circle solutions Equation (37). Let us introduce two kinds of 8-vertex matrices over : an 8-vertex star matrix and an 8-vertex circle matrix as
If and are invertible (the determinants in Equations (82) and (83) are non-vanishing), then
and therefore the parameter conditions for invertibility are the same in both and
The corresponding sets and are closed under the following multiplications
and in terms of sets we can write and , while and (see Equation (46)). Note that, if and are treated as elements of an algebra, then Equations (87)–(89) are reminiscent of the Cartan decomposition (see, e.g., [47]), but we will consider them from a more general viewpoint, which will treat such structures as semigroups, ternary groups and modules.
Thus, the set is closed, and because of the associativity of matrix multiplication, forms a non-commutative semigroup, which we call a 8-vertex matrix semigroup , which contains the zero matrix and is a subsemigroup of the (binary) general linear semigroup . It follows from Equation (87), that is its subsemigroup . Moreover, the invertible elements of form a 8-vertex matrix group , because its identity is a unit matrix , and so is a subgroup of and a subgroup of the (binary) general linear group . The structure of Equation (87) is similar to that of block-diagonal and block-antidiagonal matrices (of the necessary sizes). So the 8-vertex (binary) matrix semigroup in which the parameters satisfy Equation (86) is a 8-vertex (binary) matrix group , having a subgroup , where is an ordinary matrix product, and is its identity.
The group structure of the circle matrices Equation (83) follows from
which means that is closed with respect to the product of three matrices (the product of two matrices from is outside the set Equation (89)). We define a ternary multiplication as the ordinary triple product of matrices, then is a ternary (3-nonderived) semigroup with the zero which is a subsemigroup of the ternary (derived) general linear semigroup . Instead of the inverse, for each invertible element , we introduce the unique querelement [44] by Equation (47), and since the ternary product is the triple ordinary product, we have from Equation (48). Thus, if the conditions of invertibility Equation (86) hold valid, then the ternary semigroup becomes the ternary group , which does not contain the ordinary (binary) identity, since . Nevertheless, the ternary group of circle matrices has the following set of left-right 6-vertex and 8-vertex ternary identities (see Equations (49) and (50))
which (without additional conditions) depend upon the free parameters , , and , . In the binary sense, the matrices from Equation (91) are mutually similar, but as ternary identities they are different.
If we consider the second operation for matrices (as elements of a general matrix ring), the binary matrix addition , the structure of becomes more exotic: the set is a -ring with the binary addition and binary multiplication from the semigroup , while is a -ring with the binary matrix addition , the ternary matrix multiplication and the zero Z.
Moreover, because of the distributivity and associativity of binary matrix multiplication, the relations Equation (88) mean that the set (being an abelian group under binary addition) can be treated as a left and right binary module over the ring with an operation : the module action , (coinciding with the ordinary matrix product Equation (88)). The left and right modules are compatible, since the associativity of ordinary matrix multiplication gives the compatibility condition , , , and therefore (as an abelian group under the binary addition and the module action ) is a -bimodule . The last relation Equation (89) shows another interpretation of as a formal “square root” of (as sets).
2.6. Star 8-Vertex and Circle 8-Vertex Yang–Baxter Maps
Let us consider the star 8-vertex solutions to the Yang–Baxter Equation (12), having the shape Equation (82), in the most general setting, over and for different ranks (i.e., including noninvertible ones). In components they are determined by
Solutions from, e.g., [31,35,38], etc., should satisfy this overdetermined system of 24 cubic equations for 8 variables.
We search for the 8-vertex constant solutions to the Yang–Baxter equation over without additional conditions, unitarity, etc. (which will be considered in the next sections). We will also need the matrix functions tr and det, which are related to link invariants, as well as eigenvalues, which help to find similar matrices and q-conjugated solutions to braid equations. Take into account that the Yang–Baxter maps are determined up to a general complex factor Equation (14). For eigenvalues (which are determined up to the same factor t) we use the notation: .
We found the following 8-vertex solutions, classified by rank and number of parameters.
- Rank (invertible star Yang–Baxter maps) are
(1) quadratic in two parameters
(2) quadratic in three parameters
(3) irrational in three parameters
Note that only the first and the last cases are genuine 8-vertex Yang–Baxter maps, because the three-parameter matrices Equation (95) are q-conjugated with the 4-vertex parameter-permutation solutions Equation (35). Indeed,
where is a free parameter. If , two matrices q in Equation (100) are similar, and we have the unique q-conjugation (99). Another solution in Equation (95) is q-conjugated to the second 4-vertex parameter-permutation solutions Equation (35) such that
where q’s are pairwise similar in Equation (102), and therefore we have 2 different q-conjugations.
- Rank (noninvertible star Yang–Baxter maps) are quadratic in parameters
There are no star 8-vertex solutions of rank 3. The above two solutions for with different signs are q-conjugated (19) with the matrix q being one of the following
Further families of solutions can be obtained from Equations (93)–(103) by applying the general q-conjugation Equation (14).
Particular cases of the star solutions are also called X-type operators [37] or magic matrices [18] connected with the Cartan decomposition of [27,28,48,49].
The circle 8-vertex solutions to the Yang–Baxter Equation (12) of the shape Equation (83) are determined by the following system of 32 cubic equations for 8 unknowns over
We found the 8-vertex solutions, classified by rank and number of parameters.
- Rank (invertible circle Yang–Baxter map) are quadratic in parameters
- Rank (noninvertible circle Yang–Baxter map) are linear in parameters
There are no circle 8-vertex solutions of rank 3. The corresponding families of solutions can be derived from the above by using the q-conjugation Equation (14).
A particular case of the 8-vertex circle solution Equation (106) was considered in [50].
2.7. Triangle Invertible 9- and 10-Vertex Solutions
There are some higher vertex solutions to the Yang–Baxter equations that are not in the above star/circle classification. They are determined by the following system of 15 cubic equations for 9 unknowns over
We found the following 9-vertex Yang–Baxter maps
The third matrix in Equation (110) is conjugated with the 4-vertex parameter-permutation solutions Equation (35) of the form (which has the same the same eigenvalues Equation (111))
by the conjugated matrix
The matrix Equation (113) cannot be presented as the Kronecker product Equation (16), and so the third matrix in Equations (110) and (112) are different solutions of the Yang–Baxter Equation (12). Despite the first two matrices in Equation (110) have the same eigenvalues (111), they are not similar, because they have different from Equation (112) middle Jordan blocks.
Then, we have another 3-parameter solutions with fractions
and
The 4-parameter 9-vertex solution is
We also found 5-parameter, 9-vertex solution of the form
Finally, we found the following 3-parameter 10-vertex solution
This 10-vertex solution is conjugated with the 4-vertex parameter-permutation solutions Equation (35) of the form (which has the same the same eigenvalues as Equation (124))
by the conjugated matrix
3. Polyadic Braid Operators and Higher Braid Equations
The polyadic version of the braid Equation (1) was introduced in [21]. Here, we define higher analog of the Yang–Baxter operator and develop its connection with higher braid groups and quantum computations.
Let us consider a vector space over a field . A polyadic (n-ary) braid operator is defined as the mapping [21]
The polyadic analog of the braid Equation (1) was introduced in [21] using the associative quiver technique [46].
Let us introduce n operators
i.e., p is a place of instead of one in . A system of polyadic (n-ary) braid equations is defined by
In the lowest non-binary case , we have the ternary braid operator and two ternary braid equations on
Note that the higher braid equations presented above differ from the generalized Yang–Baxter equations of [23,24,51].
The higher braid operators Equation (128) satisfying the higher braid Equations (131)–(133) can represent the higher braid group [22] using Equations (6) and (130). By analogy with Equation (6) we introduce m operators by
The representation of the higher braid group (of -degree in the notation of [22]) (having generators and identity ) is given by
In this way, the generators of the higher braid group satisfy the relations
- n higher braid relations
- n-ary far commutativity
In the case and , the higher braid group is represented by Equation (134) and generated by 3 generators , , , which satisfy two braid relations only (without far commutativity)
According to Equations (143) and (144), the far commutativity relations appear when the number of elements of the higher braid groups satisfy
such that all conditions Equation (145) should hold. Thus, to have the far commutativity relations in the ordinary (binary) braid group Equation (5), we need 3 generators and , while for we need at least 7 generators and (see Example 7.12 in [22]).
In the concrete realization of as a d-dimensional euclidean vector space over the complex numbers and basis , , the polyadic (n-ary) braid operator becomes a matrix of size , which satisfies the higher braid Equations (131)–(133) in matrix form. In the components, the matrix braid operator is
Thus, we have unknowns in satisfying Equations (131)–(133) in components of polynomial power . In the minimal non-binary case , we have equations of power 4 for unknowns, e.g., even for we have 2048 for 64 components, and for there are 118,098 equations for 729 components. Therefore, solving the matrix higher braid equations directly is cumbersome, and only particular cases are possible to investigate, for instance by using permutation matrices Equation (28), or the star and circle matrices Equations (82) and (83).
4. Solutions to the Ternary Braid Equations
Here we consider some special solutions to the minimal ternary version () of the polyadic braid Equations (131)–(133), the ternary braid Equation (134).
4.1. Constant Matrix Solutions
Let us consider the following two-dimensional vector space (which is important for quantum computations) and the component matrix realization Equation (148) of the ternary braiding operator as
We now turn Equation (149) to the standard matrix form (just to fix notations) by introducing the 8-dimensional vector space with the natural basis , where is a cumulative index. The linear operator corresponding to Equation (149) is given by the matrix as . The operators Equations (129) and (130) become three matrices as
where is the Kronecker product of matrices and is the identity matrix. In this notation the operator ternary braid Equations (134) become the matrix equations (cf. Equations (131)–(133)) with )
which we call the total matrix ternary braid equations. Some weaker versions of ternary braiding are described by the partial braid equations
where, obviously, two of them are independent. It follows from Equations (131)–(133) that the weaker versions of braiding are possible for , only, so for higher than binary braiding (the Yang–Baxter Equation (8)).
Thus, comparing Equations (151) and (146), we conclude that (for each invertible matrix in Equation (150) satisfying Equation (151)) the isomorphism , gives a representation of the braid group by matrices over .
Now, we can generate families of solutions corresponding to Equations (150) and (151) in the following way. Consider an invertible operator in the two-dimensional vector space . In the basis its matrix q is given by . In the natural 8-dimensional basis , the tensor product of operators is presented by the Kronecker product of matrices . Let the matrix be a fixed solution to the ternary braid matrix Equation (151). Then, the family of solutions corresponding to the invertible matrix q is the conjugation of by so that
This also follows directly from the conjugation of the braid Equations (151)–(154) by and Equation (150). If we include the obvious invariance of the braid equations with the respect of an overall factor , the general family of solutions becomes (cf. the Yang–Baxter Equation [35])
Let
and then the manifest form of is
It is important that not every conjugation matrix has this very special form Equation (158), and that therefore, in general, conjugated matrices are different solutions of the ternary braid Equation (151). The matrix (★ being the Hermitian conjugation) is diagonal (this case is important for further classification similar to the binary one [31]), when the conditions
hold, and so the matrix q has the special form (depending of 3 complex parameters, for )
We can present the families Equation (155) for different ranks, because the conjugation by an invertible matrix does not change rank. To avoid demanding Equation (159), due to the cumbersome calculations involved, we restrict ourselves to a triangle matrix for q Equation (157).
In general, there are unknowns (elements of the matrix ), and each partial braid Equations (152)–(154) gives conditions (of power 4) for the elements of , while the total braid Equation (151) gives twice as many conditions (cf. the binary case: 64 cubic equations for 16 unknowns Equation (8)). This means that even in the ternary case, the higher braid system of equations is hugely overdetermined, and finding even the simplest solutions is a non-trivial task.
4.2. Permutation and Parameter-Permutation 8-Vertex Solutions
First, we consider the case when is a binary (or logical) matrix consisting of only, and, moreover, it is a permutation matrix (see Section 2.4). In the latter case, can be considered as a matrix over the field (Galois field ). In total, there are permutation matrices of the size . All of them are invertible of full rank 8, because they are obtained from the identity matrix by permutation of rows and columns.
We have found the following four invertible 8-vertex permutation matrix solutions to the ternary braid Equation (151)
and
The first two solutions Equation (161) are given by bisymmetric permutation matrices (see Equation (33)), and we call them 8-vertex and , respectively. The second two solutions Equation (163) are symmetric matrices only (we call them 8-vertex and ), but one matrix is a reflection of the other with respect to the minor diagonal (making them mutually persymmetric). No -symmetric (see Equation (34)) solution for the ternary braid Equations (151) was found. The bisymmetric and symmetric matrices have the same eigenvalues, and are therefore pairwise conjugate, but not q-conjugate, because the conjugation matrices do not have the form Equation (158). Thus, they are 4 different permutation solutions to the ternary braid Equations (151). Note that the solution Equation (161) coincides with the three-qubit swap operator introduced in [18].
All the permutation solutions are reflections (or involutions) having , eigenvalues , and are semi-magic squares (the sums in rows and columns are 1, but not the sums in both diagonals). The 8-vertex permutation matrix solutions do not form a binary or ternary group, because they are not closed with respect to multiplication.
By analogy with Equations (35)–(37), we obtain the 8-vertex parameter-permutation solutions from Equations (161)–(163) by replacing units with parameters and then solving the ternary braid Equations (151). Each type of the permutation solutions and from Equations (161)–(163) will give a corresponding series of parameter-permutation solutions over . The ternary braid maps are determined up to a general complex factor (see Equation (14) for the Yang–Baxter maps and Equation (156)), and therefore we can present all the parameter-permutation solutions in polynomial form.
- The series consists of 2 two-parameter matrices with and 2 two-parameter matricesand
- The series consists of 4 two-parameter matricesand
- The series consists of 4 two-parameter matricesand
- The series consists of 4 two-parameter matricesand
The above matrices with the same eigenvalues are similar, but their conjugation matrices do not have the form of the triple Kronecker product Equation (158), and therefore all of them together are 16 different two-parameter invertible solutions to the ternary braid Equation (151). Further families of solutions can be obtained using ternary q-conjugation Equation (156).
4.3. Group Structure of the Star and Circle 8-Vertex Matrices
Here, we investigate the group structure of matrices by analogy with the star-like Equation (39) and circle-like Equation (40) matrices, which are connected with our 8-vertex constant solutions Equations (165)–(179) to the ternary braid Equations (151).
Let us introduce the star-like matrices (see their analog Equation (39)), which correspond to the series Equations (165)–(171)
and the circle-like matrices (see their analog Equation (40)) which correspond to the series (173)–(179)
Denote the corresponding sets by and , then we have for them (which differs from matrix sets Equation (46))
where is the set of diagonal matrices. As for star-like and circle-like matrices, there are no closed binary multiplications for the sets of 8-vertex matrices Equations (181) and (182). Nevertheless, we have the following triple set products
which should be compared with the analogous matrices Equations (44) and (45): note that now we do not have pentuple products.
Using the definitions Equations (47)–(50), we interpret the closed products Equations (185)–(188) as the multiplications (being the ordinary triple matrix product) of the ternary semigroups and , respectively. The corresponding querelements Equation (47) are given by
and
The ternary semigroups and = in which every element has its querelement given by Equations (189)–(191) become the ternary groups and = , which are four different (3-nonderived) ternary subgroups of the derived ternary general linear group . The ternary identities in and are the following different continuous sets and , where
and
such that all the identities are the matrix reflections (see Equations (50)). If , , the ternary identities Equations (193) and (194) coincide with the permutation matrices Equations (161)–(163), which are solutions to the ternary braid Equation (151).
The module structure of the 8-vertex star-like Equation (181) and circle-like (182) matrix sets differs from the matrix sets Equations (58)–(81). Firstly, because of the absence of pentuple matrix products Equations (76)–(81), and secondly through some differences in the ternary closed products of sets.
We have the following triple relations between star and circle matrices separately (the sets corresponding to modules are in brackets, and we informally denote modules by their sets)
So we may observe the following module structures:
4.4. Group Structure of the Star and Circle 16-Vertex Matrices
Next, we will introduce matrices of a special form similar to the star 8-vertex matrices Equation (82) and the circle 8-vertex matrices (83), analyze their group structure and establish which ones could be 16-vertex solutions to the ternary braid Equation (151). We will derive the solutions in the opposite way to that for the 8-vertex Yang–Baxter maps, following the note after Equation (37). The sum of the solutions Equation (161) gives the shape of the star matrix (as in Equation (82)), while the sum of solutions Equation (163) gives the circle matrix (as in Equation (83))
The 16-vertex matrices are invertible, if and , which give the following joint conditions on the parameters (cf. Equation (86))
Only in this concrete parametrization Equations (209) and (210) do the matrices and have the same trace, determinant and eigenvalues, and they are diagonalizable and conjugate via
The matrix cannot be presented in the form of a triple Kronecker product Equation (158), and so two matrices and are not q-conjugate in the parametrization Equations (209) and (210), and can lead to different solutions to the ternary braid Equation (151). It follows from Equation (212) that 16-vertex matrices with all nonzero entries equal to 1 are non-invertible, having vanishing determinant and rank 4. In the case all the conditions Equation (212) holding, the inverse matrices become
Denoting the sets of matrices corresponding to Equations (209) and (210) by and , their multiplications are
and in term of sets and , and and (see (184)). Note that the structure Equation (216) is considerably different from the binary case Equations (87)–(89), and therefore it may not necessarily be related to the Cartan decomposition.
The products Equation (216) mean that both and are separately closed with respect to binary matrix multiplication , and therefore and are semigroups. We denote their intersection by , which is a semigroup of diagonal 8-vertex matrices. In case the invertibility conditions Equation (212) are fulfilled, the sets and form subgroups and (where is the identity matrix) of with the inverse elements given explicitly by Equations (214) and (215). Because the elements and in Equations (209) and (210) are conjugates by the invertible matrix Equation (213), the subgroups and (as well as the semigroups and ) are isomorphic by the obvious isomorphism
where is in Equation (213).
The “interaction” between and also differs from the binary case Equation (88), because
where is a set of 32-vertex so called quad-matrices of the form
Because of Equation (219), the set is closed with respect to matrix multiplication, and therefore (for invertible matrices ) the group is a subgroup of . So, in trying to find higher 32-vertex solutions (having at most half as many unknown variables as a general matrix) to the ternary braid Equation (151) it is worthwhile to search within the class of quad-matrices Equation (220).
Thus, the group structure of the above 16-vertex matrices Equations (216)–(219) is considerably different to that of 8-vertex matrices Equations (82) and (83) as the former contains two isomorphic binary subgroups and of (cf. Equations (87)–(89) and Equation (216)).
The sets , and are closed with respect to matrix addition as well, and therefore (because of the distributivity of ) they are the matrix rings , and , respectively. In the invertible case (212) and , these become matrix fields.
4.5. Pauli Matrix Presentation of the Star and Circle 16-Vertex Constant Matrices
The main peculiarity of the 16-vertex matrices Equations (216)–(219) is the fact that they can be expressed as special tensor (Kronecker) products of the Pauli matrices (see, also, [18,27]). Indeed, let
where are Pauli matrices (we have already used the letter “” for the braid group generators Equation (5))
Among the total of 64 matrices Equation (221) there are 24, which generate the matrices Equation (209) and Equation (210):
- 8 diagonal matrices:
- 8 anti-diagonal matrices:
- 8 circle-like matrices ( with 0’s on diagonal):
Thus, in general, we have the following set structure for the star and circle 16-vertex matrices Equations (209) and (210):
In particular, for the 8-vertex permutation solutions Equations (161)–(163) of the ternary braid Equation (151), we have
4.6. Invertible and Non-Invertible 16-Vertex Solutions to the Ternary Braid Equations
First, consider the 16-vertex solutions to Equation (151) having the star matrix shape Equation (209). We found the following 2 one-parameter invertible solutions:
Both matrices in Equation (230) are diagonalizable and are conjugates via
which cannot be presented in the form of a triple Kronecker product (158). Therefore, the two solutions in Equation (230) are not q-conjugate and become different 16-vertex one-parameter invertible solutions of the braid Equation (151).
In search of 16-vertex solutions to the total braid Equations (151) of the circle matrix shape Equation (210), we found that only non-invertible ones exist. They are the following two 2-parameter solutions of rank 4
Two matrices in Equation (233) are not even conjugates in the standard way, and so they are different 16-vertex two-parameter non-invertible solutions to the braid Equation (151).
For the only partial 13-braid Equation (153), there are 4 polynomial 16-vertex two-parameter invertible solutions
Furthermore, for the partial 13-braid Equation (153), we found 4 exotic irrational (an analog of Equation (97) for the Yang–Baxter Equation (12)) 16-vertex, two-parameter invertible solutions of rank 8 of the form
and
The matrices in Equations (235)–(239) are diagonalizable, have the same eigenvalues Equation (241) and are pairwise conjugate by
Because cannot be presented in the form Equation (158), all solutions in Equations (235)–(239) are not mutually q-conjugate and become 8 different 16-vertex two-parameter invertible solutions to the partial 13-braid Equation (153). If , then the matrices Equations (235)–(239) become of rank 4 with vanishing determinants Equations (237) and (240), and therefore in this case they are a 16-vertex one-parameter circle of non-invertible solutions to the total braid Equation (151).
4.7. Higher -Vertex Constant Solutions to n-Ary Braid Equations
Next, we considered the 4-ary constant braid Equations (131)–(133) and found the following 32-vertex star solution
We may compare Equation (243) with particular cases of the star solutions to the Yang–Baxter Equation (93) and the ternary braid Equation (230)
Informally, we call such solutions the “Minkowski” star solutions, since their legs have the “Minkowski signature”. Thus, we assume that in the general case for the n-ary braid equation, there exist -vertex matrix “Minkowski” star invertible solutions of the above form
This allows us to use the general solution Equation (245) as n-ary braiding quantum gates with an arbitrary number of qubits.
5. Invertible and Noninvertible Quantum Gates
Informally, quantum computing consists of preparation (setting up an initial quantum state), evolution (by a quantum circuit) and measurement (projection onto the final state). Mathematically (in the computational basis), the initial state is a vector in a Hilbert space (multi-qubit state), the evolution is governed by successive (quantum circuit) invertible linear transformations (unitary matrices called quantum gates) and the measurement is made by non-invertible projection matrices to leave only one final quantum (multi-qubit) state. So, quantum computing is non-invertible overall, and we may consider non-invertible transformations at each step. It was then realized that one can “invite” the Yang–Baxter operators (solutions of the constant Yang–Baxter equation) into quantum gates, providing a means of entangling otherwise non-entangled states. This insight uncovered a deep connection between quantum and topological computation (see for details, e.g., [9,13]).
Here, we propose extending the above picture in two directions. First, we can treat higher braided operators as higher braiding gates. Second, we will analyze the possible role of non-invertible linear transformations (described by the partial unitary matrices introduced in Equations (20) and (21)), which can be interpreted as a property of some hypothetical quantum circuit (for instance, with specific “loss” of information, some kind of “dissipativity” or “vagueness”). This can be considered as an intermediate case between standard unitary computing and the measurement only computing of [52].
To establish notation recall [1], that in the computational basis (vector representation) and Dirac notation, a (pure) one-qubit state is described by a vector in two-dimensional Hilbert space
where is a probability amplitude of . Sometimes, for a one-qubit state, it is convenient to use the Bloch unit sphere representation (normalized up to a general unimportant and unmeasurable phase)
A (pure) state of L-qubits is described by amplitudes, and so is a vector in -dimensional Hilbert space. If cannot be presented as a tensor product of L one-qubit states Equation (246), it is called entangled. For instance, a two-qubit pure state
is entangled, if , and the concurrence
is the measure of entanglement . It follows from Equation (246), that the tensor product of states has vanishing concurrence . An example of the maximally entangled () two-qubit states is the (first) Bell state .
The concurrence of the three-qubit state
is determined by the Cayley’s hyperdeterminant
Thus, if the three-qubit state Equation (252) is not entangled, then (for the tensor product of one-qubit states). One of the maximally entangled () three-qubit states is the GHZ state .
A quantum L-qubit gate is a linear transformation of -dimensional Hilbert space , which in the computational basis (246) is described of the matrix such that the L-qubit state transforms as . In this way, a quantum circuit is described as the successive application of elementary gates to an initial quantum state, that is the product of the corresponding matrices (for details, see, e.g., [1]). It is a standard assumption that each elementary L-qubit transformation is unitary, which implies the following strong restriction on the corresponding matrix as
where I is the identity matrix for L-qubit state and the operation is the conjugate-transposition. The first equality in Equation (255) means that the matrix is normal (cf. Equations (20) and (21)). The Equations (255) follow from the definition of the adjoint operator
applied to this simplest example of L-qubits in the -dimensional Hilbert space (for the general case the derivation almost literally coincides), which we write in the following special form (in Dirac notation with bra- and ket-vectors) with explicitly added identities. Then, Equation (255) follows from Equation (256) as
and any unitary matrix preserves the inner product
which means that unitary operators satisfying Equation (255) are bounded operators (bounded matrices in our case) and invertible with the inverse .
Let us consider a possibility of non-invertible intermediate transformations of L-qubit states, i.e., non-invertible gates, which are described by the matrices of (possibly) less than full rank . This can be related to the production of “degenerate” states (see, e.g., [43]), “particle loss” [53,54,55], and the role of ranks in multiparticle entanglement [56,57].
In the limited cases , and corresponds to the measurement matrix being the projection to one final vector . In this case, for non-invertible transformations with instead of unitarity Equation (255) we consider partial unitarity Equations (20) and (21) as
where and are (or may be) different partial shuffle identities having r units on the diagonal. There is an exotic limiting case, which is impossible for the identity I: we call two partial identities orthogonal, if
where is the zero matrix.
We propose corresponding non-invertible analogs of Equations (256)–(258) as follows. The partial adjoint operator in the -dimensional Hilbert space is defined by
such that (see Equations (259) and (260))
We call the r.h.s. of Equation (263) the partial inner product. So instead of Equation (258) we define as the partially bounded operator
Thus, if the partial identities are orthogonal Equation (261), then the partial inner product vanishes identically, and the operator becomes a zero norm operator in the sense of Equation (264), although Equations (259) and (260) are not zero.
In case the rank r is fixed, there can be partial unitary matrices satisfying Equations (259) and (260).
We define a general unitary semigroup as a semigroup of matrices of rank r satisfying partial regularity Equations (259) and (260) (in the “symmetric” case ).
As an example, we consider two 2-qubit states Equation (250) and (with and ) and the non-invertible transformation described by three-parameter matrices of rank 3 (but which are not nilpotent)
The partial identities Equations (266) and (267) are not orthogonal Equation (261), because
which directly gives the signature of the partial inner product Equation (263), in our case of the Hilbert space .
The definition of a partial adjoint operator Equation (262) is satisfied with both sides being equal to . The partial boundedness condition Equation (264) holds with the partial inner product Equation (263) becoming , thus Equation (265), which is a bounded partial unitary operator.
An example of a zero norm (in our sense Equation (264)) operator is the two-parameter partial unitary rank 2 matrix
The partial unitarity relations for have the form
6. Binary Braiding Quantum Gates
Let us consider those Yang–Baxter maps that could be linear transformations of two-qubit spaces. We will pay attention to the most general 8-vertex solutions to the Yang–Baxter Equations (93)–(103) and (106)–(108), which are unitary (and invertible) or partial unitary Equations (20) and (21) (and non-invertible).
Consider the unitary version of the invertible star 8-vertex solutions Equations (93)–(97) to the matrix Yang–Baxter Equation (12). We use the exponential form of the parameters
With the choice of parameters and lower signs, the solution Equation (273) coincides with the 8-vertex braiding gate of [13].
Next, we search for unitary solutions among the invertible circle of 8-vertex traceless solutions Equation (106) to the matrix Yang–Baxter Equation (12) with parameters in the exponential form Equation (272). The unitarity conditions Equation (255) give the following equations on the parameters Equation (272):
Thus, only the first solution leads to an 8-vertex two-parameter unitary braiding quantum gate of the form (we put in Equation (272))
7. Higher Braiding Quantum Gates
In general, only special linear transformations of -dimensional Hilbert space can be treated as elementary quantum gates for an L-qubit state [1]. First, in the invertible case, the transformations should be unitary Equation (255), and in the hypothetical non-invertible case they can satisfy partial unitarity Equations (259) and (260). Second, the braiding gates have to be matrix solutions to the constant Yang–Baxter Equation [13] or higher braid Equations (131)–(133). Here, we consider (as a lowest case higher example) the ternary braiding gates acting on 3-qubit quantum states, i.e., matrix solutions to the ternary braid Equation (151), which satisfy unitarity (255) or partial unitarity Equations (259) and (260).
Note that all the permutation solutions Equations (161)–(163) are by definition unitary, and are therefore ternary braiding gates “automatically”, and we call them permutation 8-vertex ternary braiding quantum gates . By the same reasoning, the unitary version of the invertible star 8-vertex parameter-permutation solutions Equations (165)–(179) to the ternary braid Equations (151) will contain the complex numbers of unit magnitude as parameters.
Indeed, for the bisymmetric series Equations (165)–(167) of star-like solutions, we have 4 two real parameter unitary ternary braiding quantum gates ()
which is a ternary analog of the first parameter-permutation solution to the Yang–Baxter equation from Equation (35). The ternary analog of the second star solution is the following unitary version of the bisymmetric series Equations (169)–(171)
The same unitary ternary analogs of the symmetric series Equations (173)–(179) for the first and the second circle-like solutions from Equation (37) are
and
respectively.
The invertible 16-vertex star-like solutions Equation (230) to the ternary braid Equation (151) lead to the following two unitary one-parameter ternary braiding quantum gates (cf. the binary case Equation (273))
The braiding gate Equation (287) is a ternary analog of Equation (273), and therefore with it can be treated as a ternary analog of the 8-vertex braiding gate considered in [13]. Note that the solution is transpose to the so-called generalized Bell matrix [23]. Comparing Equations (209) and (287), we observe that the ternary braiding quantum gates (acting on 3 qubits) are those elements of the 16-vertex star semigroup Equation (216), which satisfy unitarity Equation (255).
In the same way, the 32-vertex analog the 8-vertex binary braiding gate of [13] (now acting on 4 qubits) is the following constant 4-ary braiding unitary quantum gate
Thus, in general, the “Minkowski” star solutions for n-ary braid equations correspond to -vertex braiding unitary quantum gates as matrices acting on qubits
The braiding gate Equation (289) can be treated as a polyadic (n-ary) generalization of the GHZ generator (see, e.g., [18,23]) acting on qubits.
8. Entangling Braiding Gates
Entangled quantum states are obtained from separable states by acting with special quantum gates on two-qubit states and multi-qubit states [42,43]. Here, we consider the concrete form of braiding gates, which can be entangling or not entangling. There are general considerations on these subjects for the Yang–Baxter maps [13,37,40] and generalized Yang–Baxter maps [23,25,26,51]. We present the solutions for the binary and ternary braid maps introduced above, which connect the parameters of the gate and the state.
8.1. Entangling Binary Braiding Gates
Let us first examine, how the 8-vertex star binary braiding gate Equation (273) acts on the product of one-qubit states concretely. We use the Bloch representation Equation (248) to obtain the expression for the transformed concurrence Equation (251)
In general, a braiding gate is entangling if the transformed concurrence Equation (290) does not vanish, and its roots give the values of the gate parameters for which the gate is not entangling for a given two-qubit state. In search of the solutions for the transformed concurrence , we observe that one of the qubits has to be on the Bloch sphere equator (or ). Only in this case can the first (or second) bracket in Equation (290) vanish, and we obtain
Therefore, the 8-vertex star binary braiding gates Equation (273) with the parameters fixed by Equations (291) and (292) are not entangling.
Analogously to Equations (291) and (292), the concurrence of the states transformed by the 8-vertex circle binary braiding gate Equation (279) can vanish if
Thus, the 8-vertex circle binary braiding gates Equation (279) are not entangling if the parameters satisfy Equation (295).
In the case of the 4-vertex circle binary braiding gate Equation (281), the transformed concurrence vanishes identically, and therefore this gate is not entangling for any values of its parameters.
8.2. Entangling Ternary Braiding Gates
Let us consider the tensor product of three qubit pure states (in the Bloch representation Equation (248)), which obviously has zero concurrence Equation (253), because of the vanishing of the hyperdeterminant Equation (254). After transforming by the 16-vertex star ternary braiding gates Equation (287) the concurrence becomes
We observe that the ternary concurrence Equation (296) vanishes if any of the brackets are equal to zero. Because the domain of all angles is , we have solutions only for fixed discrete , , which means that on the Bloch sphere the quantum states should be on the equator (as in the binary case), or additionally at the poles. In this case, , and
Thus, for a fixed three-qubit product state one (or more) of which is at a pole or the equator of the Bloch sphere, those ternary braiding gates satisfying the conditions Equation (297) are not entangling , whereas in other cases they are entangling .
By analogy, a similar action of the 8-vertex bisymmetric (star-like) ternary braiding gates Equations (282)–(284) gives
Their solutions coincide with the binary case Equations (291) and (292) applied to the middle qubit and .
The action of the 8-vertex symmetric (circle-like) ternary braiding gates Equations (285) and (286) leads to the transformed concurrence
The conditions for this to vanish (i.e., when the gate becomes not entangling) coincide with those for the binary case Equations (291) and (292), applied here to the first or the third qubit.
Thus, we have shown that the braiding binary and ternary quantum gates can be either entangling or not entangling, depending on how their parameters are related to the concrete quantum state on which they act. The constructions presented here could be used, e.g., in the entanglement-free protocols [58,59] and some experiments [60,61]. This can also allow us to build quantum networks without any entangling at all (non-entangling networks), when the next gate depends upon the previous state in such a way that at each step there is no entangling, as the separable, but different, final state is received from a separable initial state.
9. Conclusions
Thus, we have found and classified the constant matrix solutions to the Yang–Baxter equation and its polyadic generalization, the higher braid equations. The corresponding classes of matrices are described in terms of semigroups, groups, polyadic groups and modules. We have then treated the unitary solutions as quantum gates acting on multiqubit states. Finally, we have found the conditions for gates to become non-entangling, which can be applied to the corresponding networks.
Author Contributions
Conceptualization, S.D.; Writing—original draft, S.D.; Writing—review and editing, R.V. Both authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Acknowledgments
The first author (S.D.) is grateful to Vladimir Akulov, Mike Hewitt, Mikhail Krivoruchenko, Grigorij Kurinnoy, Thomas Nordahl, Sergey Prokushkin, Vladimir Tkach, Alexander Voronov and Wend Werner for fruitful discussions.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Nielsen, M.A.; Chuang, I.L. Quantum Computation and Quantum Information; Cambridge University Press: Cambridge, UK, 2000; p. 676. [Google Scholar]
- Kaye, P.; Laflamme, R.; Mosca, M. An Introduction to Quantum Computing; Oxford University Press: Oxford, UK, 2007. [Google Scholar]
- Williams, C.P.; Clearwater, S.H. Explorations in Quantum Computing; Springer: New York, NY, USA; Berlin/Heidelberg, Germany, 1998. [Google Scholar]
- Freedman, M.H.; Kitaev, A.; Larsen, M.J.; Wang, Z. Topological quantum computation. Bull. Am. Math. Soc. 2003, 40, 31–38. [Google Scholar] [CrossRef] [Green Version]
- Nayak, C.; Simon, S.H.; Stern, A.; Freedman, M.; DasSarma, S. Non-abelian anyons and topological quantum computation. Rev. Mod. Phys. 2008, 80, 1083–1159. [Google Scholar] [CrossRef] [Green Version]
- Rowell, E.C.; Wang, Z. Mathematics of topological quantum computing. Bull. Am. Math. Soc. 2018, 55, 183–238. [Google Scholar] [CrossRef] [Green Version]
- Turaev, V.G. The Yang-Baxter equation and invariants of links. Invent. Math. 1988, 92, 527–553. [Google Scholar] [CrossRef]
- Aravind, P.K. Borromean Entanglement of the GHZ State. In Potentiality, Entanglement and Passion-At-A-Distance; Cohen, R.S., Horne, M., Stachel, J., Eds.; Kluwer Acad. Publ.: Boston, MA, USA, 1997; Volume 194, pp. 53–59. [Google Scholar]
- Kauffman, L.H.; Lomonaco, S.J. Quantum entanglement and topological entanglement. New J. Phys. 2002, 4, 73.1–73.18. [Google Scholar] [CrossRef] [Green Version]
- Lambe, L.A.; Radford, D.E. Introduction to the Quantum Yang-Baxter Equation and Quantum Groups: An Algebraic Approach; Kluwer: Dordrecht, The Netherland, 1997; p. 292. [Google Scholar]
- Bukhshtaber, V.M. The Yang-Baxter transformation. Russ. Math. Surv. 1998, 53, 1343–1344. [Google Scholar] [CrossRef]
- Veselov, A.P. Yang-Baxter maps and integrable dynamics. Phys. Lett. 2003, A314, 214–221. [Google Scholar] [CrossRef] [Green Version]
- Kauffman, L.H.; Lomonaco, S.J. Braiding Operators are Universal Quantum Gates. New J. Phys. 2004, 6, 134–139. [Google Scholar] [CrossRef]
- Melnikov, D.; Mironov, A.; Mironov, S.; Morozov, A.; Morozov, A. Towards topological quantum computer. Nucl. Phys. 2018, B926, 491–508. [Google Scholar] [CrossRef]
- Alagic, G.; Jarret, M.; Jordan, S.P. Yang-Baxter operators need quantum entanglement to distinguish knots. J. Phys. A. Math. Theor. 2016, 49, 075203. [Google Scholar] [CrossRef] [Green Version]
- Kauffman, L.H.; Mehrotra, E. Topological aspects of quantum entanglement. Quantum Inf. Process. 2019, 18, 76. [Google Scholar] [CrossRef] [Green Version]
- Melnikov, D.; Mironov, A.; Mironov, S.; Morozov, A.; Morozov, A. From topological to quantum entanglement. J. High Energy Phys. 2019, 5, 116. [Google Scholar] [CrossRef] [Green Version]
- Ballard, A.D.; Wu, Y.S. Cartan decomposition and entangling power of braiding quantum gates. In Cross Disciplinary Advances in Quantum Computing; Mahdavi, K., Koslover, D., Brown, L.L., Eds.; Amer. Math. Soc.: Providence, RI, USA, 2011; Volume 536, pp. 1–15. [Google Scholar]
- Kolganov, N.; Morozov, A. Quantum R-matrices as universal qubit gates. JETP Lett. 2020, 111, 519–524. [Google Scholar] [CrossRef]
- Kolganov, N.; Mironov, S.; Morozov, A. Large k topological quantum computer. arXiv 2021, arXiv:2105.03980. [Google Scholar]
- Duplij, S. Polyadic Hopf algebras and quantum groups. East Eur. J. Phys. 2021, 2, 5–50. [Google Scholar] [CrossRef]
- Duplij, S. Higher braid groups and regular semigroups from polyadic-binary correspondence. Mathematics 2021, 9, 972. [Google Scholar] [CrossRef]
- Rowell, E.C.; Zhang, Y.; Wu, Y.S.; Ge, M.L. Extraspecial two-groups, generalized Yang-Baxter equations and braiding quantum gates. Quantum Inf. Comput. 2010, 10, 685–702. [Google Scholar]
- Kitaev, A.; Wang, Z. Solutions to generalized Yang-Baxter equations via ribbon fusion categories. Geom. Topol. Monogr. 2012, 18, 191–197. [Google Scholar] [CrossRef] [Green Version]
- Vasquez, J.F.; Wang, Z.; Wong, H.M. Qubit representations of the braid groups from generalized Yang-Baxter matrices. Quantum Inf. Process. 2016, 15, 3035–3042. [Google Scholar] [CrossRef] [Green Version]
- Padmanabhan, P.; Sugino, F.; Trancanelli, D. Generating W states with braiding operators. Quantum Inf. Comput. 2020, 13–14, 1154–1162. [Google Scholar] [CrossRef]
- Khaneja, N.; Glaser, S.J. Cartan decomposition of SU(2n) and control of spin systems. Chem. Phys. 2001, 267, 11–23. [Google Scholar] [CrossRef]
- Kraus, B.; Cirac, J.I. Optimal creation of entanglement using a two-qubit gate. Phys. Rev. 2001, A63, 062309. [Google Scholar] [CrossRef] [Green Version]
- Epping, M.; Kampermann, H.; Macchiavello, C.; Bruß, D. Multi-partite entanglement can speed up quantum key distribution in networks. New J. Phys. 2017, 19, 093012. [Google Scholar] [CrossRef]
- Vartiainen, J.J.; Niskanen, A.O.; Nakahara, M.; Salomaa, M.M. Acceleration of quantum algorithms using three-qubit gates. Inter. J. Quantum Inf. 2004, 2, 1–10. [Google Scholar] [CrossRef] [Green Version]
- Dye, H.A. Unitary Solutions to the Yang-Baxter Equation in Dimension Four. Quantum Inf. Process. 2003, 2, 117–150. [Google Scholar] [CrossRef]
- Drinfeld, V.G. Quasi-Hopf Algebras and Knizhnik-Zamolodchikov Equations. In Problems of Modern Quantum Field Theory; Belavin, A.A., Klimyk, A.V., Zamolodchikov, A.B., Eds.; Springer: Berlin/Heidelberg, Germany, 1989; pp. 1–13. [Google Scholar]
- Drinfeld, V.G. On some unsolved problems in quantum group theory. In Quantum Groups; Kulish, P.P., Ed.; Springer: Berlin/Heidelberg, Germany, 1992; pp. 1–8. [Google Scholar]
- Kassel, C. Quantum Groups; Springer: New York, NY, USA, 1995; p. 531. [Google Scholar]
- Hietarinta, J. Solving the two-dimensional constant quantum Yang-Baxter equation. J. Math. Phys. 1993, 34, 1725–1756. [Google Scholar] [CrossRef] [Green Version]
- Alagic, G.; Bapat, A.; Jordan, S. Classical simulation of Yang-Baxter gates. In Proceedings of the 9th Conference on the Theory of Quantum Computation, Communication and Cryptography, Singapore, 21–23 May 2014; Flammia, S.T., Harrow, A.W., Eds.; Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern: Dagstuhl, Germany; Volume 27, pp. 161–175. [Google Scholar]
- Padmanabhan, P.; Sugino, F.; Trancanelli, D. Local invariants of braiding quantum gates—associated link polynomials and entangling power. J. Phys. A Math. Theor. 2021, 54, 135301. [Google Scholar] [CrossRef]
- Iantovics, L.B.; Nichita, F.F. On the Colored and the Set-Theoretical Yang-Baxter Equations. Axioms 2021, 10, 146. [Google Scholar] [CrossRef]
- Nashed, M.Z. Generalized Inverses and Applications; Academic Press: New York, NY, USA, 1976; p. 321. [Google Scholar]
- Balakrishnan, S.; Sankaranarayanan, R. Entangling power and local invariants of two-qubit gates. Phys. Rev. A 2010, 82, 034301. [Google Scholar] [CrossRef] [Green Version]
- Sudbery, A. On local invariants of pure three-qubit states. J. Phys. A Math. Gen. 2001, 34, 643–652. [Google Scholar] [CrossRef]
- Walter, M.; Gross, D.; Eisert, J. Multipartite entanglement. In Quantum Information; Bruss, D., Leuchs, G., Eds.; John Wiley & Sons: Hoboken, NJ, USA, 2016; pp. 293–330. [Google Scholar] [CrossRef] [Green Version]
- Jaffali, H.; Oeding, L. Learning Algebraic Models of Quantum Entanglement. Quantum Inf. Process. 2020, 19, 279. [Google Scholar] [CrossRef]
- Dörnte, W. Unterschungen über einen verallgemeinerten Gruppenbegriff. Math. Z. 1929, 29, 1–19. [Google Scholar] [CrossRef]
- Duplij, S. Ternary Hopf Algebras. In Symmetry in Nonlinear Mathematical Physics; Nikitin, A.G., Boyko, V.M., Eds.; Institute of Mathematics: Kiev, Ukraine, 2001; pp. 25–34. [Google Scholar]
- Duplij, S. Polyadic Algebraic Structures and Their Representations. In Exotic Algebraic and Geometric Structures in Theoretical Physics; Duplij, S., Ed.; Nova Publishers: New York, NY, USA, 2018; pp. 251–308. [Google Scholar]
- Helgason, S. Differential Geometry and Symmetric Spaces; Academic Press: New York, NY, USA; London, UK, 1962. [Google Scholar]
- Bullock, S.S. Note on the Khaneja Glaser decomposition. Quantum Inf. Comp. 2004, 4, 396–400. [Google Scholar]
- Bullock, S.S.; Brennen, G.K. Canonical decompositions of n-qubit quantum computations and concurrence. J. Math. Phys. 2004, 45, 2447–2467. [Google Scholar] [CrossRef] [Green Version]
- Asaulko, K.S.; Korablev, P.G. On a Yang-Baxter operator and the corresponding knots invariant. Chelyabinsk Phys. Math. J. 2019, 4, 255–264. [Google Scholar]
- Chen, R.S. Generalized Yang-Baxter equations and braiding quantum gates. J. Knot Theory Its Ramif. 2012, 21, 1250087. [Google Scholar] [CrossRef] [Green Version]
- Bonderson, P.; Freedman, M.; Nayak, C. Measurement-only topological quantum computation. Phys. Rev. Lett. 2008, 101, 010501. [Google Scholar] [CrossRef] [Green Version]
- Neven, A.; Martin, J.; Bastin, T. Entanglement robustness against particle loss in multiqubit systems. Phys. Rev. 2018, A98, 062335. [Google Scholar] [CrossRef] [Green Version]
- Fraïsse, J.M.E.; Braun, D. Quantum channel-estimation with particle loss: GHZ versus W states. Quantum Meas. Quantum Metrol. 2016, 3, 53–67. [Google Scholar] [CrossRef] [Green Version]
- Zangi, S.M.; Qiao, C.F. Robustness of 2 × N × M entangled states against qubit loss. Phys. Lett. 2021, 400, 127322. [Google Scholar] [CrossRef]
- Chong, B.; Keiter, H.; Stolze, J. Multiparticle entanglement and ranks of density matrices. arXiv 2005, arXiv:0512199. [Google Scholar]
- Bruzda, W.; Friedland, S.; Zyczkowski, K. Tensor rank and entanglement of pure quantum states. arXiv 2019, arXiv:1912.06854. [Google Scholar]
- de Burgh, M.; Bartlett, S.D. Quantum methods for clock synchronization: Beating the standard quantum limit without entanglement. Phys. Rev. 2005, A72, 042301. [Google Scholar] [CrossRef] [Green Version]
- Rehman, J.; Shin, H. Entanglement-Free Parameter Estimation of Generalized Pauli Channels. Quantum 2021, 5, 490. [Google Scholar] [CrossRef]
- Almeida, M.P.; Gu, M.; Fedrizzi, A.; Broome, M.A.; Ralph, T.C.; White, A.G. Entanglement-free certification of entangling gates. Phys. Rev. 2014, A89, 042323. [Google Scholar] [CrossRef] [Green Version]
- Higgins, B.L.; Berry, D.W.; Bartlett, S.D.; Wiseman, H.M.; Pryde, G.J. Entanglement-free Heisenberg-limited phase estimation. Nature 2007, 450, 393–396. [Google Scholar] [CrossRef] [Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).