Generation of Quantum Vector States Using the Exchange Interaction


In this paper, I study the invariant subspaces of quantum states under SWAPα gates arising from the exchange interaction and their use in quantum computation. I investigate the generation and characterization of invariant-subspace vector-states that arise from such gates. I also state a condition for the locus of states that are accessible using the SWAPα gates, given an initial input state.

Share and Cite:

Majumdar, M. (2019) Generation of Quantum Vector States Using the Exchange Interaction. Journal of Applied Mathematics and Physics, 7, 3116-3131. doi: 10.4236/jamp.2019.712219.

1. Introduction

The non-local physical phenomena related to quantum entanglement [1] [2] [3] have played a pivotal role in the development of quantum mechanics during the last century. Entanglement in many-particle states has been extensively studied [4] [5] [6], and such states are known to have symmetries that help in determining their entanglement properties [7] [8]. This is useful in determining the usability of these quantum states as resource-states for application in quantum information processing tasks [9] - [14]. Prior to using these resource-states, the generation of these quantum states is important, and this is an arduous task that requires a high degree of control. Quantum state engineering has been a way to generate arbitrary quantum states experimentally [15] - [19]. The existence of entanglement equivalence classes [20] of quantum states, particularly symmetric states, simplifies the experimental generation of these states. By producing a single state of an equivalence class, the entire subspace of states in that class can be accessed using a reduced set of operations. As a result of this, the characterization of symmetries in quantum states goes conjointly with the study of resource-states for quantum information applications, for example, quantum operation sharing [21] and super-dense coding [22] [23].

A form of symmetry that has been of significant interest to the world of quantum information is that of symmetry under permutations [24] [25] [26] [27] [28]. An early example of a success of the systematic mathematical study of permutation-symmetric states was the discovery of noiseless subspaces [25], in which quantum states can evolve without the introduction of bit-flip errors. This follows from the inherent parity constraints on permutation symmetric states. Permutation symmetric states (e.g. Dicke states) can occur as ground states in certain physical systems, some of which have been recently implemented experimentally [29] [30] [31]. A (partial) permutation on two qubits can be carried out by a (partial) SWAP gate [32]. Moreover, the SWAPα gate, together with single-qubit operations, is found to produce a universal set of quantum gates (enabling any quantum computation) [33]. These two-qubit gates can be realised in several physical systems. In electronic systems, the exchange interaction provides a natural framework for the implementation of the SWAPα gate [34] [35], but equivalent implementations also exist for atomic systems [36] [37], nitrogen vacancies [38] and photonic systems [39] [40] [41] [42].

Burkard et al. [43] showed how the SWAP gate can be used to create a controlled phase-flip gate (CPHASE), which in turn can be used to create a XOR gate. Barenco et al. [44] showed that any unitary two-qubit gate can be simulated by four one-bit gates and two XOR gates, thereby effectively leading to universal quantum computation using only the SWAP and single qubit rotation gates}. Since local single-qubit operations are difficult to implement in hardware, Divincenzo et al. subsequently looked at how universal quantum computation can be achieved by using only SWAPα gates if one encodes pseudo-spin qubits using three physical qubits [33]. This naturally leads to the question of whether universal quantum computation could be implemented purely using SWAPα with a specific value of α. It was shown by Tanamoto et al. [45] that upon

preparing the initial state as | ± = 1 2 ( | 0 + | 1 ) ( | 0 | 1 ) and applying the SWAP one can obtain Raussendorf’s cluster state [46] but only after two single-qubit rotations.

In this paper, I am interested in the general question of what kinds of states are accessible from an arbitrary quantum state, which is easier to produce in physical systems than entangled states, using the SWAPα operators and what are their applications? Our approach to this is to determine the invariant subspaces of the permutation group S n when applied to the Hilbert space of n-qubits. These subspaces comprise vectors that map back onto a linear superposition of the same vectors under the action of SWAPα operators. In Section II, we look more closely at the invariant subspaces for the combinations of SWAPα gates and look at the kinds of invariant subspaces that can arise for quantum states with different numbers of | 0 and | 1 in them. In Section III, we highlight the numerical complexity of the problem and look closely at the analytical method to generate vector states for our quantum system. In Section IV, we look at the idea of symmetry under parity of this system and discuss an efficient algorithm for generating n-qubit vector states for SWAPα gates. In Section V, we look at the problem of accessibility of quantum states using Power-of-SWAP gates and devise conditions for the output states, given aninput state and combination of SWAPα gates.

2. SWAPα and Invariant Subspaces

Quantum logic gates are essential building blocks of a quantum computer. The SWAPα quantum gate with 0 < α 1 is one of the most efficient quantum gates in two-qubit quantum computation, with three SWAPα gates combined with six single-qubit gates being able to realize any arbitrary two-qubit unitary operation [47] [48] [49]. The SWAPα gate can be experimentally implemented in several physical systems such as in the exchange interaction between electrons trapped by surface acoustic waves [34] [50]. In our paper, we look at the use of only SWAPα operators for generation of quantum states and our analysis applies to any n-qubit quantum state that can undergo SWAPα operations, where α is any real number.

We find that a combination of all SWAPα gates between a finite number of qubits comprise a group that is isomorphic to the Symmetric Group , which is the group of all permutations or self-bijections of a set of elements with the operation of composition, and that only certain points in the Hilbert Space are accessible using the SWAPα gates, given a particular input state. To find the kinds of states that are accessible under the repeated action of a SWAPα operator, we need to study the invariant subspaces1 associated with this combination of SWAPα operators. We find the structure of the invariant subspaces of the combination of SWAPα gates to be the same for all α.

The invariant subspaces of a vector space under the action of a group emerge from the irreducible representations of the group. For any group, the number of irreducible representations is equal to the number of conjugacy classes2. It is seen that for the Symmetric Group S n , the way in which we can permute n elements without changing the structure of the superposition of vector states characterize the specific conjugacy class, and by extension the invariant subspace of the group, associated with those vector states. In other words, the invariant subspaces of the Symmetric Group S n comprise of vector states, whose linear superposition remains invariant under the action of permutation of elements within the partition that corresponds to the invariant subspace. For instance, in the case of permutation symmetries of four elements, we have conjugacy classes of the Symmetric Group S 4 such as [4] (cyclic permutation of all four elements), [31] (transposing three, leaving one alone) and [1111] (no change)3. A point to note here is that there could be several cases for each cycle pattern. For instance, for four qubits 1-2-3-4, (12) (34) and (13) (24) are specific [22] cycles that correspond to a T 12 T 34 -invariant and T 13 T 24 -invariant subspaces respectively, where T i j correspond to transposition of the ith and jth qubit.

All the vector states that are associated with any specific invariant subspace corresponding to the Symmetric Group S n are found to have the same Hamming weight in their qubit representation. We find that the number of basis vectors comprising a specific invariant subspace and the forms of these vector states are related to the kind of permutation permissible within the partition corresponding to the invariant subspace. For n-qubit states, those vector states that span the entire subspace of states with a particular Hamming weight in as close to an equiprobabilistic manner (over the basis vectors) as possible are found to be closer to being invariant under all possible permutations of the n qubits, and are found to be part of one-dimensional invariant subspaces (with only one constituent vector state). For instance, the three-qubit quantum state that is invariant under all permutation under S 3 of its qubits is

| ψ = 1 3 ( | 001 + | 010 + | 100 ) and this is the only vector comprising the

invariant subspace corresponding to the trivial irreducible representation for three-qubit states with Hamming weight 1 in their qubit representation.

The number of | 0 and | 1 qubits in multiqubit states, represented by their Hamming weight, is found to uniquely define the kinds of invariant subspaces, with their associated permutation symmetries and corresponding partitions, of the SWAPα gates we can create with those states.

Let us consider a quantum state of the form

| ψ = PERM ( i ) α i | 00 0 k 11 1 n k i (1)

where i is an index related to each permutation of the qubits and the summation is over i, all the permutations of the qubits. We find that only certain permutations (and ways of partitioning) are applicable and important for a given set of vector-states that have a specific value of k. The change in an arbitrary superposition of the vector states resulting from these specific permutation operations can be used to express the change in the superposition of these vector states under any other permutation operation. In this respect, for n-qubit states with even

n and k n 2 , we find that the relevant partitions (and corresponding permutation symmetries) are C ( k ) = { C i ( k ) } = { [ n ] , [ n 1 , 1 ] , , [ n k , k ] } , where the i is

the index of the partitions for a fixed value of $k$. This is because the symmetries under permutations [ n ( k + 1 ) , k + 1 ] , , [ 11 ( n times ) ] are encapsulated in the existing set C i . An example of this is shown in Figure 1 for k = 2 , where the permutation within the partition [ n 3 , 3 ] is shown to be equivalent to permutation within the partition [ n ] . For n qubits states with even n and k > n 2 , the relevant partitions are C i ( k ) = { [ n ] , [ n 1 , 1 ] , , [ n ( n k ) , n k ] } . If we consider all possible values of k for a fixed value of n, the total number of sets of vector-states that correspond to the partition [ n ] is ( n + 1 ) . Similarly, we have ( n 1 ) sets of basis-vectors for the partition [ n 1 , 1 ] , ( n 3 ) for the

partition [ n 2 , 2 ] and so on till we have 1 set for the partition [ n 2 , n 2 ] , with there being n 2 + 1 kinds of subspaces that are relevant. As a result, N i n v ( even n ) = 1 2 ( n 2 + 1 ) ( ( n + 1 ) + 1 ) = 1 4 ( n + 2 ) 2 . For odd n, we have conjugacy classes C i ( k ) = { [ n ] , [ n 1 , 1 ] , , [ n k , k ] } for k n 1 2 and C i ( k ) = { [ n ] , [ n 1 , 1 ] , , [ n ( n k ) , n k ] } for k n + 1 2 . We have ( n + 1 ) basis vector-sets associated with the invariant subspace [ n ] , ( n 1 ) for [ n 1 , 1 ] , ( n 3 ) for [ n 2 , 2 ] and so on till 2 sets for [ n + 1 2 , n 1 2 ] , with there being n 1 2 + 1 kinds of partitions that need be independently described and are relevant. As a result, N i n v ( odd n ) = 1 2 ( n 1 2 + 1 ) ( ( n + 1 ) + 2 ) = 1 4 ( n + 1 ) ( n + 3 ) . Thus, we find that the number of invariant subspaces, N i n v , for an n-qubit system, operated upon by the SWAPα, is given by:

Figure 1. Permutations for n = 6 , k = 2 state: In this case, we have four qubits of one kind (say | 1 ) and 2 qubits of the other kind (say | 0 ). (a) the | 0 qubits have two | 1 qubits in between; rotating the first three qubits among themselves, while rotating the next three qubits among themselves, is equivalent to rotating all the qubits (to the right) once; (b) the | 0 qubits have one | 1 qubit in between, as shown; then carrying out the same operation: rotating the first three qubits among themselves, while rotating the next three qubits among themselves, is equivalent to rotating by a [5, 1] transposition followed by two instances of the complete rotation [6].

N i n v = { 1 4 ( n + 2 ) 2 , if n is even 1 4 ( n + 1 ) ( n + 3 ) , if n is odd , n > 1 . (2)

Invariant subspaces of the Symmetric Group S n and reducibility of representations are closely linked [51]. If a representation ρ of the group G has no non-trivial invariant subspace, we say that it is irreducible. Defining

U { SWAP } ( | q { i } , | q { j } ) as the SWAP operation between the ith and jth qubits in an n-qubit state | q 1 q 2 q { i } q { j } q { n } , we find that the matrix representation U { SWAP } ( | q { i } , | q { j } ) can be transformed into a block form D, comprising of

irreducible representations of the Symmetric Group S n associated with each invariant subspace, with a similarity (equivalence) transformation S. If one has r distinct SWAP operations between qubits applied consecutively, then the resultant operation can be block-diagonalized as follows:

D = D 1 D 2 D r = ( S 1 U SWAP 1 S ) ( S 1 U SWAP 2 S ) ( S 1 U SWAP r S ) (3)

where U SWAP i represent the ith distinct SWAP operation.

This similarity transformation is found to be useful in block-diagonalizing the basic SWAPα-gates representations as well, since by definition,

U SWAP α = 1 e i π α 2 U SWAP + 1 + e i π α 2 I ( 2 × 2 ) (4)

where I ( 2 × 2 ) is a 2 × 2 identity matrix. As a result, the similarity transformation S that transforms the composite SWAP operator to a block-diagonal form: D = S 1 U SWAP S , will also transform the U SWAP α in the same block form, up to

certain additive terms: S 1 U SWAP α S = 1 e i π α 2 D 1 + 1 + e i π α 2 I ( 2 × 2 ) D . Due to the

relation established in (2), the similarity transformation and associated invariant subspace associated with U SWAP α must be of the same structural form as those for the U SWAP gate. This is also true for a combination of U SWAP α gates: ( S n ) 1 ( U SWAP α n ) ( S n ) = ( S 1 U SWAP α S ) n .

The matrix decomposition thus formed is block diagonal, as shown in the illustrative example in Figure 2 for the case of two matrices. Thus, we find that the various combinations of n copies of SWAPα gates, operating over a multi-qubit input state, produce a group that is isomorphic to the symmetric group S n . In fact, any function of SWAPα gates can be put into the block form using

the same similarity transformation: S 1 f ( U SWAP α ) S = f ( 0 ) S 1 I 2 × 2 S +

f ( 0 ) S 1 U SWAP α S + f ( 0 ) 1 2 ! S 1 U SWAP α S S 1 U S W A P α S + , using Taylor series

expansion of the function of U SWAP α , and pre- and post-multiplying with S and S 1 respectively. As a result, the determination of the similarity transformation for SWAP alone gives us a useful tool for finding the invariant subspaces and associated vectors for any arbitrary combination or function of partial SWAP gates.

Figure 2. Illustrative example of tensor Product of two block diagonal matrices with one 3 × 3 block, two 2 × 2 blocks and one single block. For the case of block-diagonal matrices D, the combination of such matrices leads to a resultant block-diagonal matrix, thereby showing that various combinations of n copies of SWAPα gates, operating over a multi-qubit input state, produce a group that is isomorphic to the symmetric group S n .

3. Generation of Vector States

Due to the non-commutativity of adjacent SWAPα gates with at least one common qubit, the number of output states generated for a given input state and gate-combination is a lot more than in the case of commutative gates. For an l-qubit separable input state and k gates used, we have the following number of cases and associated accessible output states:

N a c c l = l k × 2 l . (5)

As can be seen, the problem grows exponentially with the number of qubits in the input (separable) states. The number of gates also scales this value exponentially. Certain cases are degenerate but the problem, all in all, grows exponentially with the number of qubits in the input state and the number of gates being operated with on the input state. As a result, this is a problem that cannot be treated efficiently using numerical methods, as the number of qubits involved increase. To resolve this problem, we look at analytic methods, using techniques for the representation theory for the symmetric group S n .

The system we are considering is an arbitrary n-qubit state and we are operating combinations of SWAPα operations on such an input state. The action of

the is: | 00 | 00 , | 01 1 + e { i π α } 2 | 01 + 1 e { i π α } 2 | 10 ,

| 10 1 + e { i π α } 2 | 10 + 1 e { i π α } 2 | 01 , | 11 | 11 . The relevance of the SWAP or

partial SWAP arises from the fact that any permutation of elements can be expressed as a combination of transpositions [52], which on the physical level can be realized using SWAP operations. The matrix representation for these SWAP operations can be found efficiently using a standard sorting algorithm operated on a 2 n × 2 n identity matrix and permuting the relevant rows of the matrix depending on which qubits are being swapped by the particular SWAP operation. This is efficient since instead of finding all the n ! permutation matrices using a scheme such as that based on Cayley trees, one can simply use n 2 n transpositions to generate the group. Any arbitrary element of the group can then be found using a combination of these transpositions.

The next significant step in the process of generating the vector states is to look at the irreducible representations { D i , i = 1 , 2 , , N ! } of the group. The first step in this regard is to find the dimensions of the irreps using the Young’s Tableau [53]. For any n qubit system, we can find the dimensionality of the irrep using the hook lengths of the elements in it [54] [55] and the hook product [56] h of the tableau. The dimension d of the irrep is then given by

d = n ! h . (6)

Once we have found the dimensions of the irreps, the next step is to find the forms of the irreps. We find the Young’s orthogonal form for the irreps using the equation [57]

D [ μ ] ( ( k , k + 1 ) ) { e } M 1 M n [ μ ] = ( ρ ( M 1 M n ; k + 1 , k ) ) { 1 } e ^ M 1 M n [ μ ] + A e ^ M 1 M k + 1 M k M n [ μ ] , (7)

where A = 1 ( ρ ( M 1 M n ; k + 1 , k ) ) 2 and where we use the orthonormal basis e ^ { i } μ where i = 1 , 2 , 3 , , f [ μ ] : ( e ^ i [ μ ] , e ^ j [ μ ] ) = δ i j . The index i of the basis-vector is related to the Yamanouchi symbol M for the tableau [53].

Using this formula, we can look at the irreducible representations for all elements of the group. A point to note here is that not all irreducible representations may be required to describe a physical system. A good way to see which irreducible representations are relevant, we must construct a Character Table. We do so by considering the trace (character) values of the irreps for a given conjugacy class and kind of irrep (as defined by its dimensionality). The columns of the Character Tableare for elements of the same conjugacy class while the rows of the Tableare for elements of the same irrep. Once we have constructed the entire Character Table, we assign a variable (say α i for the ith irrep) to each irreducible representation, and multiply these with the character of the irrep (say a i for the ith irrep) for each conjugacy class, before adding them up. We equate this sum to the trace (character) of the permutation matrix for each conjugacy class ξ that we found previously:

ξ = i α i a i . (8)

This leads to a system of linear equations, whose solutions determine uniquely the kinds of irreps that are relevant along with the number of irreps of each kind that constitute the block-diagonalized form of the permutation matrices. The permutation matrices { P i , i = 1 , 2 , , N ! } can be simultaneously diagonalized to irreps { D i , i = 1 , 2 , , N ! } with the same block form using a similarity transformation. These two sets of matrices are related by the relation:

D i = S { 1 } P i S , i = 1 , 2 , 3 , , N ! (9)

Solving this set of linear equations algebraically, gives us a similarity transformation S. However, this solution is not unique and there may be several unresolved elements within the matrix representation of the similarity transformation S. For our system, we resolve this problem using the imposition of a condition of unitarity on this matrix.

Let us say we had a permutation operator P operating on an initial state | ψ to give a final output state | ψ :

| ψ = P | ψ . (10)

Then operating with the similarity transformation S 1 , gives us:

S 1 | ψ = S 1 P | ψ = ( S 1 P S ) S 1 | ψ = D S 1 | ψ . (11)

Therefore, the eigenvectors of the block-diagonalized matrices are of the form:

| ϕ = S 1 | ψ . (12)

Usually | ψ is taken to be the basis comprising of all 2 n separable n-qubit states, and the vector | ϕ is regarded as the invariant subspace vectors, since the block-diagonalized forms have blocks corresponding to the invariant subspaces of the system. So, if one was to begin with any linear combination of n-qubit vectors that are spanned by the constituent-vectors of an invariant subspace, the state that emerges out of the application of an arbitrary combination of SWAPα gates is always a linear combination of those constituent-vectors of the invariant subspace as well. We find that for n-qubits, we have the following number of such vectors

N { v } = { i = 0 N 2 ( n + 1 2 i ) × d [ n i , i ] if n is even i = 0 N 1 2 ( n + 1 2 i ) × d [ n i , i ] if n is odd . (13)

The vectors that comprise the invariant subspaces have characteristic entanglement patterns. Invariance of the quantum states under Stochastic Local Operations and Classical Communications (SLOCC) is a way to classify these states into entanglement-families [58] [59] [60] [61]. One of the key aspects of this is that since the SWAPα gate commutes with the total z-spin operator S { z } = v V σ v z , the action of the Power-of-SWAP gate U SWAP α breaks the Hilbert Space into a direct sum H k = 0 N Γ k [6], where Γ 0 = { | 00 0 } , Γ 1 = { | 10 0 , | 01 0 , , | 00 1 } , Γ 2 = \ { | 11 0 , | 101 0 , , | 00 11 } and so on, with Γ N = { | 11 1 } . These subspaces are found to have distinct symmetries, depending on the number of | 0 and | 1 qubits in the state. The states for one-dimensional irreps: the perfectly permutation symmetric Dicke states have been studied for the categorization under SLOCC (Stochastic Local Operation and Classical Communication) invariant families using geometric measures of entanglement [10] [62]. In this paper, we look at the relation of entanglement to symmetries (under transposition cycles) in other kinds of irreps relevant for a general n-qubit state.

A general n-qubit state with the same Hamming weight across all its superposition states can therefore be written as

| ψ = i d a i | i (14)

where | i are the vectors associated to the invariant subspace with that Hamming weight and d denotes the dimensionality of the invariant subspace under consideration. More generally, we can express a general quantum state as

| ψ = k l i d k a i ( k ) | i ( k ) (15)

where | i ( k ) are the vectors associated to the invariant subspace with the Hamming weight k and dk denotes the dimensionality of the invariant subspace with that particular Hamming weight, while l denotes the number of Hamming weights present in the superposition (system) in the quantum state under consideration.

For four-qubits states, there are 16 vector-states comprising three [31] invariant subspaces each comprising of three vectors, one [22] invariant subspace comprising of two vectors and five trivial representation vector-states. The one-dimensional invariant subspace vectors are the famous Dickestates. These states can be classified into the nine SLOCC-invariant families of entanglement classes defined by Verstaete et al. [58]. Any arbitrary four-qubit state can be written in terms of these invariant subspace vectors, with l = 5 and

d 0 = 1 ; d 1 = 1 , 3 ; d 2 = 1 , 2 , 3 ; d 3 = 1 , 3 ; d 4 = 1 (16)

in equation (15). This is because there are multiple invariant subspaces for the same Hamming weight, with the Hamming weights 1, 2 and 3 having multiple invariant subspaces in this case. The vectors in an invariant subspace remain within that subspace given any combination of SWAPα gates operated upon them.

4. Symmetry under Parity and Efficient Algorithm for Generating n-Qubit Vector States for SWAPα Gates

One of the fundamental properties of the SWAPα gates is that they conserve parity. The number of | 0 s and | 1 s in a multiqubit state remain the same. This is a key to proposing an efficient algorithm for finding the vector states associated with the invariant subspaces for the SWAPα gates.

Let us say we have the following families of n-qubit states:

W i = { PERM ( | { 00 0 } { n i } { 11 1 } { i } ) } (17)

where PERM defines the permutation function for a given set of qubits.

There is no map, f ( U SWAP α ) comprising of only SWAPα that can take us from one such family W i to another family W j for i j . This property can be used to define the set of basis vector-sets by starting with a completely symmetric state using all the vectors in the family W i and then finding the null-space vectors for the same. We have found an algorithm and realization of the same that can carry out quick and efficient generation of the vector-states for n-qubits under operation by SWAPα gates.

5. Accessibility of Quantum States Using Power-of-SWAP Gates

In this section, we will be looking at the accessibility of quantum states using only Power-of-SWAP gates for an arbitrary input quantum states. For the two-qubit case, let us begin with a state of the form

| ψ { i n } = α | 00 + β | 01 + γ | 10 + δ | 11 . (18)

If we have a parameter t [ 0 , 1 ] and the SWAP-gate is the unitary generated by the Heisenberg Hamiltonian for evolution time t = 1 , then we can generate the fractional SWAP by doing the Hamiltonian evolution for time t ( 0 , 1 ) . For

time steps of the form t = 1 m , m , we obtain the so-called nth Power-of-SWAP (SWAPα) gates.

In the two-qubit case, let’s fix a Power-of-SWAP circuit of depth m, such that for each i = 1 , , m , we apply a U i = SWAP γ i with γ i = 1 / n i for n i . Let us look at only the subspace spanned by { | 01 , | 10 } . We have

| ψ i n U m U { m 1 } U 1 ψ f = α | 00 + β | 01 + γ | 10 + δ | 11 , (19)

Since our unitaries are parity preserving, α = α , δ = δ . Now we can consider the inverse problem: fix the initial and final states, and a precision parameter ϵ ( 0 , 1 ) , and compute a sequence n 1 , , n m such that U ( Γ ) : = U m U m 1 U 1 brings | ψ i n within the ϵ -ball around | ψ f , i.e.,

| | ψ f U | ψ i n | ϵ .

Noting that U ( Γ ) = e i Γ H SWAP , we can also first solve for the time parameter Γ and then obtain the sequence { n } i . Let us do this for ϵ = 0 . Taking the | 00 , | 11 subspaces as invariant, we have the matrix equation

1 2 [ 1 + e i π Γ 1 e i π Γ 1 e i π Γ 1 + e i π Γ ] ( β γ ) = ( β γ ) (20)

which we can solve for Γ to get the conditions (assuming $\alpha\neq\beta$)

e i π Γ = 2 β ( β + γ ) β γ = 2 γ ( β + γ ) β γ , (21)

for which to have a solution, we require β + γ = β + γ .

The result given above can be generalized to the case of higher-number of qubits. For any combination of Power-of-SWAP and general n-qubit input state of the form | ψ = α 0 | 000 00 + α 1 | 000 01 + + α 2 N | 111 11 being transformed to | ψ = β 0 | 000 00 + β 1 | 000 01 + + β 2 N | 111 11 . We derive a condition for the coefficients of the vector basis states with the same Hamming weights. Let denote the set of all coefficients associated with vector states with

the same Hamming weight i as { α ( h w ) ( i ) k } in the input quantum state and denote the set of all coefficients associated with vector states with the same Hamming weight { β ( h w ) ( i ) k } in the output quantum state. Here k and k' denote the indices of the coefficients in each such set. Then,

k α ( h w ) ( i ) k = k β ( h w ) ( i ) k (22)

for any n-qubit case. This is a powerful result since it, along with the normalization condition, helps us determine the kinds of states that are derivable from the operation of just Power-of-SWAP gates on a general n-qubit state.

6. Conclusions

In this paper, I have found a way to generate all the basis vector-states that span the space of states accessible by an arbitrary Power-of-SWAP gate. In doing so, we have found several classes of states. These include maximally entangled states such as the W-states, partially entangled cluster states and separable states. Each of these can be used for various kinds of applications in quantum information processing.

With the exponential scaling of the computation basis with the number of basis, we see that the basis vectors of the invariant subspaces also increase exponentially. It was found that only specific states can be generated using an initial quantum state and a combination of SWAPα gates, and hopping between these points represents a quantum computation. By understanding the invariant subspaces, I realize an accessible resource for quantum computation using SWAPα. This quantum computation is resilient to parity changes and other forms of errors due to the permutation symmetries of the vectors comprising the invariant subspaces. I hope that this paper will pave the way for the use of the SWAPα for generation of quantum resource-states in quantum information processing tasks.


I would like to acknowledge the contribution of Trinity College, Cambridge and the Nehru Trust for Cambridge University (NTCU) who funded the project. I would like to acknowledge the contributions of Prof. Crispin Barnes, Mr. Yordan Yardanov, Dr. David R. M. Arvidsson-Shukur and Mr. Sathyageeshwar Subramaniam.


1A subspace W of a vector space V is invariant, with respect to a group G, if ρ ( g ) W W for every g G , where ρ is a representation of the group G of the group S n .

2A Conjugacy Class is an equivalence class that, for every element a in a group G, contains b G such that there exists g G with b = g a g 1 .

3Here, we use the notation [ t 1 , t 2 , ] to represent a transposition where t 1 qubits are rotated by one among themselves, t 2 qubits by one among themselves, and so on.

Conflicts of Interest

The author declares no conflicts of interest regarding the publication of this paper.


[1] Einstein, A., Podolsky, B. and Rosen, N. (1935) Can Quantum-Mechanical Description of Physical Reality Be Considered Complete? Physical Review, 47, 777.
[2] Schrodinger, E. (1935) Die gegenwärtige Situation in der Quantenmechanik. Naturwissenschaften, 23, 807-812.
[3] Horodecki, R., Horodecki, P., Horodecki, M. and Horodecki, K. (2009) Quantum Entanglement. Reviews of Modern Physics, 81, 865.
[4] Amico, L., Fazio, R., Osterloh, A. and Vedral, V. (2008) Entanglement in Many-Body Systems. Reviews of Modern Physics, 80, 517.
[5] Jurcevic, P., Lanyon, B.P., Hauke, P., Hempel, C., Zoller, P., Blatt, R. and Roos, C.F. (2014) Quasiparticle Engineering and Entanglement Propagation in a Quantum Many-Body System. Nature, 511, 202-205.
[6] Islam, R., Ma, R., Preiss, P.M., Tai, M.E., Lukin, A., Rispoli, M. and Greiner, M. (2015) Measuring Entanglement Entropy in a Quantum Many-Body System. Nature, 528, 77-83.
[7] Eggeling, T. and Werner, R. (2001) Separability Properties of Tripartite States with UUU Symmetry. Physical Review A, 63, Article ID: 042111.
[8] Toth, G. and Guhne, O. (2010) Separability Criteria and Entanglement Witnesses for Symmetric Quantum States. Applied Physics B, 98, 617.
[9] Toth, G. and Guhne, O. (2009) Entanglement and Permutational Symmetry. Physical Review Letters, 102, Article ID: 170503.
[10] Markham, D.J. (2011) Entanglement and Symmetry in Permutation-Symmetric States. Physical Review A, 83, Article ID: 042332.
[11] Hubener, R., Kleinmann, M., Wei, T.-C., Gonzalez Guillen, C. and Guhne, O. (2009) Geometric Measure of Entanglement for Symmetric States. Physical Review A, 80, Article ID: 032324.
[12] Barasinski, A. and Nowotarski, M. (2017) Quantifying Entanglement Properties of Qudit Mixed States with Incomplete Permutation Symmetry. Physical Review A, 95, Article ID: 042333.
[13] Calixto, M., Castanos, O. and Romera, E. (2017) Entanglement and Quantum Phase Diagrams of Symmetric Multi-Qubit Systems. Journal of Statistical Mechanics: Theory and Experiment, 2017, Article ID: 103103.
[14] Kadiri, G. and Sivakumar, S. (2017) Permutation Symmetry and Entanglement in Quantum States of Heterogeneous Systems.
[15] Vogel, K., Akulin, V. and Schleich, W. (1993) Quantum State Engineering of the Radiation Field. Physical Review Letters, 71, 1816-1819.
[16] Makhlin, Y., Schon, G. and Shnirman, A. (2001) Quantum-State Engineering with Josephson-Junction Devices. Reviews of Modern Physics, 73, 357.
[17] DellAnno, F., De Siena, S. and Illuminati, F. (2006) Multiphoton Quantum Optics and Quantum State Engineering. Physics Reports, 428, 53-168.
[18] Verstraete, F., Wolf, M.M. and Cirac, J.I. (2009) Quantum Computation and Quantum-State Engineering Driven by Dissipation. Nature Physics, 5, 633-636.
[19] Chiu, C.S., Ji, G., Mazurenko, A., Greif, D. and Greiner, M. (2018) Quantum State Engineering of a Hubbard System with Ultracold Fermions. Physical Review Letters, 120, Article ID: 243201.
[20] Mathonet, P., Krins, S., Godefroid, M., Lamata, L., Solano, E. and Bastin, T. (2010) Entanglement Equivalence of N-Qubit Symmetric States. Physical Review A, 81, Article ID: 052315.
[21] Ji, Q., Liu, Y., Yin, X., Liu, X. and Zhang, Z. (2013) Quantum Operation Sharing with Symmetric and Asymmetric W States. Quantum Information Processing, 12, 2453-2464.
[22] Jiang, D.-Y., Wu, R., Li, S. and Wang, Z. (2009) Controlled Dense Coding with Symmetric State. International Journal of Theoretical Physics, 48, 2297-2304.
[23] Liu, X.-W. (2015) Controlled Dense Coding with Non-Symmetric Quantum State. International Journal of Theoretical Physics, 54, 1253-1257.
[24] Rajagopal, A. and Rendell, R. (2002) Robust and Fragile Entanglement of Three Qubits: Relation to Permutation Symmetry. Physical Review A, 65, Article ID: 032328.
[25] Zanardi, P. (1999) Symmetrizing Evolutions. Physics Letters A, 258, 77-82.
[26] Eltschka, C. and Siewert, J. (2012) Entanglement of Three-Qubit Greenberger-Horne-Zeilinger-Symmetric States. Physical Review Letters, 108, Article ID: 020502.
[27] Barenco, A., Berthiaume, A., Deutsch, D., Ekert, A., Jozsa, R. and Macchiavello, C. (1997) Stabilization of Quantum Computations by Symmetrization. SIAM Journal on Computing, 26, 1541-1557.
[28] Wang, X. and Zanardi, P. (2002) Quantum Entanglement and Bell Inequalities in Heisenberg Spin Chains. Physics Letters A, 301, 1-6.
[29] Wei, J.-H., Qi, B., Dai, H.-Y., Huang, J.-H. and Zhang, M. (2015) Deterministic Generation of Symmetric Multi-Qubit Dicke States: An Application of Quantum Feedback Control. IET Control Theory & Applications, 9, 2500.
[30] Thiel, C., Von Zanthier, J., Bastin, T., Solano, E. and Agarwal, G. (2007) Generation of Symmetric Dicke States of Remote Qubits with Linear Optics. Physical Review Letters, 99, Article ID: 193602.
[31] Shao, X.-Q., Chen, L., Zhang, S., Zhao, Y.-F. and Yeon, K.-H. (2010) Deterministic Generation of Arbitrary Multi-Atom Symmetric Dicke States by a Combination of Quantum Zeno Dynamics and Adiabatic Passage. EPL (Europhysics Letters), 90, Article ID: 50003.
[32] Nielsen, M. and Chuang, I. (2010) Quantum Computation and Quantum Information. 10th Anniversary Edition, Cambridge University Press, Cambridge.
[33] DiVincenzo, D.P., Bacon, D., Kempe, J., Burkard, G. and Whaley, K.B. (2000) Universal Quantum Computation with the Exchange Interaction. Nature, 408, 339-342.
[34] Barnes, C., Shilton, J. and Robinson, A. (2000) Quantum Computation Using Electrons Trapped by Surface Acoustic Waves. Physical Review B, 62, 8410.
[35] Rohling, N. and Burkard, G. (2012) Universal Quantum Computing with Spin and Valley States. New Journal of Physics, 14, Article ID: 083008.
[36] Lin, G.-W., Zou, X.-B., Ye, M.-Y., Lin, X.-M. and Guo, G.-C. (2008) Quantum SWAP Gate in an Optical Cavity with an Atomic Cloud. Physical Review A, 77, Article ID: 064301.
[37] Sangouard, N., Lacour, X., Guerin, S. and Jauslin, H.-R. (2005) Fast SWAP Gate by Adiabatic Passage. Physical Review A, 72, Article ID: 062309.
[38] Wei, H.-R. and Deng, F.-G. (2015) Compact Implementation of the (SWAP)α Gate on Diamond Nitrogen-Vacancy Centers Coupled to Resonators. Quantum Information Processing, 14, 465-477.
[39] Lin, X., Yang, R.-C. and Chen, X. (2015) Implementation of a Quantum √swap Gate for Two Distant Atoms Trapped in Separate Cavities. International Journal of Quantum Information, 13, Article ID: 1550003.
[40] Liu, A.-P., Cheng, L.-Y., Zhang, S., Zhao, Y., Gao, X.-Z., Chang, Y.-H. and Wang, A.-P. (2016) Deterministic Controlled-Phase Gate and SWAP Gate with Dipole-Induced Transparency in the Weak-Coupling Regime. Optics Communications, 379, 19-24.
[41] Ono, T., Okamoto, R., Tanida, M., Hofmann, H.F. and Takeuchi, S. (2017) Implementation of a Quantum Controlled-SWAP Gate with Photonic Circuits. Scientific Reports, 7, Article No. 45353.
[42] Borne, A., Bechler, O., Rosenblum, S., Guendelman, G., Mor, O., Netzer, M., Gurovich, D., Ohana, T., Aqua, Z., Drucker, N., Lovsky, Y., Bruch, R., Finkelstein, R., Shafir, E. and Dayan, B. (2017) Demonstration of Deterministic and Passive Photon-Atom SWAP Quantum Gate. In: Quantum Information and Measurement (QIM), Optical Society of America, QT2A-7.
[43] Burkard, G., Loss, D., DiVincenzo, D.P. and Smolin, J.A. (1999) Physical Optimization of Quantum Error Correction Circuits. Physical Review B, 60, Article ID: 11404.
[44] Barenco, A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N., Shor, P., Sleator, T., Smolin, J.A. and Weinfurter, H. (1995) Elementary Gates for Quantum Computation. Physical Review A, 52, 3457-3467.
[45] Tanamoto, T., Liu, Y.-X., Hu, X. and Nori, F. (2009) Efficient Quantum Circuits for One-Way Quantum Computing. Physical Review Letters, 102, Article ID: 100501.
[46] Raussendorf, R. and Briegel, H.J. (2001) A One-Way Quantum Computer. Physical Review Letters, 86, 5188-5191.
[47] Fan, H., Roychowdhury, V. and Szkopek, T. (2005) Optimal Two-Qubit Quantum Circuits Using Exchange Interactions. Physical Review A, 72, Article ID: 052323.
[48] Guerrero, R.J. and Rojas, F. (2008) Effect of the Dzyaloshinski-Moriya Term in the Quantum (SWAP)α Gate Produced with Exchange Coupling. Physical Review A, 77, Article ID: 012331.
[49] Balakrishnan, S. and Sankaranarayanan, R. (2008) Entangling Characterization of SWAP1/m and Controlled Unitary Gates. Physical Review A, 78, Article ID: 052305.
[50] Ford, C.J.B. (2017) Transporting and Manipulating Single Electrons in Surface-Acoustic-Wave Minima. Physica Status Solidi B, 254, Article ID: 052305.
[51] Weyl, H. (2016) The Classical Groups: Their Invariants and Representations. Princeton University Press, Princeton.
[52] Anshelevich, M., Gaikema, M., Hansalik, M., He, S. and Mehlhop, N. (2017) Expansion of Permutations as Products of Transpositions. arXiv Preprint arXiv: 1702.06093.
[53] Yamanouchi, T. (1937) On the Construction of Unitary Irreducible Representations of the Symmetric Group. Proceedings of the PhysicoMathematical Society of Japan, 3rd Series, 19, 436.
[54] Gessel, I. and Viennot, G. (1985) Binomial Determinants, Paths, and Hook Length Formulae. Advances in Mathematics, 58, 300-321.
[55] Fulton, W. (1997) Young Tableaux: With Applications to Representation Theory and Geometry. Vol. 35, Cambridge University Press, Cambridge.
[56] Kung, J.P. (2014) Young Tableaux in Combinatorics, Invariant Theory, and Algebra: An Anthology of Recent Work. Elsevier, Amsterdam.
[57] Van Beveren, E. (1998) Some Notes on Group Theory. Lecture Notes, Universidade de Coimbra.
[58] Verstraete, F., Dehaene, J., De Moor, B. and Verschelde, H. (2002) Four Qubits Can Be Entangled in Nine Different Ways. Physical Review A, 65, Article ID: 052112.
[59] Bengtsson, I. and Zyczkowski, K. (2017) Geometry of Quantum States: An Introduction to Quantum Entanglement. Cambridge University Press, Cambridge.
[60] Spee, C., de Vicente, J., Sauerwein, D. and Kraus, B. (2017) Entangled Pure State Transformations via Local Operations Assisted by Finitely Many Rounds of Classical Communication. Physical Review Letters, 118, Article ID: 040503.
[61] Sadhukhan, D., Roy, S.S., Pal, A.K., Rakshit, D., Sen, A., Sen, U., et al. (2017) Multipartite Entanglement Accumulation in Quantum States: Localizable Generalized Geometric Measure. Physical Review A, 95, Article ID: 022301.
[62] Devi, A.U., Rajagopal, A., et al. (2012) Majorana Representation of Symmetric Multiqubit States. Quantum Information Processing, 11, 685-710.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.