Preprint
Article

About Unitary States and Commutative Gates in a Two-Qubit Quantum System

Altmetrics

Downloads

82

Views

52

Comments

0

Submitted:

17 November 2023

Posted:

21 November 2023

You are already at the latest version

Alerts
Abstract
This work is devoted to the construction and study of commutative gates for a two-qubit quantum system. Using four-dimensional algebra developed by the Kazakh mathematician Abenov M.M. all groups of commutative gates have been constructed, and among all states of a two-qubit quantum system, unitary states with which a specific gate is connected have been identified. An explicit type of gate is described that transfers a quantum system from one unitary state to another unitary state. The proposed approach opens up new possibilities for the design of quantum algorithms not only for two-qubit quantum systems, but also for $n$-qubit quantum systems.
Keywords: 
Subject: Computer Science and Mathematics  -   Applied Mathematics

1. Introduction

Quantum computation, in a more strict fundamental understanding, is the movement of a point in a 2n-dimensional complex space, where the initial and final positions of the point correspond to the input and output of the computation.
Therefore, the process of quantum computation is nothing more than a linear transformation of a 2 n - dimensional vector from a state ψ > to ϕ > .
Thus, the coordinates of vector ψ > are the initial conditions, and the coordinates of vector ϕ > are the result of the computation - the output.
An ideal quantum computation is then one that performs a direct linear transformation from ψ > to ϕ > in a single step - a singular transform, a single computation execution.
Ideal here means that there is no more efficient, in terms of computational power, computational expense of the quantum computer’s work.
To make ideal quantum computation technically possible, it is necessary to find a group of unitary matrices, the elements of which form a universal set of quantum gates for the direct transformation from ψ > to ϕ > . As is known, quantum computations use quantum bits or qubits instead of classical bits, which have two basis states 0 > и 1 > . All other states of a qubit are defined as a linear combination of basis states with complex coefficients, that is
ψ > = λ 1 0 > + λ 2 1 > ,
where λ 1 C , λ 2 C and λ 1 2 + λ 2 2 = 1 , C - being the space of complex numbers.
The basis states of a qubit 0 > and 1 > are also denoted using vectors ( 1 , 0 ) T and ( 0 , 1 ) T respectively, where the index T denotes the transposition sign.
A two-qubit quantum system consists of two qubits and has four basis states 00 > = ( 1 , 0 , 0 , 0 ) T , 01 > = ( 0 , 1 , 0 , 0 ) T , 10 > = ( 0 , 0 , 1 , 0 ) T and 11 > = ( 0 , 0 , 0 , 1 ) T . Then, an arbitrary state of a two-qubit quantum system can be written as [7,8]
ψ > = λ 1 00 > + λ 2 01 > + λ 3 10 > + λ 4 11 > ,
where λ i C , i = 1 , 2 , 3 , 4 , and λ 1 2 + λ 2 2 + λ 3 2 + λ 4 2 = 1 . A similar record for an arbitrary state of a two-qubit system looks like [7,8]
ψ > = λ 1 1 0 0 0 + λ 2 0 1 0 0 + λ 3 0 0 1 0 + λ 4 0 0 0 1 = λ 1 λ 2 λ 3 λ 4 ,
i.e., any quantum state of a two-qubit quantum system is uniquely determined by the complex amplitudes λ 1 , λ 2 , λ 3 , λ 4 .
Similarly, n-qubit quantum systems, consisting of n qubits, are defined. Such a system would have 2 n basis states and any of its states are determined as a linear combination of basis states with complex amplitudes. In this work, we only consider two-qubit quantum systems, although all results can in principle be generalized for an n-qubit quantum system. However, this would require the development of the basics of 2 n -dimensional mathematics with commutative multiplication. Here, we rely on four-dimensional mathematics, the foundations of which were laid by the great Kazakh mathematician Abenov M.M. [1].
Quantum computations consist in the sequential application of unitary U operators to the quantum state of the quantum system, which are called gates. Unitary operators or gates applied to an n-qubit quantum system are represented in the form of a matrix of size 2 n × 2 n . For example, unitary operators for a two-qubit system have the form of a 4 × 4 matrix U:
U = u 11 + v 11 i u 12 + v 12 i u 13 + v 13 i u 14 + v 14 i u 21 + v 21 i u 22 + v 22 i u 23 + v 23 i u 24 + v 24 i u 31 + v 31 i u 32 + v 32 i u 33 + v 33 i u 34 + v 34 i u 41 + v 41 i u 42 + v 42 i u 43 + v 43 i u 44 + v 44 i ,
u i j , v i j R , i , j = 1 , 2 , 3 , 4 .
Note that if a certain matrix (4) is a two-qubit gate, then the Hermitian conjugate matrix to it
U * = u 11 v 11 i u 21 v 21 i u 31 v 31 i u 41 v 41 i u 12 v 12 i u 22 v 22 i u 32 v 32 i u 42 v 42 i u 13 v 13 i u 23 v 23 i u 33 v 33 i u 43 v 43 i u 14 v 14 i u 24 v 24 i u 34 v 34 i u 44 v 44 i
is also a gate.
The main two-qubit gates, or binary operators, are SWAP, CNOT, CZ, represented by matrices [4,8]
1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 , 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 , 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 .
Note that two-qubit gates can be applied to any n-qubit quantum system ( n 2 ), with any two qubits from the n-qubit system selected to which the two-qubit gate is applied, and the identity operator, which is defined by the unit matrix of the required dimension, is applied to the other qubits.
In addition to the gates indicated in (6), one can construct many different two-qubit gates, but a general description of all possible two-qubit gates is absent. In the work [3], with the participation of one of the authors, an Abelian group of commutating two-qubit gates was constructed. However, the constructed group of gates is not complete, as none of the gates (6) belongs to the mentioned group. This work is a continuation of [3], and here we have constructed all other commutative groups of two-qubit gates, as well as defined the correspondence between quantum states and gates of two-qubit quantum systems, introduced the concept of a unitary state and shown the possibility of transitioning in one step from any unitary state to any basis state, and also from any unitary state to any other unitary state. The obtained results open up new possibilities for constructing quantum algorithms not only for two-qubit quantum systems.

2. Four-Dimensional Number Spaces with Commutative Multiplication

In the study [2], all spaces of four-dimensional numbers R 4 with commutative multiplication are examined. There are, in total, six such spaces, denoted as M 2 , M 3 , M 4 , M 5 , M 6 , M 7 . To each four-dimensional number Z = ( z 1 , z 2 , z 3 , z 4 ) R 4 from any of these spaces, a certain 4 × 4 matrix M, is associated, with its elements being the components of the four-dimensional number Z, and this mapping is bijective. Moreover, this bijection is a homomorphism with respect to the multiplication operation of four-dimensional numbers, meaning the group of matrices forms a commutative group with identity. The results obtained in work [2] can be transferred to the case of four-dimensional numbers Z C 4 . Retaining the same designations for the spaces M j ( j = 2 , 3 , . . . , 7 ) describe the necessary properties of these spaces for the case of complex-valued four-dimensional numbers. As we will see below, in each of the spaces M 2 , . . . , M 7 , there exist two groups of matrices corresponding to one operation of commutative multiplication of four-dimensional numbers [2]. The operations of addition X + Y and subtraction X Y of four-dimensional numbers X C 4 and Y C 4 are defined as component-wise addition and subtraction. The multiplication operation of four-dimensional numbers can be defined in various ways, among which we are only interested in commutative multiplication. All ways of defining commutative multiplication are given in [2], where for each method, the corres-ponding space of four-dimensional numbers M j ( j = 2 , 3 , . . . , 7 ) is defined. Without going into details, we will go through these spaces and generalize the results needed for our purposes to the case of complex-valued four-dimensional numbers.
Let’s consider the space M 2 , in which the multiplication of numbers X = ( x 1 , x 2 , x 3 , x 4 ) and Y = ( y 1 , y 2 , y 3 , y 4 ) is defined as follows:
z 1 = x 1 y 1 + x 2 y 2 x 3 y 3 x 4 y 4 z 2 = x 2 y 1 + x 1 y 2 x 4 y 3 x 3 y 4 z 3 = x 3 y 1 + x 4 y 2 + x 1 y 3 + x 2 y 4 z 4 = x 4 y 1 + x 3 y 2 + x 2 y 3 + x 1 y 4
where Z ( z 1 , z 2 , z 3 , z 4 ) = X · Y . If we set x j = a j + b j i , y j = c j + d j i , j = 1 , 2 , 3 , 4 , where i is the imaginary unit, then this multiplication can be rewritten as
a 1 + b 1 i a 2 + b 2 i a 3 + b 3 i a 4 + b 4 i · c 1 + d 1 i c 2 + d 2 i c 3 + d 3 i c 4 + d 4 i = e 1 + g 1 i e 2 + g 2 i e 3 + g 3 i e 4 + g 4 i
where
e 1 = a 1 c 1 + a 2 c 2 a 3 c 3 a 4 c 4 b 1 d 1 b 2 d 2 + b 3 d 3 + b 4 d 4 , g 1 = a 1 d 1 + a 2 d 2 a 3 d 3 a 4 d 4 + b 1 c 1 + b 2 c 2 b 3 c 3 b 4 c 4 , e 2 = a 1 c 2 + a 2 c 1 a 3 c 4 a 4 c 3 b 1 d 2 b 2 d 1 + b 3 d 4 + b 4 d 3 , g 2 = a 1 d 2 + a 2 d 1 a 3 d 4 a 4 d 3 + b 1 c 2 + b 2 c 1 b 3 c 4 b 4 c 3 , e 3 = a 3 c 1 + a 4 c 2 a 1 c 3 a 2 c 4 b 3 d 1 b 4 d 2 b 1 d 3 b 2 d 4 , g 3 = a 3 d 1 + a 4 d 2 + a 1 d 3 + a 2 d 4 + b 3 c 1 + b 4 c 2 + b 1 c 3 + b 2 c 4 , e 4 = a 4 c 1 + a 3 c 2 + a 2 c 3 + a 1 c 4 b 4 d 1 b 3 d 2 b 2 d 3 b 1 d 4 , g 4 = a 4 d 1 + a 3 d 2 + a 2 d 3 + a 1 d 4 + b 4 c 1 + b 3 c 2 + b 2 c 3 + b 1 c 4 .
One can readily verify that the multiplication of four-dimensional numbers defined in this way is commutative. To the four-dimensional number X = ( x 1 , x 2 , x 3 , x 4 ) C 4 we associate the matrix
M 20 ( X ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 .
The mapping F : X M 20 ( X ) is bijective and onto. Indeed, two different numbers X and Y correspond to different matrices, and for any matrix in the form of (8), a corresponding four-dimensional number from C 4 can be found.
Theorem 1. The set of all matrices in the form of (8) is closed with respect to the operations of matrix addition, subtraction, multiplication, and multiplication by scalar. For the mapping F : X M 20 ( X ) the relationships F ( X ± Y ) = F ( X ) ± F ( Y ) , F ( X Y ) = F ( X ) F ( Y ) hold for any X C 4 , Y C 4 .
The proof is conducted by direct verification.
Thus, there is a bijection between the space of four-dimensional numbers and the space of matrices of the form (8), which preserves arithmetic operations, meaning the existing bijection is a homomorphism. From Theorem 1, it also follows that the operation of matrix multiplication of the form (8) is commutative.
It is further noted that if we multiply the j-th row and j-th column of matrix (8) by -1, we obtain another matrix with the same properties as the matrix M 20 , that is, the statements of Theorem 1 remain valid. Moreover, if we multiply the j-th row and three columns of matrix M 2 0 , with indexes not equal to j, by -1, we also get a matrix corresponding to the multiplication of four-dimensional numbers (7) and possessing the properties of matrix M 2 0 . The matrix transposed to M 2 0 also possesses all the properties of matrix M 2 0 . To describe such operations, let us denote by M 20 ( j , k ) , where j and k are one, two, or three indices with values from 1 to 4, the matrix obtained by multiplying by -1 the rows with numbers from index j and columns with numbers from index k. For example, M 20 ( 24 , 134 ) is a matrix obtained from matrix M 2 0 by multiplying the second and fourth rows by -1, and also by multiplying the first, third, and fourth columns by -1. Let’s describe all possible operations that lead to matrices for which the statements of Theorem 1 are valid. It is easy to verify that such operations are operations of the following types: M 20 ( j , j ) , M 20 ( j , k l m ) , M 20 ( k l m , j ) , M 20 ( k l m , k l m ) , M 20 ( j k , j k ) , M 20 ( j k , l m ) , where j , k , l , m are pairwise distinct indices with values from 1 to 4. In addition, the operation of transposing a matrix also does not change its properties.
The number of different operations of the form M 20 ( j , j ) is four when j = 1 , 2 , 3 , 4 , respectively, we get four new matrices:
M 20 ( 1 , 1 ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 M 20 ( 2 , 2 ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 ,
M 20 ( 3 , 3 ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 M 20 ( 4 , 4 ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 .
But as we can easily notice,
M 20 ( 1 , 1 ) ( x 1 , x 2 , x 3 , x 4 ) = M 20 ( 2 , 2 ) ( x 1 , x 2 , x 3 , x 4 ) , M 20 ( 1 , 1 ) ( x 1 , x 2 , x 3 , x 4 ) = M 20 ( 3 , 3 ) ( x 1 , x 2 , x 3 , x 4 ) , M 20 ( 1 , 1 ) ( x 1 , x 2 , x 3 , x 4 ) = M 20 ( 4 , 4 ) ( x 1 , x 2 , x 3 , x 4 ) ,
that is, these matrices lie in one group. Similarly, it can be shown that the matrices from the groups M 20 ( j , k l m ) , M 20 ( k l m , j ) , M 20 ( k l m , k l m ) , totaling 12 (4 in each group), lie in the same group. In addition, we include in this group all transposed matrices of this group, as it is easy to check that they also lie in this group. And the matrices from the groups M 20 ( j k , j k ) , M 20 ( j k , l m ) , totaling 12 (6 in each group) and the transposed matrices to them, also lie in one group, but different from the first group. For example, the matrices M 20 ( 12 , 12 ) and M 20 ( 12 , 34 ) respectively have the form:
x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 , x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 ,
from which it follows that M 20 ( 12 , 12 ) ( x 1 , x 2 , x 3 , x 4 ) = M 20 ( 12 , 34 ) ( x 1 , x 2 , x 3 , x 4 ) , but from M 20 ( 12 , 12 ) it is impossible to obtain M 20 ( 1 , 1 ) or another matrix from the first group. Thus, there are two groups of matrices that are closed with respect to the operations of addition, multiplication, and these operations are commutative. Any matrix from the corresponding group can be taken as a representative of these groups. As a representative of the second group, we take the matrix M 20 , and as a representative of the first group, we take, for example, the matrix M 20 ( 1 , 1 ) , which we denote by M 21 :
M 21 ( X ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1
Thus, to each four-dimensional number X C 4 two matrices M 20 and M 21 can be associated, that is, to define two mappings, F 20 : X M 20 ( X ) and F 21 : X M 21 ( X ) , which are bijective and onto. The products of matrices from one class are closed with respect to the operations of addition and multiplication, and the multiplication operation corresponds to the multiplication of four-dimensional numbers (7).
Note. Other transformations M 20 ( j , k ) of the matrix M 20 can be considered and used to build unitary operators.
Now, let us consider the space M 3 , where the multiplication operation of four-dimensional numbers X = ( x 1 , x 2 , x 3 , x 4 ) and Y = ( y 1 , y 2 , y 3 , y 4 ) is defined as follows [2]:
z 1 = x 1 y 1 x 2 y 2 + x 3 y 3 x 4 y 4 z 2 = x 2 y 1 + x 1 y 2 + x 4 y 3 + x 3 y 4 z 3 = x 3 y 1 x 4 y 2 + x 1 y 3 x 2 y 4 z 4 = x 4 y 1 + x 3 y 2 + x 2 y 3 + x 1 y 4
where Z = ( z 1 , z 2 , z 3 , z 4 ) = X · Y . A detailed exposition of the algebra and analysis over the four-dimensional space of real numbers M 3 is presented in monograph [1]. To the four-dimensional number X = ( x 1 , x 2 , x 3 , x 4 ) C 4 we associate the matrix
M 30 ( X ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 .
The mapping F 30 : X M 30 ( X ) is bijective and onto. Indeed, two different numbers X and Y correspond to different matrices, and for any matrix of form (10), one can find the corresponding four-dimensional number from C 4 . For the matrix M 30 and the mapping F 30 , the statements of Theorem 1 hold true. Similarly to the previous case, by considering transformations of the form M 30 ( j , j ) , M 30 ( j , k l m ) , M 30 ( k l m , j ) , M 30 ( k l m , k l m ) , M 30 ( j k , j k ) , M 30 ( j k , l m ) , where j , k , l , m are pairwise distinct indices with values from 1 to 4, we find that there exist two groups of matrices corresponding to the commutative multipli-cation in the space M 3 and satisfying the conditions of Theorem 1. One group is represented by the matrix (10), and the other group by the following matrix M 31 ( X ) :
M 31 ( X ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 .
Similarly, for the space M 4 , with commutative multiplication [2]
z 1 = x 1 y 1 x 2 y 2 x 3 y 3 + x 4 y 4 z 2 = x 2 y 1 + x 1 y 2 + x 4 y 3 + x 3 y 4 z 3 = x 3 y 1 + x 4 y 2 + x 1 y 3 + x 2 y 4 z 4 = x 4 y 1 x 3 y 2 x 2 y 3 + x 1 y 4
we obtain two groups of matrices M 40 ( X ) and M 41 ( X ) :
M 40 ( X ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 ,
M 41 ( X ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 .
Proceeding with similar reasoning and corresponding calculations for spaces M 5 , M 6 , M 7 , , the multiplication operations of which are defined respectively as [2]
z 1 = x 1 y 1 x 2 y 2 x 3 y 3 + x 4 y 4 z 2 = x 2 y 1 + x 1 y 2 x 4 y 3 x 3 y 4 z 3 = x 3 y 1 x 4 y 2 + x 1 y 3 x 2 y 4 z 4 = x 4 y 1 + x 3 y 2 + x 2 y 3 + x 1 y 4 ,
z 1 = x 1 y 1 x 2 y 2 + x 3 y 3 x 4 y 4 z 2 = x 2 y 1 + x 1 y 2 x 4 y 3 x 3 y 4 z 3 = x 3 y 1 + x 4 y 2 + x 1 y 3 + x 2 y 4 z 4 = x 4 y 1 x 3 y 2 x 2 y 3 + x 1 y 4 ,
z 1 = x 1 y 1 + x 2 y 2 x 3 y 3 x 4 y 4 z 2 = x 2 y 1 + x 1 y 2 + x 4 y 3 + x 3 y 4 z 3 = x 3 y 1 x 4 y 2 + x 1 y 3 x 2 y 4 z 4 = x 4 y 1 x 3 y 2 x 2 y 3 + x 1 y 4 ,
we determine the corresponding groups of matrices satisfying the conditions of Theorem 1 for the indicated commutative multiplication operations:
M 50 ( X ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 ,
M 51 ( X ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 ,
for the space M 5 ,
M 60 ( X ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 ,
M 61 ( X ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 ,
for the space M 6 ,
M 70 ( X ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 ,
M 71 ( X ) = x 1 x 2 x 3 x 4 x 2 x 1 x 4 x 3 x 3 x 4 x 1 x 2 x 4 x 3 x 2 x 1 ,
for the space M 7 . Note that the foundations of the four-dimensional space of real numbers M5 can be found in works [5,6].
A careful examination of the obtained matrices reveals that
M 20 ( x 1 , x 2 , x 3 , x 4 ) = M 71 ( x 1 , x 2 , x 3 , x 4 ) , M 30 ( x 1 , x 2 , x 3 , x 4 ) = M 61 ( x 1 , x 2 , x 3 , x 4 ) , M 40 ( x 1 , x 2 , x 3 , x 4 ) = M 51 ( x 1 , x 2 , x 3 , x 4 ) , M 50 ( x 1 , x 2 , x 3 , x 4 ) = M 41 ( x 1 , x 2 , x 3 , x 4 ) , M 60 ( x 1 , x 2 , x 3 , x 4 ) = M 31 ( x 1 , x 2 , x 3 , x 4 ) , M 70 ( x 1 , x 2 , x 3 , x 4 ) = M 21 ( x 1 , x 2 , x 3 , x 4 ) .
This implies that there are in fact six independent groups of matrices corresponding to the six spaces of four-dimensional numbers M j , ( j = 2 , 3 , . . . , 7 ) . As such matrices, we shall take M 20 , M 30 , M 40 , M 50 , M 60 and M 70 , defined by equations (8), (10) - (14). Each of these matrices is bijective to the space of four-dimensional complex-valued numbers, closed with respect to the multiplication operation, and forms an abelian group with respect to the matrix multiplication operation. Moreover, as evident from the construction, no other abelian groups of matrices exist.

3. Commutative groups of two-qubit gates

In the previous section, we constructed six abelian groups of matrices with elements formed from the components of a four-dimensional number. Based on these matrices, it is possible to construct gates for two-qubit quantum systems; in other words, under certain additional conditions, the constructed matrices transform into unitary operators. Let us formulate the corresponding conditions.
Theorem 2. Let X = ( x 1 , x 2 , x 3 , x 4 ) C 4 . Let the components of the complex numbers x j = u j + v j i ( j = 1 , 2 , 3 , 4 ) satisfy the conditions:
ρ 0 j = 1 4 ( u j 2 + v j 2 ) = 1 , ρ 21 u 1 u 2 + u 3 u 4 + v 1 v 2 + v 3 v 4 = 0 , ρ 22 u 1 v 3 + u 2 v 4 u 3 v 1 u 4 v 2 = 0 ρ 23 u 1 v 4 + u 2 v 3 u 3 v 2 u 4 v 1 = 0 .
Then the matrix M 20 ( X ) is a two-qubit gate.
Proof. The system (15) is consistent and has an infinite number of solutions. Consider the Hermitian conjugate matrix M 20 * to the matrix M 20 :
M 20 * = u 1 v 1 i u 2 v 2 i u 3 v 3 i u 4 v 4 i u 2 v 2 i u 1 v 1 i u 4 v 4 i u 3 v 3 i u 3 + v 3 i u 4 + v 4 i u 1 v 1 i u 2 v 2 i u 4 + v 4 i u 3 + v 3 i u 2 v 2 i u 1 v 1 i ,
and multiply it by the matrix M 20 :
M 20 · M 20 * = ρ 0 2 ρ 21 2 ρ 22 i 2 ρ 23 i 2 ρ 21 ρ 0 2 ρ 23 i 2 ρ 22 i 2 ρ 22 i 2 ρ 23 i ρ 0 2 ρ 21 2 ρ 23 i 2 ρ 22 i 2 ρ 21 ρ 0 .
Using relations (15) we obtain that M 20 · M 20 * = E , where E is the identity matrix of size 4 × 4 , hence M 20 is a unitary matrix.
Thus, when conditions (15) are met, the group of matrices M 20 ( X ) forms a commutative group of gates for a two-qubit quantum system.
Corollary 1. The group of commutative gates with real elements is of the form
R M 20 = u 1 u 2 u 3 u 4 u 2 u 1 u 4 u 3 u 3 u 4 u 1 u 2 u 4 u 3 u 2 u 1 ,
where
j = 1 4 u j 2 = 1 , u 1 u 2 + u 3 u 4 = 0 .
Corollary 2. The group of commutative gates with purely imaginary elements is of the form
I M 20 = v 1 i v 2 i v 3 i v 4 i v 2 i v 1 i v 4 i v 3 i v 3 i v 4 i v 1 i v 2 i v 4 i v 3 i v 2 i v 1 i ,
where
j = 1 4 v j 2 = 1 , v 1 v 2 + v 3 v 4 = 0 .
Theorem 3. Let X = ( x 1 , x 2 , x 3 , x 4 ) C 4 . Let the components of the complex numbers x j = u j + v j i ( j = 1 , 2 , 3 , 4 ) satisfy the conditions:
ρ 0 j = 1 4 ( u j 2 + v j 2 ) = 1 , ρ 31 u 1 u 3 + u 2 u 4 + v 1 v 3 + v 2 v 4 = 0 , ρ 32 u 1 v 2 u 2 v 1 + u 3 v 4 u 4 v 3 = 0 ρ 33 u 1 v 4 u 2 v 3 + u 3 v 2 u 4 v 1 = 0 .
Then the matrix M 30 ( X ) is a two-qubit gate.
The proof is analogous to the proof of Theorem 2.
This theorem coincides with Theorem 1 from work [3]. Analogous to Corollary 1 and Corollary 2 to Theorem 2, we can write the forms of gates with real and imaginary elements for the matrix M 30 .
Similarly, we consider matrices M 40 , M 50 , M 60 and M 70 and list the corres-ponding conditions for their unitarity.
Theorem 4. Let X = ( x 1 , x 2 , x 3 , x 4 ) C 4 . Let the components of the complex numbers x j = u j + v j i ( j = 1 , 2 , 3 , 4 ) satisfy the conditions:
ρ 0 j = 1 4 ( u j 2 + v j 2 ) = 1 , ρ 41 u 1 u 4 + u 2 u 3 + v 1 v 4 + v 2 v 3 = 0 , ρ 42 u 1 v 2 u 2 v 1 u 3 v 4 + u 4 v 3 = 0 ρ 43 u 1 v 3 u 2 v 4 u 3 v 1 + u 4 v 2 = 0 .
Then the matrix M 40 ( X ) is a two-qubit gate.
Theorem 5. Let X = ( x 1 , x 2 , x 3 , x 4 ) C 4 . Let the components of the complex numbers x j = u j + v j i ( j = 1 , 2 , 3 , 4 ) satisfy the conditions:
ρ 0 j = 1 4 ( u j 2 + v j 2 ) = 1 , ρ 51 u 1 u 4 u 2 u 3 + v 1 v 4 v 2 v 3 = 0 , ρ 52 u 1 v 2 u 2 v 1 + u 3 v 4 u 4 v 3 = 0 ρ 53 u 1 v 3 + u 2 v 4 u 3 v 1 u 4 v 2 = 0 .
Then the matrix M 50 ( X ) is a two-qubit gate.
Theorem 6. Let X = ( x 1 , x 2 , x 3 , x 4 ) C 4 . Let the components of the complex numbers x j = u j + v j i ( j = 1 , 2 , 3 , 4 ) satisfy the conditions:
ρ 0 j = 1 4 ( u j 2 + v j 2 ) = 1 , ρ 61 u 1 u 3 u 2 u 4 + v 1 v 3 v 2 v 4 = 0 , ρ 62 u 1 v 2 u 2 v 1 u 3 v 4 + u 4 v 3 = 0 ρ 63 u 1 v 4 + u 2 v 3 u 3 v 2 u 4 v 1 = 0 .
Then the matrix M 60 ( X ) is a two-qubit gate.
Theorem 7. Let X = ( x 1 , x 2 , x 3 , x 4 ) C 4 . Let the components of the complex numbers x j = u j + v j i ( j = 1 , 2 , 3 , 4 ) satisfy the conditions:
ρ 0 j = 1 4 ( u j 2 + v j 2 ) = 1 , ρ 71 u 1 u 2 u 3 u 4 + v 1 v 2 v 3 v 4 = 0 , ρ 72 u 1 v 3 u 2 v 4 u 3 v 1 + u 4 v 2 = 0 ρ 73 u 1 v 4 u 2 v 3 + u 3 v 2 u 4 v 1 = 0 .
Then the matrix M 70 ( X ) is a two-qubit gate.
Thus, we have defined 6 groups of two-qubit gates that are closed with respect to the operation of matrix multiplication and within each group, the gates commute with each other. It is clear that each group contains a continuum of gates. It is easy to see that gates from different groups are not commutative, although their product is also a gate. That is, if we apply gates from one of these groups to the state of a (two-qubit) quantum system in sequence, then we ultimately obtain a gate from the same group, in other words, any number of sequentially applied gates from one group M j , ( j = 20 , 30 , 40 , 50 , 60 , 70 ) can always be replaced by a single gate from the same group, and the order of application of these gates is not important. Since any quantum algorithm is essentially the product of a sequence of gates, it can be reduced to a sequence of applications of two-qubit gates, each taken from the different specified 6 groups (provided that all the gates of the algorithm belong to the specified groups).
Observation. We have constructed all commutative groups of two-qubit gates. If we consider other transformations of matrices M n , with indices ( n = 20 , . . . , 70 ) , in the form M n ( j , k ) , where j and k are one, two, or three indices with values from 1 to 4 that do not satisfy the assertions of Theorem 1, then we can also obtain groups of unitary operators that fulfill the corresponding conditions (15), (17) - (21). These gates are not commutative and are not closed with respect to multiplication. Nonetheless, investigating their properties and relationships with the commutative groups that have been constructed is a relevant task. These are the directions for future research.
In the case of an n qubit quantum system, a quantum algorithm typically consists of a sequence of single-qubit (unary), two-qubit (binary), three-qubit (ternary), and other multi-qubit gates. In this context, sequentially applied two-qubit gates can be simplified or reduced due to the commutativity and closure of these operators within the described groups.

4. Unitary States of Quantum Systems

An arbitrary state of a two-qubit quantum system is specified as in expressions (2) or (3). The ultimate purpose of any quantum algorithm is to transform the state of the quantum system into a state suitable for solving the given problem. Therefore, the task of finding a gate that transitions the quantum system from one specified state to another is of significant importance. Let us consider this task for a two-qubit quantum system, which can be generalized to an n-qubit system.
Definition. The state of a two-qubit system Λ = ( λ 1 , λ 2 , λ 3 , λ 4 ) T is called a unitary state if the components of complex numbers λ j = u j + v j i ( j = 1 , 2 , 3 , 4 ) satisfy at least one of the conditions (15), (17) - (21).
Note that all basis states of quantum systems are unitary since they fulfill all the listed conditions. Furthermore, only those states, called quasi-basis states, satisfy all conditions (15), (17) - (21) simultaneously.
Definition. Quantum states of the following forms Λ = ( λ , 0 , 0 , 0 ) T , Λ = ( 0 , λ , 0 , 0 ) T , Λ = ( 0 , 0 , λ , 0 ) T , Λ = ( 0 , 0 , 0 , λ ) T , where λ C , λ = 1 are called quasi-basis states.
Evidently, all basis states are quasi-basis states.
Theorem 8. The state of a two-qubit system Λ = ( λ 1 , λ 2 , λ 3 , λ 4 ) T satisfies all conditions (15), (17) - (21) simultaneously if and only if Λ is a quasi-basis state.
The proof is straightforwardly achieved by concurrently solving system (15), (17) - (21).
From the previously proven Theorems 1 - 7, it follows that each unitary state of a two-qubit system corresponds to at least one unitary matrix. Moreover, if the state is a quasi-basis state, then it corresponds to no fewer than six gates. Unitary states play a crucial role in the construction of quantum algorithms since for them we can explicitly specify a gate that transitions the quantum system from one specified state to another.
Remark. When we say that each unitary state corresponds to at least one unitary matrix, not exactly one matrix, we imply that in addition to commutative unitary matrices, there exist non-commutative unitary matrices whose elements satisfy the same conditions (15), (17) - (21). Since we are only considering commutative gates here, the matrices corresponding to unitary states are only matrices M 20 , . . . , M 70 and the corresponding unitary states are denoted by S 2 ( X ) S 7 ( X ) . That is, S 2 ( X ) - unitary states satisfying condition (15), S 3 ( X ) - unitary states satisfying condition (17), and so on, U 7 ( X ) - unitary states satisfying condition (21),
Theorem 9. Let Λ = ( λ 1 , λ 2 , λ 3 , λ 4 ) T — be a unitary state of the two-qubit quantum system from S j , where j = 2 , . . . 7 . Then, for any quasi-basis state B, among the unitary matrices M 10 j ( Λ ) , there exists a matrix G, such that G Λ = B .
Proof. Let us prove the theorem for j = 2 as an example. The matrix M 20 , corresponding to the unitary state Λ is of the form (8)
M 20 ( Λ ) = u 1 + v 1 i u 2 + v 2 i u 3 v 3 i u 4 v 4 i u 2 + v 2 i u 1 + v 1 i u 4 v 4 i u 3 v 3 i u 3 + v 3 i u 4 + v 4 i u 1 + v 1 i u 2 + v 2 i u 4 + v 4 i u 3 + v 3 i u 2 + v 2 i u 1 + v 1 i ,
where u j + v j i = λ j ( j = 1 , 2 , 3 , 4 ) satisfy conditions (15). Consequently,
M 20 1 ( Λ ) = u 1 v 1 i u 2 v 2 i u 3 v 3 i u 4 v 4 i u 2 v 2 i u 1 v 1 i u 4 v 4 i u 3 v 3 i u 3 + v 3 i u 4 + v 4 i u 1 v 1 i u 2 v 2 i u 4 + v 4 i u 3 + v 3 i u 2 v 2 i u 1 v 1 i .
Then
M 20 1 ( Λ ) Λ = u 1 2 + u 2 2 + u 3 2 + u 4 2 + v 1 2 + v 2 2 + v 3 2 + v 4 2 2 ( u 1 u 2 + v 1 v 2 + u 3 u 4 + v 3 v 4 ) 2 ( u 1 v 3 u 3 v 1 + u 2 v 4 u 4 v 2 ) i 2 ( u 1 v 4 u 4 v 1 + u 2 v 3 u 3 v 2 ) i = 1 0 0 0 ,
by virtue of conditions (15). Similarly, it can be shown that M 20 1 ( B ) B = ( 1 , 0 , 0 , 0 ) T , whence M 20 ( B ) ( 1 , 0 , 0 , 0 ) T = B . Now, by applying gate M 20 1 ( Λ ) to state Λ first, and then gate M 20 ( B ) we obtain M 20 ( B ) M 20 1 ( Λ ) Λ = B . That is, the gate G = M 20 ( B ) M 20 1 ( Λ ) transitions the state Λ into the quasi-basis state B. The proof for other values of j is conducted analogously.
The theorem is proven.
Remark. There are several gates G, the existence of which is asserted in Theorem 9. We could have transitioned to the quasi-basis state B not through the basis state ( 1 , 0 , 0 , 0 ) T but, for example, through the basis state ( 0 , 1 , 0 , 0 ) T , and so forth.
Corollary. Let Λ 1 and Λ 2 be two unitary states from S j . Then there exists a gate from the Abelian group M 10 j , that transitions the state of the quantum system from Λ 1 to Λ 2 .
The proof is conducted absolutely analogously to the proof of Theorem 9.
Thus, we have explicitly described a gate that translates any unitary state into any quasi-basis state, including any basis state within a specific group of unitary states S j ( j = 2 , . . . , 7 and vice versa. From Theorems 8 and 9, the following important result easily follows.
Theorem 10. Let Λ 1 and Λ 2 be two unitary states of a two-qubit quantum system. Then there exists a gate G, which translates the quantum system from state Λ 1 to state Λ 2 in one step.
Proof. The proof follows from Theorems 9 and 8. According to Theorem 9, if the state Λ 1 lies in the group S j for some j, then there is a unitary matrix G 1 from the group M 10 j , which translates the system into some quasi-basis state Λ . According to Theorem 8, the state Λ belongs to all groups S j for all j = 2 , . . . , 7 . Now, by Theorem 9, we can translate the system from state Λ into state Λ 2 using some matrix G 2 from the group M 10 k , where S k is the group in which the state Λ 2 is located. Then the gate G 2 G 1 translates the system from state Λ 1 into state Λ 2 in one step. Moreover, we can explicitly write the matrices G 1 and G 2 .
The theorem is proven.
In this way, we have divided all possible states of a two-qubit quantum system into two classes: unitary and non-unitary. Unitary states include all quasi-basis states (and thus all basis states) and play an important role in the construction of quantum algorithms. Theorem 10 allows transitioning from any unitary state to any other unitary state in one step, and the gate of this transition can be explicitly described, and there are infinitely many such gates (since there are infinitely many quasi-basis states). If the solution to a certain quantum problem is represented as a non-unitary state, there is always a unitary state that lies as close as desired to this non-unitary state [1]. This gives us the possibility of searching for an approximate solution to the problem of finding a gate that translates the quantum system from any state to any other state.

5. Conclusion

This work has considered an important class of quantum states called unitary states and has solved the problem of finding a gate that translates a two-qubit quantum system from one unitary state to any other unitary state. If the initial and final states are not unitary, then the proposed approach can generally be used to approximate the solution to the problem of finding a gate that translates the system from one state to any other arbitrary state. However, that is the subject of future research.
The paper focuses on commutative two-qubit gates and leaves without consideration non-commutative two-qubit gates, which have the form of matrices similar to matrices M j , where j = 20 , 30 , . . . , 70 . Investigating the properties of such gates and their interrelationships with commutative gates is of great practical interest for the development of quantum algorithms. Constructing all non-commutative groups of two-qubit gates makes the picture more complete.
In this context, the question of the completeness of the constructed groups (commutative and others) of two-qubit gates is interesting, namely, whether it is possible to describe the action of any unitary operator with any degree of accuracy using the constructed gates.
The results obtained can be extended to the case of n-qubit systems, but for this, it is necessary to develop an algebra of 2n-dimensional mathematics, similar to four-dimensional mathematics. However, for the practical application of such developments, it is important to have ready-made libraries, for example, in Python, that allow performing computations of multidimensional algebra.
All these issues, in our opinion, can be resolved using the apparatus of multidimensional mathematics. In general, the apparatus of multidimensional commutative algebra not only opens new possibilities for the existing mathe-matical model of quantum computing but may also give a new impetus to the development of a differential mathematical model of quantum computing, because in multidimensional mathematics with commutative multiplication, it is possible to effectively develop integral and differential calculus, as has been done for the four-dimensional case [1,2,6]. Four-dimensional mathematical analysis has allowed for new approaches to solving complex three-dimensional non-stationary problems for systems of partial differential equations [9,10].

References

  1. Абенoв М.М. Четырехмерная математика: метoды и прилoжения. //Алматы, Издательствo КазНУ им. аль-Фараби, 2019. 175 с.
  2. Абенoв М.М., Габбасoв М.Б. Анизoтрoпные четырехмерные прoстранства. //Астана, Препринт, 2020. 65 с.
  3. Abenov M.M.. Durmagambetov A.A., Oralbekov B., Daulet B. On the group of universal gates for a two-qubit quantum system. //doi: 10.20944/preprints202304.0206.v1 2023. 5 c. [CrossRef]
  4. Китаев А., Шень А., Вялый М. Классические и квантoвые вычисления. //МЦНМО, М., 1999 г. 193 с.
  5. Рахимoва А.Т, Габбасoв М.Б., Шапен К.М. Об oднoм прoстранстве четырехмерных чисел. //Вестник КазНУ им. аль-Фараби, серия математика, механика, инфoрматика. Тoм 108 № 4, 2020. Стр. 81-98.
  6. Rakhimova A.T., Gabbassov M.B., Shapen K.M. Functions in one space of four-dimentional numbers. //Вестник КазНУ им. аль-Фараби, серия математика, механика, инфoрматика. Тoм 110 № 2, 2021. Стр. 139-154.
  7. Сысoев С.С. Введение в квантoвые вычисления. Квантoвые алгoритмы. Учебнoе пoсoбие. //Изд-вo С-Петербургскoгo университета. 2019. 144 с.
  8. Хидари Джек Д. Квантoвые вычисления: прикладнoй пoдхoд. //М., Изд-вo ДМК Пресс. 2021. 370 с.
  9. Rakhymova A.T., Gabbassov M.B., Ahmedov A.A. Analytical Solution of the Cauchy Problem for a Nonstationary Three-dimensional Model of the Filtration Theory. // Journal of advanced Research in Fluid Mechanics and Thermal Sciences. Volume 87, Issue 1(2021) 118-133.
  10. Abenov M.M., Gabbassov M.B., Ahmedov A.A. The Flow of An homogeneous Fluid Inside a Sphere. // Journal of advanced Research in Fluid Mechanics and Thermal Sciences. Volume 90, Issue 2(2022) 55-63. [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated