# Various Constructions of Qudit SWAP Gate

Authors: S. Balakrishnan
Journal: Physics Research International
 (2014)

---

## Abstract

It is known that SWAP operation for quantum systems of arbitrary dimension can be implemented using various qudit gates. In this paper, equivalence of some important qudit operations is demonstrated. Equivalence of the qudit operations is exploited to minimize the circuit complexity in the previously proposed qudit SWAP gate constructions. Further, constructions of qudit SWAP operation with minimum number of qudit gates are also proposed. Importantly, these circuit constructions of SWAP retain its properties like symmetry and simplicity.


---

## Body

## 1. Introduction

The fundamental unit of quantum information processing is qubit which can be realized by two-level quantum mechanical systems. The two-dimensional Hilbert space representing a single qubit can be extended to higher dimensions of2
n with n being the number of qubits. Nevertheless, the dimension of the Hilbert space is not necessarily a power of two and hence one may be interested in studying Hilbert space of arbitrary dimension d. Quantum systems of d level are known as qudits which can be used for quantum information processing.Two-qubit operations (also known as two-qubit gates) are fundamental in the realization of universal quantum circuits [1]. Some well-known two-qubit gates are Controlled NOT, shortly CNOT, and SWAP. While the former gate performs the NOT operation on the target qubit depending upon the control qubit, the latter gate interchanges the control-qubit input state and the target-qubit input state. It is important to mention that CNOT gate along with a few single qubit gates are capable of generating controlled unitary gates [2, 3]. Notably, a sequence of three CNOT gates can implement SWAP operation. One of the key issues in quantum computing is the CNOT complexity in the gate constructions. Over the years, efforts have been made to reduce the gate count in the circuit constructions [4, 5].Extension of two-qubit operation to qudit operation is not always straightforward. In particular, retaining the features of two-qubit operation in the generalization to qudit operation is not easy. One such instance is the implementation of  SWAP operation in the qudit setting. A few generalizations of  CNOT operation to the qudit level are proposed with the aim to implement qudit SWAP operation. However, the number of gates utilized in the previously proposed circuit constructions of  SWAP gate is not less than four [6–11]. It is shown that three copies of controlled qudit gates are sufficient to implement qudit SWAP [9]. More recently, optimal construction of qudit SWAP gate using generalized CNOT is shown by Wilmott and Wild [12].SWAP operation has been employed in circuit designs of many quantum operations (e.g., [13]). Therefore, it is necessary to implement the SWAP operation in an optimal way in terms of gate count and operating time. Hence circuit constructions of SWAP gate using other quantum gates are proposed to achieve the task of optimality. It is interesting to note that SWAP gate, which does not produce any entanglement, is constructed with gates capable of producing entanglement upon acting on suitable input states.First of all, the existence of equivalence between some of the qudit gates is shown. Then the equivalence of gates is exploited to minimize the number of gates used in the previously proposed qudit SWAP constructions. It is shown that the number of single qudit gates in the construction of qudit SWAP can be reduced. Such constructions would be useful in the case of highd-level system, for which a single-qudit gate is not easy to realize in experiments. Further, various new constructions of qudit SWAP operation with lesser number of gates are also proposed. It is important to mention that the new circuits for SWAP gate retain its symmetric property and simplicity in terms of gate count.


## 2. Some Known Qudit Operations

Before introducing some known qudit gates, it is necessary to define important two-qubit gates, namely, CNOT and SWAP. One of the qubits of CNOT gate is known as control and the other one is called target. Whenever the control qubit is in|
1
〉 state, the target qubit changes its value from |
0
〉 to |
1
〉 or from |
1
〉 to |
0
〉. The CNOT operation is given by
(1)
CNOT
|
x
〉

|
y
〉
=
|
x
〉

|
x
⊕
y
〉

,
where the symbol ⊕ represents the addition modulo two. The circuit symbol for CNOT is shown in Figure 1(a) where the dot represents the control and the symbol ⊕ represents the target. The SWAP gate interchanges the input states, say, |
ϕ
〉 and |
ψ
〉. The action of SWAP is given by
(2)
SWAP
|
ϕ
〉

|
ψ
〉
=
|
ψ
〉

|
ϕ
〉

.
The circuit symbol for two-qubit SWAP gate is shown in Figure 1(b). Note that the input states can also be d dimensional and hence we have qudit SWAP operation.Two-qubit gates. (a) CNOT; (b) SWAP.
(a)
(b)Now we introduce some qudit gates which are the different versions of qudit CNOT operation. Among the various versions,C
X
d is widely used and the operations of  C
X
d are given by
(3)
C
X
d
|
x
〉

|
y
〉
=
|
x
〉

|
x
+
y
〉
with modulo d addition. Note that throughout the paper we consider addition and subtraction of modulo d. The inverse of the above operation is
(4)
C
X
d
†
|
x
〉

|
y
〉
=
|
x
〉

|
y
-
x
〉
with modulo d subtraction. It is worth noting that C
X
d
≠
C
X
d
†, implying that the gates are not Hermitian. This is the main issue in the qudit generalization of CNOT. With the aim of having Hermitian qudit CNOT operation,  G
X
O
R is introduced. The action of G
X
O
R is as follows:
(5)
G
X
O
R
|
x
〉

|
y
〉
=
|
x
〉

|
x
-
y
〉

.
Recently, C
X
~ gate is introduced with the aim of proposing a simpler qudit SWAP gate [11]. The action of C
X
~ gate is given as follows:
(6)
C
X
~
|
x
〉

|
y
〉
=
|
x
〉

|
-
x
-
y
〉

.
Apart from these gates, we have
(7)
X
d
|
x
〉
=
|
d
-
x
〉
=
|
-
x
〉

.
This gate provides modulo d complement of the input state.


## 3. Equivalence of Various Qudit Gates

Equivalence of the various qudit gates is identified and mentioned in this section. The equivalence of the operation can be checked by the action of the gates on the input states|
ϕ
〉 and |
ψ
〉 of arbitrary dimension d:
(8)
G
X
O
R
1,2
≡
X
d
2
C
X
d
1,2
†
,
(9)
G
X
O
R
1,2
≡
C
X
d
1,2
X
d
2
,
(10)
G
X
O
R
2,1
≡
X
d
1
C
X
d
2,1
†
,
(11)
G
X
O
R
2,1
≡
C
X
d
2,1
X
d
1
,
(12)
C
X
~
1,2
≡
X
d
2
C
X
d
1,2
,
(13)
C
X
~
1,2
≡
C
X
d
1,2
†
X
d
2
,
(14)
C
X
~
2,1
≡
X
d
1
C
X
d
2,1
,
(15)
C
X
~
2,1
≡
C
X
d
2,1
†
X
d
1
.
Using the equivalence given by (8) and (13), it can be shown that
(16)
G
X
O
R
1,2
≡
X
d
2
C
X
~
1,2
X
d
2
.
In the similar fashion, it can be shown using the equivalence given by (11) and (14) that
(17)
G
X
O
R
2,1
≡
X
d
1
C
X
~
2,1
X
d
1
.


## 4. Qudit SWAP Operation

It is known that the concatenation of three CNOT gates, can implement two-qubit SWAP operation. The  CNOT swapping circuit is shown in Figure2. Note that the control and target qubits are interchanged in the second gate.Figure 2
Implementation of qubit SWAP using CNOT.Before analyzing the qudit  SWAP circuits, consider a special case. That is, we have SWAP circuits if one of  the initial states is known. The circuit in Figure3 can swap the state |
ϕ
〉
|
0
〉 into |
0
〉
|
ϕ
〉 [6].Figure 3
Partial qudit SWAP circuit for one known input state. Note that a general dimensiond is assumed and for simplicity here we have written C
X and C
X
† as well in the subsequent figures.Other possibilities of swapping the state|
ϕ
〉
|
0
〉 using G
X
O
R, C
X
d, and C
X
d
† gates are shown in Figure 4. Note that all the circuits shown in Figure 4 consist of only two basic qudit gates.Figure 4
Partial qudit SWAP circuit for one known input state usingGXOR, C
X
d, and C
X
d
†.The equivalence of qudit gates identified in the last section can be exploited to simplify the existing circuits for the qudit SWAP gate.The qudit SWAP gate circuit shown in Figure5 is proposed in [7, 10]. Using the equivalence given by (9) and (11), we can simplify the circuit as shown in Figure 6. Note that six gates are used in the previously proposed circuit (see Figure 5), whereas only four gates were employed in the new circuit (Figure 6). Similarly, qudit SWAP can be realized with C
X
d,C
X
d
†, and X
d gates using the circuit shown in Figure 7. This circuit can be simplified by noting down the equivalence given by (10) and the simplified circuit is shown in Figure 8.Figure 5
Qudit SWAP circuit usingC
X
d and X
d gates.Figure 6
Simplified version of the circuit in Figure5.Figure 7
Qudit SWAP circuit usingC
X
d, C
X
d
†, and X
d gates.Figure 8
Simplified version of the circuit in Figure7.The qudit SWAP can be implemented with a circuit consisting of threeG
X
O
R gates and two X
d gates [14, 15] and the circuit is shown in Figure 9. Observing the equivalence given by (9) in the circuit (see Figure 9), it is possible to simplify the circuit as shown in Figure 10.Figure 9
Qudit SWAP circuit withG
X
O
R
d and X
d gates.Figure 10
Simplified version of the circuit in Figure9.Apart from simplifying the previously proposed circuits, the equivalence between the qudit gates can be employed to introduce more qudit SWAP circuits. The qudit SWAP can be constructed with three basic gatesG
X
O
R, C
X
d, and C
X
d
†. The equivalence of SWAP operation is given by (18a)-(18b) and corresponding circuit is shown in Figure 11. As the circuit can implement SWAP for arbitrary input states, the inverted circuit can also implement the same operation. By cyclic rearrangement of G
X
O
R, C
X
d, and C
X
d
† gates, more circuit constructions are possible. Such circuits are shown in Figures 12 and 13 and corresponding operation equivalence is given by (19a)-(19b) and (20a)-(20b), respectively. Note that circuit and its inverted version are given in Figures 11 to 13. Consider the following:(18a)
G
X
O
R
1,2
C
X
d
2,1
C
X
d
1,2
†
≡
SWAP
,
(18b)
G
X
O
R
2,1
C
X
d
1,2
C
X
d
2,1
†
≡
SWAP
,Figure 11
Implementation of qudit SWAP usingGXOR, C
X
d, and C
X
d
† gates.Figure 12
Implementation of qudit SWAP usingGXOR, C
X
d, and C
X
d
† gates.Figure 13
Implementation of qudit SWAP usingGXOR, C
X
d, and C
X
d
† gates.(19a)
C
X
d
2,1
†
G
X
O
R
1,2
C
X
d
2,1
≡
SWAP
,
(19b)
C
X
d
1,2
†
G
X
O
R
2,1
C
X
d
1,2
≡
SWAP
,(20a)
C
X
d
1,2
C
X
d
2,1
†
G
X
O
R
1,2
≡
SWAP
,
(20b)
C
X
d
2,1
C
X
d
1,2
†
G
X
O
R
2,1
≡
SWAP
.Therefore the quditG
X
O
R gate can be combined with C
X
d and C
X
d
† in a cyclic fashion to produce qudit SWAP operation. It is known from previous results [7, 10, 14, 15] that qudit SWAP operation is constructed with not less than four gates. In this work, the possibility of constructing qudit SWAP operation with three qudit gates is indicated. However, three copies of C
X
~ gate are shown to be sufficient to achieve qudit SWAP operation [11]. Note that C
X
~ gate can be decomposed into two Quantum Fourier Transforms and a phase gate, which can be realized for multilevel atoms [11, 16].


## 5. Conclusion

In this work, the existence of equivalence between various qudit gates is illustrated and these gates are useful in the construction of qudit SWAP circuit. The identification of equivalence of the qudit operations is useful to minimize the circuit complexity in the previously proposed qudit SWAP gate constructions. In particular, the number of single qudit gates is minimized in the qudit SWAP gate construction. These constructions are useful whenever the single qudit gates are difficult to implement in the experiment. Moreover, many new qudit SWAP circuits comprising of lesser number of gates are proposed. Notably, the proposed circuits have the property of symmetry thereby the inverted circuits also implement qudit SWAP operation. Hence, we argue that not only the three copies of controlled qudit gate (C
X
~
d) can implement SWAP but also combinations of three different versions of controlled qudit gates (
G
X
O
R, C
X
d, and C
X
d
†
) can do the same. In short, we have presented various qudit circuits which can be employed in the construction of complex qudit circuits.



---

*Source: 479320-2014-08-05.xml*