SU(2) Decomposition for the Quantum Information Dynamics in 2d-Partite Two-Level Quantum Systems

The gate array version of quantum computation uses logical gates adopting convenient forms for computational algorithms based on the algorithms classical computation. Two-level quantum systems are the basic elements connecting the binary nature of classical computation with the settlement of quantum processing. Despite this, their design depends on specific quantum systems and the physical interactions involved, thus complicating the dynamics analysis. Predictable and controllable manipulation should be addressed in order to control the quantum states in terms of the physical control parameters. Resources are restricted to limitations imposed by the physical settlement. This work presents a formalism to decompose the quantum information dynamics in SU(22d) for 2d-partite two-level systems into 22d−1 SU(2) quantum subsystems. It generates an easier and more direct physical implementation of quantum processing developments for qubits. Easy and traditional operations proposed by quantum computation are recovered for larger and more complex systems. Alternating the parameters of local and non-local interactions, the procedure states a universal exchange semantics on the basis of generalized Bell states. Although the main procedure could still be settled on other interaction architectures by the proper selection of the basis as natural grammar, the procedure can be understood as a momentary splitting of the 2d information channels into 22d−1 pairs of 2 level quantum information subsystems. Additionally, it is a settlement of the quantum information manipulation that is free of the restrictions imposed by the underlying physical system. Thus, the motivation of decomposition is to set control procedures easily in order to generate large entangled states and to design specialized dedicated quantum gates. They are potential applications that properly bypass the general induced superposition generated by physical dynamics.


Introduction
Quantum information is generating new applications and tentative future technologies such as quantum computation [1-3] and quantum cryptography, based on disruptive phenomena in its main trends: quantum key distribution [4,5], quantum secret sharing [6], and quantum secure direct communication [7,8]. All these trends highlight the importance of entangled states-a basic aspect involved in the current work in order to achieve quantum information processing tasks. In this arena, the understanding of quantum information dynamics and the control of quantum systems is a compulsory development to manage the quantum resources involved. Applications require a tight control of resources and interactions-especially those related with coherence and entanglement. They are fundamental in most applications. Quantum control has developed the fine management of physical variables to prepare, maintain, and transform quantum states in order to exploit them for concrete purposes. The outstanding high-tech commercial appliances D-Wave and IBM-Q use qubits in the form of two-level systems, either with superconducting circuits or ions as well as several approaches to their interconnecting architecture.
For multipartite systems, research in control is oriented to achieve different goals in quantum applications. Most of them are numerical approaches rather than analytical due to the inherited complexity in the quantum information dynamics when the number of parts grows. For a single system with a two-level spectrum, the control problem has been extensively studied in terms of exact optimal control for energy or time cost [9,10]. Recently, research of the anisotropic Heisenberg-Ising model for bipartite systems in SU(4) [11] has shown how this model exhibits SU(2) block decomposition when it is written in the non-local basis of Bell states instead of the traditional computational basis. This means that H 2 becomes a direct sum of two subspaces, each one generated by a pair of Bell states, while U underlies in the direct product U(1) × SU(2) 2 . Thus, control can be reduced to SU(2) control problems, each one in each block. Then, exact solutions for some control procedures can be found [12,13]. There, controlled blocks can be configured by the direction of external driven interactions introduced. That scheme allows controlled transformations between Bell states on demand and therefore on a general state. Thus, the procedure sets a method of control to manipulate quantum information on magnetic systems, where the computational grammar is based on Bell states instead of the traditional computational basis. It allows an easier programmed transformation among any pair of elements in that basis. This result provided the inspiration to reproduce similar decomposition schemes for larger systems in terms of simpler problems based on quasi-isolated two-level subsystems, developing easier and universal (not necessarily optimal) controlled manipulation procedures for quantum information. Technology to set up the possible architecture of these generic systems is currently being achieved through trapped-ion qubits [14] and superconducting qubits [15].
Thus, the generalization of SU(2) block decomposition is a convenient formalism to express dynamics, revealing certain quantum information states algebraically free of the complexity introduced by the entangling operations (doing few convenient the use of the computational basis). Nevertheless, they still conserve their entangled properties. This reveals how the probability exchange happens together with the structure of entanglement behind the randomness introduced by the complexity of large quantum information systems. Still, as for their predecessor, those bases maintain a certain degree of universality, including several alternative local and non-local interactions. As for their SU(4) predecessor, when they are combined, it states a series of punctual operations that can be set: (a) fine control based on well-known SU(2) control procedures; (b) the construction of universal gates for the entire process based on two-channel like operations; and (c) the design of more complex dedicated multi-channel gates by factorization.
The general aim of this paper is to show that such decomposition and reduction is achievable for large qubit systems, not only for those in [11,13]. The second section states the general Hamiltonian to be analyzed. The third section shows how the SU(2) decomposition procedure can be generalized on general n-partite two-level systems (not only for the driven Heisenberg-Ising interactions), reducing them to 2 n−1 selectable transformations between pairs of specific quantum energy states. Then, these transformations can be based on known control schemes for SU(2) systems such as those in [9,10]. The selection of these 2 n−1 pairs of states can be based on the convenience of the quantum process being considered and the resources involved. Thus, the basis on which the decomposition can be established works as a computational grammar for the quantum procedures being attained. These bases are not completely arbitrary, and thus the fourth section shows how a kind of generalized Bell basis is able to generate the SU(2) decomposition for an even number of parts, n = 2d. The fifth section is devoted to analyzing the restrictions on the Hamiltonian to get the SU(2) decomposition, the inherited states, and the block properties. This analysis includes a classification of interactions able to generate the SU(2) decomposition. Because the presented procedure can reproduce complex quantum gates, generate large entangled states, and introduce control procedures in SU(2 2d ) if the grammar is based on the proposed basis, the sixth section analyzes potential applications in these trends. The final section concludes, summarizing the findings and settling the related future work to be developed. Because several aspects in the work may be complex for the reader, an appendix with some critical concepts has been included to clarify the contents.

Generalized Hamiltonian
The problem can be established for a general Hamiltonian for n coupled two-level systems on U(2 n ) forming a closed system. It can be written as a general combination of tensor products of Pauli matrices for each subsystem (for a more detailed discussion of this Hamiltonian, please see ( where {i k } = {i 1 , i 2 , . . . , i n }, i k = 0, 1, 2, 3, and h {i k } is a general set of time-dependent real functions. Sometimes, as in the second expression in (1), {i k } will be represented as the number I ∈ {0, 1, . . . , 4 n − 1}, as it is expressed in base-4 with n digits, I n 4 . Then, I n 4,k = i k for k = 1, 2, . . . , n. σ i k for i k = 0, 1, 2, 3 are the traditional Pauli matrices in the computational basis |0 , |1 ∈ H 2 for each part k. Note that due to the SU(2) algebra of Pauli matrices, this Hamiltonian comprises all analytical Hamiltonians based on two-level systems with n parts. The Hamiltonian obeys the Schrödinger equation for its associated evolution operatorŨ: Although h {0,...,0} is not necessarily zero, if {Ẽ j |j = 1, . . . , 2 n } are the eigenvalues ofH and E ≡ ∑ these operators become the equivalent traceless Hamiltonian and its corresponding evolution operator with eigenvalues E j =Ẽ j − h {0,...,0} , both fulfilling (2) as well. H andH have the same set of eigenvectors { b j ∈ H 2 n |j = 1, . . . , 2 n }. Thus, the Hamiltonian can be written alternatively as H = ∑ 2 n j=1 E j b j b j . Thus, in the following, the Hamiltonian can be assumed traceless without loss of generality. Note that whileŨ ∈ U(2 n ), then U ∈ SU(2 n ). In the following, only H and U symbols will be used as equivalent toH andŨ. H can be split in two parts-the local H l and the non-local H nl interactions: where (i4 k−1 ) n 4 is the number i4 k−1 represented in base-4 with n digits and (i4 k−1 ) n 4,s is its s th term in that basis.

SU(2) Decomposition Generalities
In order to support the understanding of some aspects in the further discussion, Appendix A.2 contains a brief of group theory that is relevant for this work as well as some critical points in the decomposition procedure being presented here. Delgado [11] found that the SU(2) decomposition procedure can be induced by considering a set of 2 n orthogonal states: {|α i } and 2 n−1 pairs {j(i), k(i)}, i = 1, 2, ..., 2 n−1 , with k(i) = j(i) + 1 ∈ {2, 4, ..., 2 n } related with the eigenvalues through a mixing matrix, in such way that they fulfill: Thus, H can be written as a sum of operators acting on the different subspaces H 2 i or as the following direct sum structure of 2 n−1 2 × 2 block-diagonal matrices: with 0, the 2 × 2 zero matrix. Because this structure is preserved under matrix products, it is inherited by the evolution matrix U. In particular, if the Hamiltonian (1) is not time-dependent, Similarly, in matrix form or in terms of I i , X i , Y i , and Z i : Note that the election of Γ i lets us simplify the last expression to contain only one operator between X i and Y i (as in [11,12]). This property is useful to set the optimal control in [9] in each block. Then, similar to H: where in general for the time-dependent Hamiltonian: where τ is the time-ordered integral. This implies that U is an element in the direct product U(1) 2 n−1 −1 × SU(2) 2 n−1 ⊂ SU(2 n ) (because any factor phase e −i∆ + i t depends on the remaining phase factors through E , see Appendix A.2). In the following, we will informally call this factorization the SU(2) decomposition (in reality, each block has the form U(1) × SU(2)) due to the block structure. Consequently, the Hilbert space H n becomes the direct sum of 2 n−1 subspaces generated by each pair { α j(i) , α k(i) }, i = 1, 2, . . . , 2 n−1 . In each subspace, dynamics mixes the probabilities, but probabilities among subspaces remain unmixed if there is no rearrangement in the pairing between {|b i } and { α j } (clearly, in this rearrangement, the basis { α j } could change).
, then each component is evolved in the subspace i = 1, 2, ..., 2 n−1 , fulfilling |ψ t i = S U 0 i |ψ 0 i = |ψ 0 i . Finally, note that the SU(2) decomposition is not the only one available, although it is the most valuable for the binary inheritance from the classical computation. In fact, other decompositions involving bigger subgroups are possible, whether using bigger systems than two-level ones and/or simply involving more than two eigenvectors in (5). Inclusively, a mixed-sized block structure can be realized.

GBS: A Non-Local Basis Fitting in { α j }
Non-local bases are used as a theoretical resource to explicitly show how evolution [16] and measurement [17] can generate entangled states. In [11], it was shown that the Heisenberg-Ising model including driven magnetic fields in a fixed direction allows the generation of the block structure in the traditional Bell basis. Thus, the Bell basis for two-level bipartite systems has been shown to fit in the U(1) × SU(2) 2 decomposition of SU (4). Despite the added complexity to manage non-local states, recent work has moved towards the control of entangled states [18]. This basis works as a universal basis for the Heisenberg-Ising interaction, including an external magnetic field in any specific direction on a couple of qubits [11][12][13]. This model includes other interaction models, such as XXX [19], XY [20], and XXZ [21]. In the current development, the most obvious guess is the generalized Bell states (GBS) basis for n = 2d presented in [22] as tensor products of Bell states. In the next sections, some further useful formulas are obtained to show how the GBS basis fits in the SU(2) decomposition for larger systems than bipartite ones.

GBS Basis and Hamiltonian Components
For n = 2d, the GBS basis [22] forms an orthogonal basis of partial entangled states for 2d particles. A more extended treatment for this basis is given in Appendix A.3 in order to ease further understanding in the current context, particularly related with the underlying single Bell states in their construction together with their index notation-a key aspect in the remaining development. Each element in this basis can be written briefly as: In the following, for simplicity, we use I d b and I interchangeably because the base b can normally be inferred from the context. Each element in this basis is not maximally entangled. Instead, they have maximally entangled bipartite subsystems (see Appendix A.3), which are separable from the remaining system. Separable pairs contain the parts [s, s + d], s = 1, 2, ..., d (in the following, square brackets will be used to point out a subsystem of parts in the whole system).
In order for { Ψ I d 4 } (I ∈ {0, 1, . . . , 4 d − 1}) to reach the kind of sets { α j } stated in the previous section where H and U achieve the SU(2) block structure, H should fulfill some restrictions. We are interested in setting these in the current subsections. Combining expressions (1) and (16), we can express the components of H in the GBS basis. First, we note [23]: (σ ks ) γs,φs s |σ js |γ s δ s |σ j s+d |φ s where combined subscripts as E d 2 D d 2 represent the set of subscripts obtained by merging { 1 . . . d } and {δ 1 . . . δ d }. Therefore, the final and notable expression for the Hamiltonian components becomes [23]: where J ∈ {0, 1, . . . , 4 2d − 1} (here, J = 0 can be removed in spite of the discussion in the first section).
In the last expressions, the productσ * i s σ j d+sσ T k s σ T j s has some properties inherited from Pauli matrices. Because σ 1 , σ 2 , σ 3 are traceless and σ T i = ±σ i (negative sign only if i = 2), then Tr(σ * i s σ j d+sσ T k s σ T j s ) is non-zero only if i s , j d+s , k s , j s are: (a) completely different between them; or (b) equal by pairs.
A remark is convenient at this point. In some works (e.g., [22]), GBS are preferred to be defined usingσ i = σ i for i = 0, 1, 3 andσ 2 = iσ 2 because it allows real coefficients when they are expressed in the computational basis |0 , |1 (alternative definitions introduce specific phase factors inσ i ). We adopt the last definition in the following, which does not produce changes in the previous discussion. Note thatσ i * = σ T i = σ i . The last expression should be fitted to (11), in particular with the non-diagonal block entries. In the following sections, we will show that the GBS basis naturally generates the SU(2) decomposition if the Hamiltonian fulfills certain restrictions. The use of the GBS basis allows the management of this analysis because it is based on Pauli matrices.

Case d = 1
For d = 1 there are three possibilities to arrange the pairs in the corresponding GBS basis (reduced in this case to the traditional Bell states: {|β 00 , |β 01 , |β 10 , |β 11 }). A direct but large analysis shows that by fitting (18) to (11), the Hamiltonian should be reduced to the forms shown in Table 1 (assuming always h 0 2d 4 = 0 and H 0 = ∑ 3 j=1 h jj σ j ⊗ σ j ). The first column shows the pairs arrangement to construct the blocks. These results generalize those found in [11,12] for the anisotropic Heisenberg-Ising model reached if the crossed interaction terms such as h ij σ i ⊗ σ j with i, j = 1, 2, 3; i = j are not present. These terms are similar to the Dzyaloshinskii-Moriya model [24,25], opening additional possibilities for control in the pair exchange. Case d = 1 is special in the current context because for d > 1 crossed terms can be present only for a unique pair in order to keep the SU(2) decomposition.
Although the eigenvalues {E j } do not follow a specific order, expressions in (18) can be arranged in several orders as functions of the pairs selected { α j(i) , α k(i) }, being related with the decomposition process. In general, there are (2 2d )!

Case d > 1
The exponential growth of the problem with d makes an exhaustive analysis for d > 1 based on a large algebraic equation system impossible, as in the previous case. The previous case and the results in [11,12] suggest some possible Hamiltonians for more complex cases. Thus, some of the following forms (see Appendix A.1) could allow the SU(2) decomposition for the basis (16): where (i4 k−1 ) 2d 4 is the base-4 representation with 2d digits of i4 k−1 , a number with only one i in position k and zero in the other; (i4 k−1 ) 2d 4,s is its element s; and (j 4 2d −1 3 ) 2d 4 is the base-4 representation with 2d digits of j 4 2d −1 3 , a number with j in each digit position (by using the geometric partial sums properties). Note that i ∈ {1, 2, 3} is fixed in all expressions. Physically, H 0 represents a full simultaneous interaction between all particles (as in the bipartite Heisenberg-Ising anisotropic interaction). Although this kind of interaction is non-physical for d > 1, it is included here for reference. H nl i represents the interaction between the component i of the spin for pairs of particles as in the Heisenberg-Ising model. H cnl i is the crossed non-local interactions by pairs in the direction i (as those for d = 1 in Table 1), a label used to characterize these interactions (as in the Dzyaloshinskii-Moriya model). Note that i, j p , k p is a permutation of 1, 2, 3 with parity p = 0, 1, even and odd, respectively. Finally, H l i is the component i of the local interactions with h (i4 k−1 ) 2d 4 as strengths (e.g., magnetic fields in the direction i for magnetic systems). These cases generalize the bipartite models presented in [11,12] and those found for d = 1.
Some observations are useful at this point: , ±2, ±2i}. We do not provide extensive formulas for the coefficients α i , β i , γ i,j , c i s ,k s j s ,j d+s , but they are trivially constructed departing from the Pauli matrices properties.
At this point, a convenient definition is introduced for the following cases. We will say that two particles or parts, i, j, are correspondents if j = i + d, with i, j − d ∈ {1, 2, ..., d}. This means simply that one is in the same position of the first group of the Hamiltonian subscripts 1, 2, ..., d as the other is in the second group d + 1, d + 2, ..., 2d. Then, the analysis of Ψ I d for j = 1, 2, 3, but each with diverse signs. Despite the similitude of H 0 with the bipartite case (d = 1), for multipartite cases this interaction is non-physical, but it allows the main idea to be introduced and understood in the remaining analysis.

Analysis of
The treatment for the remaining cases is compressed in the explanation of the current case. By first considering only an isolated term H Case A is depicted in Figure 1 for indexes I, K being considered in There is a pair of entries whose labels for rows and columns have 0 or i in the position s = k: ((i 1 , i 2 , . . . , i, . . . , i d ), (i 1 , i 2 , . . . , 0, . . . , i d )) and ((i 1 , i 2 , . . . , 0, . . . , i d ), (i 1 , i 2 , . . . , i, . . . , i d )). This will be named the 0 ↔ i association (or index exchange) rule. Case B is depicted in Figure 2. Here, there is a pair of entries whose labels for rows and columns have i or i in the position s = k: ((i 1 , i 2 , . . . , i , . . . , i d ), (i 1 , i 2 , . . . , i , . . . , i d )) and ((i 1 , i 2 , . . . , i , . . . , i d ), (i 1 , i 2 , . . . , i , . . . , i d )), i, i , i being a permutation of 1, 2, 3. This will be named the i ↔ i association (or index exchange) rule.
Clearly, in each case (A or B), for each pair of correspondent interaction terms with i and k fixed (k ≤ d and k + d positions), there are only two pairs on non-zero entries in rows (i 1 , i 2 , . . . , i, . . . , i d ), (i 1 , i 2 , . . . , 0, . . . , i d ) for case A and in rows (i 1 , i 2 , . . . , i , . . . , i d ), ((i 1 , i 2 , . . . , i , . . . , i d )) for case B (with the corresponding column labels exchanged in both cases). Together with the diagonal entries generated by other adequate Hamiltonians (e.g., H 0 or H nl i as it will be seen), they will form 2 × 2 blocks. In fact, each non-zero entry for H l i will have only two h J terms corresponding with h 0,0...0,i,0,...,0 with i in positions s or d + s (meaning local interaction with each element of the pair of correspondent parts in position k). Noting that labels in the position s = k in I (row) and K (column) for the non-zero entries are 0, i; i, 0; i , i ; or i , i , they cover all possibilities i k = 0, 1, 2, 3. Thus, for a fixed column and , there is exactly one non-zero row. Still, if two correspondent k elements are considered (local interactions on each element of a correspondent pair), they still generate only one non-zero row (each one with the two terms explained before). Although there are 2d possibilities to select the position s = k in (22), they do not count as separate blocks because they appear in other entries in (18). Instead, each term in non-correspondent terms will appear in a different non-zero row, giving d non-zero rows as total. For each i direction of the interaction being included, additional non-zero rows will appear. This implies that 3d rows could appear when all parts have local interactions in the three spatial directions at time, destroying in this case the 2 × 2 block structure. Thus, maintaining local interactions in only one direction and on only one correspondent pair of elements, together, cases A and B form 1 2 4 d 2 × 2 blocks as was required in the previous section. In any case, each non-zero entry will have the same 2 terms h (i4 k−1 ) 2d 4 with different signs depending on c i s ,k s j s ,j d+s involved in each factor of H (k) l i . Clearly, blocks can be rearranged to adequately order the GBS basis elements getting the form (11). A brief analysis shows that there are no more diagonal-off elements in addition to last cases being generated by local terms. Additional diagonal-off elements come from the non-local terms, such as those in Table 1.
With the correspondent parts definition and the analysis for H l i , we can identify two cases for the different terms H (k,k ) nl i : (a) non-local interactions between correspondent parts; and (b) non-local interactions between non-correspondent parts. The discussion is similar to the previous subsection.

Correspondent terms H
in agreement with (18), it does not cancel if each factor in the product become different from zero, implying i s = k s ∀s = 1, 2, ..., d. Thus, this term gives non-zero entries only in the diagonal elements. Thus, each non-zero entry of H nl i will have d different terms in each diagonal element (one for each pair of interacting correspondent particles). Those terms will appear with different signs in each diagonal element in spite of c i s ,k s j s ,j d+s . At this point, note that results for H (k,k+d) nl i and H (k) l i were expected due to the results in [11,26] and the separability of the GBS basis in their constitutive entangled pairs.

Non-correspondent terms H
(k,k =k+d) nl i . These terms have a different behavior. Each term contains Then, each factor in (18) related with those two pairs (s = k, k or s = k, k − d) will now include Tr(σ i s σ i σ k s ) (until unitary factors), which is non-zero only if: (a) i s or k s are one of the pairs 0 and i or i and 0; (b) i, i s , k s are a permutation i, i , i of 1, 2, 3 (having two cases depending on the parity). The last situation is similar to the local terms in the previous subsection, but in two parts simultaneously. The remaining factors for s = k, k or s = k, k − d will require i s = k s in order to become non-zero. The latter scenario gives 16 possibilities for each term h (i(4 k−1 +4 k −1 )) 2d 4 , which will appear in diagonal-off positions obtained departing from the diagonal position (i 1 , ..., , by changing each index in the pair (i k , i k ) in the row, following the rules depicted in cases A and B. Thus, for each column and with i, k, k fixed, only one row becomes non-zero, in agreement with the previous rule. Each entry of this kind involves four terms, including the four combinations of each pair of non-correspondent parts selected from the set [k, k , k + d, k + d]. Instead, when all values i and k, k are considered, a total of 3 · 1 2 d(d − 1) non-zero rows appear in each column (clearly, by considering all these terms, SU(2) decomposition is not achieved).

Analysis of
. Because only one correspondent pair has j p = j s = 0 = j d+s = k p in (18), then i s , k s for s = k should be 0, i or j p , k p . For s = k , i s = k s . As before, it means that each term is diagonal-off by combining the values of index k in I and K as before: 0, i; i, 0; j p , k p ; and k p , j p . For a fixed column and i, k, it will give four possibilities and two SU(2) blocks. Each entry will have two terms corresponding to the different parities p. Note that only one i and k can be considered to achieve the SU(2) decomposition. Otherwise, for each column, 3d rows different from zero could appear, breaking the SU(2) decomposition as for the local interaction case.

Non-correspondent terms H
, in this case the only non-zero terms have i s = k s for s = k, k , k − d, k − d. Meanwhile, for the two remaining cases s ∈ {k, k , k − d, k − d} ∩ {1, 2, . . . , d}, each i s , k s should be selected from the set 0, j p ; j p , 0; i, k p ; k p , i or 0, k p ; k p , 0; i, j p ; j p , i. In a specific column and fixing i, it will give 16 possibilities and 8 blocks in SU(2), as for the H (k,k =k+d) nl i case. Note that parity p should be fixed in this case because each one gives a different decomposition. Each entry will contain four terms for each parity p combining the four possible interaction terms. Again, if all options for i and k, k , p are considered, then 3 · d(d − 1) non-zero rows will appear for each column, breaking the SU(2) decomposition. These terms are not commonly introduced in models such as Heisenberg-Ising and those related. Instead, for magnetic systems they are the first-order approximation in the spin-orbit coupling, introducing antisymmetric exchange as in the Dzyaloshinskii-Moriya model: − → D is the Dzyaloshinskii-Moriya vector defining the orientation of coupling. Here, as only one term can be included in order to preserve the SU(2) reduction property, this coupling should be strictly oriented.

Explicit Analytical Formulas for Hamiltonian Components
After the last analysis, it is clear that other candidates to generate SU(2) decomposition are possible, but they involve more than two parts at a time (as in the case of H 0 ), which are non-physical for common point-like interactions. Nevertheless, these terms could appear for the quantum mechanical extended objects in which (1) is a mere expansion of the interactions. Therefore, we will restrict our remaining discussion to local or pairwise interactions. In this section, analytical are provided to summarize the previous findings and because of their utility for optimal computer simulation purposes for larger systems. In order to simplify the expressions, we introduce the definition of the following generalized Kronecker delta: where S is a set of scripts of the excluded parts in the product. Thus, for H l i : by noting c i s ,i s 0,0 = 1. In H k is the correspondent pair where each local interaction is being applied. There, the exchange factor generating the diagonal-off entries in the SU(2) blocks is: For H nl i : with : H c,k Each term belongs to correspondent and non-correspondent interactions, respectively. In H c,k with : H c,k Again, H c,k An important property used later for F j s ,j d+s i,k is that only one term in (25) remains with the election of i k and k k . Because each c j s ,j d+s j,k is real or imaginary, and more concretely as a brief analysis shows, if it is not zero, then it becomes imaginary only if j s or j d+s is equal to 2, this property is transferred to F j s ,j d+s i,k .

Specific Interactions Generating SU(2) Decomposition
In this section, we summarize and organize the global findings to reach the SU(2) block structure on the GBS basis. Finally, we conclude that there are three great types of interactions that are able to generate the block structure depicted in Section 3.

General Depiction of Interactions Having SU(2) Decomposition for the GBS Basis
Based on the previous discussion, there are three groups of interactions that are able to generate the SU(2) decomposition on the GBS basis. The first one (Type I) involves all kinds of non-local and non-crossed interactions between any two correspondent parts in any direction. These terms generate the diagonal terms depicted previously in the Hamiltonian. Together, only two local interactions in only one specific direction and on only one pair of correspondent parts, k l , should be included to generate the diagonal-off entries. Thus, this group of interactions generates the SU(2) blocks. Note that local interaction terms could be intended as external driven fields as in [11,26]. The second interaction (Type II) is obtained by substituting the previous local interactions with non-local interactions among only those non-correspondent elements included in two pairs of correspondent parts. This means that if k, k , k + d, k + d with k < k ≤ d are these elements in the two correspondent parts, then only the interactions between the following non-correspondent elements are allowed: This group of four interactions generates the diagonal-off terms to conform the SU(2) blocks. Nevertheless, the Type II interaction should normally be understood as a non-driven process of control. Note that Type II interaction could be classified into two other subclasses: (a) Type IIa for non-crossed interactions H nc,k k . Finally, the third interaction (Type III) involves both the non-local and non-crossed interactions, with the inclusion of crossed interactions between one specific correspondent pair.
In order to clarify the structure of those notable interaction architectures as special cases of Hamiltonian (1), we make some remarks as follows. Figure 3 summarizes the three types of interactions depicted above by listing the 2d qubits involved and then relating them with arrows in agreement with their mutual interactions. Then:

A:
Curved arrows point out those qubits related through entangling operations in any case. B: All curved arrows in the bottom refer to Heisenberg-Ising-like (non-crossed) interactions involving the three possible spatial directions together. Those interaction relations set the correspondent pairs. C: For the curved arrows in the top, two kinds of entangling operations can be considered according to the text: Heisenberg-Ising-like (non-crossed) interactions or Dzyaloshinskii-Moriya-like (crossed) interactions. Only one characteristic spatial direction is allowed. D: Type II interactions can be split into Type IIa and Type IIb if interactions in the top are non-crossed or crossed (between parts of two different correspondent pairs), respectively. Type IIb interactions in the top admits only one possible parity from the two possible. E: Type III interactions admit only crossed interactions in the top between parts of one specific correspondent pair, but the two possible parities together are allowed. F: For Figure 3a, the right arrows correspond to external local interactions such as those generated by magnetic fields on spin-based qubits. Due to their locality, they are referred to as driven interactions, although it actually depends on the available control of the interactions.  In particular, note that this description is in agreement with the results in Table 1 for d = 1, although it is a special case because diagonal-off entries for Type I, II, and III coincide in the same diagonal-off entries, so both interactions could be combined at the same time, preserving the SU(2) decomposition. This case has a richer structure for control in terms of the number of free parameters involved with respect to the number of parts to be controlled. Note that while Types I and III are only able to modify the inner entanglement of the correspondent pairs, Type II interaction (Type IIa and IIb) allows the modification of the global entanglement between different correspondent pairs, thus letting it spread on the entire system by switching the pairs involving interactions generating diagonal-off entries.

General Structure of SU(2) Blocks
A complementary analysis of SU(2) blocks obtained for the last interactions is given in this subsection. Their form is particularly useful as a connection with optimal control schemes, such as those presented in [9]. In any case (Type I, II, or III), each block S H I,I (with I, I the rows in which is situated) has the form: where {I I,I , X I,I , Y I,I , Z I,I } is the Pauli basis for the SU(2) block. If the Hamiltonian coefficients involved in the block are time-independent, then the corresponding S U I,I block in the evolution matrix becomes: clearly belonging to U(1) × SU(2) (see Appendix A.2). As stated previously, F j s ,j d+s j,k is imaginary only if j s or j d+s is 2. Thus, only one component from n 1 or n 2 is different from zero because non-diagonal entries of block in (24), (26), and (27) are always real or imaginary. This reduces the optimal control to the second case reported by [9]. An additional analysis shows that h 11 ± h 22 = 0 in general (without imposing restrictions on the non-local strengths h J ). This aspect will be relevant later.

Structure of SU(2) Blocks for Each Interaction
Several classical interactions fitting in the current procedure were analyzed. All them generate blocks (not necessarily SU(2) blocks) when they are expressed in the GBS basis, denoting a kind of universality for this basis due to its ability to gather similar interactions through simplified representations. For the sake of the search for SU(2) decomposition, we discuss finally closed forms for the specific Hamiltonians able to achieve the SU(2) decomposition. These formulas are quite useful for computer simulation purposes.

Blocks in Type I Interaction
This interaction includes non-crossed spin interactions between correspondent particles in all spatial directions and external local interactions on the pair [k , k + d] of correspondent particles in direction j. From (24)-(26), it can be written as: generating SU(2) blocks with the diagonal terms from non-local interactions between correspondent parts and the non-diagonal terms from local interactions. Departing from (24)-(26), we obtain for the Hamiltonian components: The last formula is obtained noting that c . The first term of the last expressions denotes the diagonal terms of interaction. This formula shows that the pair of entries in the diagonal of each SU(2) block are generally different. Because the block is formed by switching an index i k in the row labels (or two as in the following cases) in agreement with the association rules 0 ↔ j or i ↔ k (j is the direction associated to the interaction and i, j, k a permutation of 1, 2, 3), then for i = j the terms in H D IK have a sign change. This implies that in general h 11 = h 22 in (28) Note that this interaction (when it is applied to a combination of correspondent pairs with bipartite entangled states) generates only non-local operations on each correspondent pair, such as those presented in [11,13]. Still switching the direction j and the correspondent pair k on which the local interaction is applied, this kind of Hamiltonian cannot generate extended entanglement between correspondent pairs more than that included in the initial state. This means that if the initial state is separable by correspondent pairs, it will remain separable at this level (but should be able to entangle or untangle the parts of each pair). Conversely, it cannot disentangle each correspondent pair from the remaining state in more complex cases. We dedicate a later section to analyzing these topics.

Blocks in Type II Interaction
Type IIa: In this case, the interaction is completely non-local between correspondent pairs to generate the diagonal entries, and in only one direction between non-correspondent parts in two correspondent pairs to generate the diagonal-off entries. The Hamiltonian becomes: with :H (j,k k ) with a non-local and non-crossed interaction in the direction j for the group of non-correspondent terms defined by k < k ≤ d. The Hamiltonian entries are similar to those in (24)- (26), but with the last restriction for the non-correspondent terms of interaction. Due to discussion in the previous subsection, diagonal-off entries in the Hamiltonian are now always real. The components become: Type IIb: For this interaction, the non-diagonal part generated by the non-local interaction between non-correspondent parts is supplied by a non-local and crossed interaction among non-correspondent parts of two correspondent pairs: As before, i, j p , k p is a permutation of 1, 2, 3 with parity p = 0, 1 (even and odd, respectively). Thus, the components become: The non-diagonal entries are now imaginary, except for i = 2.

Blocks in Type III Interaction
Finally, for Type III interaction, the non-diagonal part is generated by the non-local and crossed interaction between a pair of correspondent parts k : with the Hamiltonian components: where non-diagonal entries are imaginary only if i = 2. Figure 4b shows a distributed evolution on 2 2d−1 Bloch spheres for the states . These labels will be omitted by simplicity unless their specification becomes needed. In any case, closed expressions (31), (33), (35), and (37) are computationally efficient to generate matrix representations of Hamiltonians H I , H I Ia,b , H I I I , and for their respective U, inclusively in the time-dependent case, although a numerical approach to construct could also be necessary.

Available Parameters and Structure of Entries
The number of free parameters (coefficients h I of Hamiltonian) and their availability are important to set control procedures. In this section, we count the entries and terms for each Hamiltonian, summarizing the previous findings. If D ≤ 3 is the number of spatial dimensions involved in each interaction, then the accounting of free parameters generating the SU(2) decomposition, together with the maximum number of entries by column able to generate it (breaking the SU(2) decomposition) is reported in Table 2. Note that the number of entries by column for all Hamiltonians (labeled with i, in some sense the direction of the interaction) can be increased by a factor D if all directions are considered at time. In the table, each Hamiltonian analyzed is reported, arriving at the main Hamiltonians H I , H I Ia,b , and H I I I . Accounting shows few free parameters at time (compared with the exponential growth of the matrix with the system size d) to set a whole control (over all blocks) in one period of constant driven parameters, suggesting the use of time-dependent or at least constant-piecewise parameters to increase the control. Table 2. Rows generated and free parameters in each interaction considered in the text. ) terms in the scripts labels, in agreement with the rules depicted in Figures 1 and 2. This implies that there will be two or eight blocks, each one relating rows (and columns) differing in only one or two terms of their scripts, respectively. Note the diagonal entries for H c,s nl j in (18) for the GBS defined as in [22]: Tr(σ * i s σ jσ T i s σ T j ) = 2(−1) δ j,2 +(1−δ j,is )(1−δ 0,is ) . Then, for each three strengths for a fixed correspondent pair, there will be only four sign combinations (none is the negative of another) depending on: (a) the direction of the interaction involved (on the correspondent pair s) is j = 2 or j = 2; and (b) i s for the s th script is in the set {0, j} or in {i, k} (with i, j, k a permutation of 1, 2, 3). There, the factors corresponding to other correspondent pairs will be equal to one. Then, for the 3d terms included in all diagonal entries there will be 4 d combinations for the whole terms-precisely the number of rows. This implies that all diagonal entries are different (but not independent because there are only 3d parameters). For two rows differing in only one or two terms in their scripts, only the three or six terms corresponding with the strengths of H c,s nl j for such correspondent pairs (associated with those terms in the scripts) will change their signs in the diagonal terms in their block. Consequently, for such 4 d−1 or 4 d−2 groups of blocks having the same scripts exchanged and generated by the whole combinations in the other d − 1 or d − 2 terms in their scripts, they will have the same h 11 − h 22 parameters, respectively. Thus, it will be only two or eight different h 11 − h 22 parameters for the entire H. Meanwhile, h 11 + h 22 parameters could be different.

Structure of Diagonal-Off Entries Belonging to a Specific Block
The second aspect is related to the explicit calculation of c i s ,k s j s ,j d+s for the basic cases of interest in the diagonal-off entries. (a) For H I and H I Ia,b : j s = j, j d+s = 0, or j s = 0, j d+s = j (j being the direction label involved in the local and non-local interactions between non-correspondent parts); and (b) for H I I I : j s = j p , j d+s = k p . Table 3 explicitly shows these values. Note the parallelism between their two halves (vertically and horizontally).
These cases generate the diagonal-off entries in each block in agreement with the exchange rules depicted previously for the s th scripts of such entries' rows: (i s , k s ) ∈ {(0, j), (j, 0); (i, k), (k, i)}, with i, j, k a permutation from 1, 2, 3 and j the associated direction for the corresponding interaction being used from H I and H I I a,b ; (i s , k s ) ∈ {(j p , k p ), (k p , j p ); (0, i), (i, 0)}, with i, j p , k p a permutation of parity p from 1, 2, 3 and j p , k p are the associated directions for the interaction H I I I .
First, we should note that the signs for each term in the diagonal-off entries do not depend on the entries' scripts in positions other than the parts in which the interaction is being applied, k , k in the expressions of the previous section (30), (32), (34), and (36). This is because Tr(σ * i s σ j d+sσ T k s σ T j s ) = Tr(σ * i s σ 0σ T k s σ T 0 ) = 2 . Instead, signs only depend on the type of exchange indexes shown in Table 3. It has already been noted that c i s ,k s j s ,j d+s is imaginary only if j s = 2 or j d+s = 2. This property is then transferred to the corresponding F j s ,j d+s j,s , and then transformed to h 12 as a function of the number of those factors in (31), (33), (35), and (37). Thus, by exchanging i s , k s (block transposing), only the cases with h 12 ∈ I will change their sign.
The final fact is related with the different signs appearing in the terms of diagonal-off entries. This will be important to analyze the number of independent blocks in the entire evolution matrix. For H I and H I I I , the two different terms are obtained by the exchange of j s , j d+s . Thus, for H I , only the c i s ,k s j s ,j d+s with (j s , j s+d ) = (0, 2), (2, 0) and (i s , k s ) ∈ {(0, 2), (2, 0)} or (j s , j s+d ) = (0, j = 2), (j = 2, 0) and (i s , k s ) ∈ {(i, k), (k, i)} will change their sign (in the first four rows of Table 3). For H I I I , if (j s , j s+d ) = (1, 3), (3, 1) and (i s , k s ) ∈ {(0, 2), (2, 0)} or (j s , j s+d ) = (0, 2), (2, 0) and (i s , k s ) ∈ {(i, k), (k, i)}, then c i s ,k s j s ,j d+s will change their sign (in the last four rows of Table 3). For H I Ia,b , two terms in the scripts are involved, so different aspects contribute: the location of interacting parts, the type of exchange, and their order in the scripts.
Last properties exhibits the way in which each term in h 12 will change its sign. The three aspects mentioned in the previous paragraph allow us to understand the diagonal-off structure of H I , H I Ia,b , and H I I I (considering that their diagonal components follow the properties discussed above). In the following subsections, we analyze this structure for each interaction, particularly discussing the independence of blocks in terms of the free parameters, making a distinction between the effective parameters (those appearing in the final expression of (28)) and the physical parameters (those appearing as coefficients h I in the Hamiltonian). They are not the same because many physical parameters appear clustered in the same way in (28), because the entries of S U depend only on the parameters h 11 ± h 22 , h 12 . As a result, by grouping finally in the U(1) × SU(2) blocks, there will be only two or eight different blocks S U in U.

Block Entries of H I
The diagonal-off entries have exactly the two terms h (j4 s+dt−1 ) 2d 4 for t = 0, 1, and there are only two combinations: adding or subtracting terms. As was stated previously, they are imaginary only if local interactions are in the direction j = 2. In this case, we separate the factor ±i for j = 2 cases in the diagonal-off entries, and the remaining coefficients in the opposite corners in each block are equal as expected from (28). Then, there is generally one term with the same sign through all diagonal-off entries (when k = 2, or otherwise when j s = 2 in the first four rows in the Table 3), leaving only two possibilities for the remaining term. Thus, in each H I matrix there are blocks with only two different diagonal-off entries, depending only on the index exchange type in the local interaction position and not on the remaining indexes. Thus, for a fixed set of indexes for the positions unrelated to the part on which the interaction is applied, a pair of blocks exists, one each for the exchanges (0, j), (j, 0) and (i, k), (k, i), with different relative signs in their diagonal-off terms. For the corresponding diagonal entries, in (29), only the difference h 11 − h 22 is relevant. As previously stated by analyzing equation (31), it is also possible realize that in each diagonal entry there are only two terms from the 3d terms changing their sign with respect to other rows. Block scripts differ in only one index, those corresponding with i = j (the local interaction direction) and k = k (the correspondent pair on which the local interaction is being applied), leaving only two terms and two different combinations for h 11 − h 22 . This implies that there are only two different blocks for (29) through all U, each one operating with different exchange rules, (0, j), (j, 0) or (i, k), (k, i). Each one is the same (until unitary factors, which can be different) for all entries with different indexes in positions other than k . This fact can be attributed, depending on the number of disposable parameters (five, including the time and excluding the parameters in the unitary factor of each block), to the independence between the two types of blocks in the evolution matrix (29).

Block Entries of H I Ia
For the non-diagonal entries, because the exchange factor F j s ,j d+s j,s appears two times for each j, all of them are real, so the opposite corners of each block are always equal. Each entry has four terms with alternating signs, in agreement with the Table 3, as a function of the rows' subscripts. Signs only depend on both indexes exchanged: either they are the same type (0, j), (j, 0) or (i, k), (k, i), or otherwise opposite with an exchange of each type. This will give only four sign combinations (a calculation not developed explicitly here), except for j = 2, where the appearance of two factors i will change the overall factor, giving eight combinations, one half of them with opposite overall sign to the remaining. For the diagonal entries, based on the ideas in the previous case for H I , there will be four terms changing their relative signs with respect to other associated diagonal entries in the same block, but now differing in two part indexes (due to the related non-local interaction). As before, one term has a fixed sign, so there are only eight combinations for the three remaining terms from the 16 possible. This means eight different combinations for h 11 − h 22 in (29), due to the values k = k , k for the non-correspondent parts with non-local interactions in H D for this case. Thus, similar to H I , in this case there will be eight different blocks in U for (29): one for each one of the eight different combinations of the exchange rules. Each type applies in the same way for all entries with different indexes in positions other than k , k . There are nine free parameters, including the time and excluding the parameters in the unitary factor for the block, so independence among the eight types of blocks can be more elusive. Despite all this, located operations not involving all GBS basis states appear as achievable.

Block Entries of H I Ib
Although the exchange factors F j s ,j d+s j,s are crossed and j takes two different values in the subscripts, the discussion regards certain similitude to that for H I Ia . For the diagonal-off entries, in agreement with Table 3, it implies that only if j = 2 is not included in the crossed interaction (i = 2 in (35)) will they become real. Each entry will have four terms with alternating signs, in agreement with the outcomes of products of exchange factors in Table 3 as a function of the rows' subscript involved. Here, there will be eight combinations (four and four with opposite overall signs), except for j = 2 with only four combinations. For the diagonal entries, h 11 − h 22 in (29), the situation is identical to H I Ia . Then, there will be eight different block types in U for each combination of exchange rules on the indexes k , k . Again, nine free parameters for the SU(2) blocks are available.

Block Entries of H I I I
This is a special case exception of the previous remark where j s , j d+s is not of the forms 0, j or j, 0. Nevertheless, F j p ,k p i,s becomes in the same way on of c 0,i j p ,k p , c i,0 j p ,k p , c j p ,k p j p ,k p , or c k p ,j p j p ,k p . However, several aspects are identical to the H I case. A brief analysis shows that entries become real only for i = 2 (see the last four rows of Table 3). Each diagonal-off entry has two terms with alternating signs as functions of entry labels. For the diagonal entries, again only two types of terms change their sign in H D from (31) for the rows forming the SU(2) blocks with the exchange rules. This gives only two types of h 11 − h 22 in (29), again generating only two different blocks in the whole U-each one for a kind of exchange rule involved here, containing five free parameters.
To resume the findings, Figure 5 shows the relations exhibited in the exchange indexes for each interaction. This figure depicts each of the exchange index relations of GBS basis states under the interaction. Thus, Figure 5a,d, depicts the two groups of exchange states for H I and H I I I generated by the two different blocks through the whole SU(2 2d ) evolution matrix, both independent up to five parameters and with h 12 in (29). Figure 5b,c depict the double exchange indexes induced by the eight blocks generated by H I Ia and H I Ib . These eight blocks are independent up to nine parameters. All representations in Figure 5 are for a single GBS basis state, but clearly one specific block is operating on any of them simultaneously. Note finally that for all cases there are a complementary number of free physical parameters in h 11 + h 22 : 3d + 2 − 4 = 3d − 2 for H I and H I I I and 3d + 4 − 8 = 3d − 4 for H I Ia and H I Ib (time t is not accounted because it was considered in the SU(2) fitting). Then, there is a linearly growing space to fit the blocks into a programmed operation in terms of the physical parameters, although there is an exponential growth of those blocks.

Connectedness, Superposition, Entanglement and Separability
To understand how dynamics is addressed under the interactions H I , H I Ia,b , H I I I (used independently or combined), some complementary analysis is convenient. In order to prepare the reader, some illustrative examples are included in Appendix A.4 for d = 1 and d = 2, depicting some notable properties of dynamics in such cases by including several kinds of entangling operations.

Exchange Connectedness under Interactions
Under the SU(2) decomposition, pairs of states in GBS basis become related, showing a probability exchange between them. As it was seen, each one of the H I , H I Ia,b , H I I I interactions has rules for this exchange. In any case, it should be clear this exchange is achievable between any pair by combining all types of interactions obtained by switching the value of: (a) interaction direction and correspondent pair j, k in (31) for H I ; (b) interaction direction and correspondent pairs j, k , k in (33) for H I Ia ; (c) interaction directions, correspondent pairs, and parity i, k , k , p in (35) for H I Ib ; and (d) interaction direction and correspondent pair i, k in (37) for H I I I . Several types of interactions can be combined in a sequence. The combination of interactions is not precise for the basis element connectedness, but it is necessary to increase the entanglement, and thus to connect two arbitrary quantum states. In those terms, there are only two types of states: (1) those exchanging one script (H I and H I I I ), and (2) those exchanging two scripts (H I Ia and H I Ib ) in the GBS basis elements under the rules depicted in Figure 5 (although the rules and connections are different). All basis states become connected under one or several interactions applied consecutively, depending on the number of necessary exchanges in their scripts. Figure 6 shows a graph with these relations for the cases d = 1, 2, 3. Green edges indicate one script exchange and red lines indicate two script exchanges. The connection can only be achieved with a single interaction in the first two cases, due to the low entanglement level. Figure 6a corresponds to the figure presented in [11] for Bell states in SU(4) systems. Connectedness in a finite number of steps by applying some or all cases in each type of interaction (piecewise with constant parameters or with time-dependent parameters in each case) warrants the full probability exchange between the occupancy level of each state in terms of the discussion included in Section 3. Nevertheless, not all interactions are able to reach an arbitrary evolution. As is obvious, H I and H I I I are not able to generate extended entanglement out of the correspondent pair on which they operate (this assumes no rearrangements are made in the correspondent pairs and their elements). We discuss this aspect in the next subsection.

Notable Quantum Processing Operations Achievable under SU(2) Decomposition
Departing from S U , then by fixing ωt = 2n+1 2 π, h 11 −h 22 2hω = , h 12 hω = i c δ, h 11 +h 22 2hω = 2(m − 1 2 ); n, m ∈ Z, c ∈ {0, 1}, δ ∈ R, where 2 + δ 2 = 1 in (29). Note that the parameter c depends on each kind of interaction in the terms discussed in the previous section. Then, we get the S U I,I block [27]: operating on the GBS basis. Note that this form cannot always be achieved independently in all blocks in terms of the free parameters and the possible restriction h 0,0,...,0 = 0 (here det(H c m (δ, ) I,I ) = −1, although it is not decisive in the following development). Nevertheless, we need only achieve it in some blocks in the immediate discussion. We are using the time-independent case, but other more practical cases with time-dependent Hamiltonian coefficients can be implemented. The last form is highly versatile. If s | | = δ = 1 √ 2 (s = sign( ), referred in the notation as −, +), we get a Hadamard-like gate H m,c,sign( ) I,I ≡ S U I,I (in particular, if c = 0, but this condition can be relaxed). When δ = 1, we get an exchange-like gate [12,26] for the pair in the SU(2) block, E m,c I,I ≡ S U I,I . Note that this case is a limit case for the time-independent case (29) when h 12 h 11 − h 22 . Otherwise, it can be achieved in two steps of time-independent piecewise Hamiltonians (as in [12]) or as a continuous time-dependent Hamiltonian. These gates are: Note additionally that when h 11 +h 22 2hω = ( α m − 1)π, ωt = mπ; n, m ∈ Z, we get the quasi-identity gate S U I,I = e iαπ I I,I ≡ I α I,I . The combination of these blocks (allowed because the block independence previously discussed) allows important quantum processing operations to be set.

SU(2) Decomposition in the Context of n−Qubit Controlled Gates
Transformation between quantum states can generally be achieved by means of linear and anti-linear operators. Anti-linear operators are particularly useful to depict time-reversal operations or the action of some Einstein-Podolsky-Rosen channels. If these kinds of operations are being considered in the processing, an extension of the Hamiltonian (1) should be considered by the inclusion of anti-linear operations [28]. In this work, we have restricted our development to linear operators, as was settled in Sections 2 and 3.
Below of such context, it should be advised that SU(2) decomposition is compatible with the most quantum information developments in the literature. Nevertheless, many of those works do not consider that such proposed processing forms are rarely compatible with the dynamics of physical systems if the computational basis continues to be used (the natural basis based on physical properties of local systems such as spin and polarization). The nature of entangling operations naturally induces both superposition and entanglement, thus generating a complex dynamics evolution in such basis compared with the structured gates proposed in the quantum information developments (whose authors were clearly not always concerned with the underlying physics). SU(2) decomposition (mainly the part developed in the Sections 2 and 3) naturally proposes a better basis to set the quantum processing grammar for certain interaction architectures (e.g., those developed in Sections 4 and 5). The induced 2 × 2 block structure allows such processing structures to be set more easily, mainly based on binary processing.
In the context of quantum computation, the most common trend is the settlement of universal gates in the sense of a quantum Turing machine. A set of universal quantum gates for two-qubit processing was established by [29] as a set of local gates together with the CNot gate. Despite universality, this trend is not optimal because for a given processing, it is not clear how to express it in terms of those elements in the universal set. In an alternative trend, [30] has settled a more optimal gate decomposition by factorization in terms of P−unitary matrices. In the last two trends, SU(2) decomposition for SU(4) (d = 1, meaning two-qubit processing) has shown how to adapt those results for the physics of Heisenberg-Ising interactions including driven magnetic fields: (a) in [31], a set of alternative universal gates has been proposed on the grammar of Bell states; and (b) in [26], an optimal set of six gates (P−unitary matrices) is proposed using the forms of SU(2) decomposition on a Bell states basis to reproduce any other gate for two-quibit processing. In the current context, those outcomes are automatically applicable to Type I and III interactions. Type II interactions are excluded because they require at least d = 2. In any case, the contribution of the SU(2) reduction is in the proposal of Bell basis as a grammar instead of the computational one so that the physical evolution fulfills the forms required by the processing gates.
Although two-qubit processing is still universal, more powerful processing is possible by attaining more than two qubits at a time. In this approach, [32,33] have stated universal processing gates in terms of local rotations and n−qubits controlled gates. In the computational basis, rotations are obtained by local interactions by turning off the entangling operations, but controlled gates can be physically difficult to reproduce. In the SU(2) reduction scheme, the form of rotations in those works (R y (α) and R z (α)) are achieved by the forms (29) as follows. First, R y (α) is mainly achieved by settling h 11 = h 22 and h 12 ∈ I. R z (α) is obtained by fixing h 12 = 0. Notably, those rotations are not necessarily physical neither local, they could operate among entangled states. Instead, they can be determined as rotations on the informational states being used (elements of GBS basis). Other basic forms are also easily obtained, for example, Ph(δ) is obtained by settling cos ωt = ±1. For the controlled gates Λ n (U) proposed in [32], authors in [33] turn to a long factorization in terms of rotations and controlled gates Λ 1 (U) (which can also be obtained departing from the CNot gate and rotations). In any case, if a computational basis is used, the reproduction of the CNot gate can still bring certain difficulties in many quantum systems [34]. In the context of SU(2) reduction, CNot gate and inclusively Λ 1 (U) are directly obtained if the Bell basis is used as grammar: where U is a general matrix in SU(2) as in (29). Because of the independence of blocks stated in Section 5, the achievement of Λ 1 (U) is warranted. Then, the construction of Λ n (U) follows immediately as proposed in [32,33], but considering those forms working on the grammar basis of the Bell states or on the GBS basis in general. Clearly, in the SU(2) decomposition scheme, other controlled gates are achievable by the alternative selection of the elements on which interaction is being applied. If more optimal factorization methods are possible for d > 1 (where blocks are repeated by groups), based on the set of matrices U as in (14) by including all the possible forms generated by Type I, IIa, IIb, and III interactions, it is still an open question.

Generating Superposition and Entanglement
In the following, we will use an arrow to depict a certain group of quantum operations. On the top of the arrow, we set the type of interaction being used. On the bottom, we set the subspace on which they apply or the generic form of each operation, together with their prescriptions. For instance, if an operation for d = 4 (8 qubits and 256 elements in the GBS basis) generated by the Type IIa interaction is applied in the associated direction y and on the pairs 1 and 4 (j = 2, k = 2, k = 4 in (32)) with prescriptions for a Hadamard gate mixing the basis states |Ψ 0 = |Ψ 0,0,0,0 and |Ψ 130 = |Ψ 2,0,0,2 (i.e., H 0,0,+ 0,130 ) and an exchange gate between the basis states |Ψ 1 = |Ψ 1,0,0,0 and |Ψ 131 = |Ψ 3,0,0,2 (i.e., E 0,0 0,131 ), we will write: Although other operations can be defined between the remaining basis states, if they are not specified, it is because some operations are repeated for other certain groups of scripts (e.g., for |Ψ 20 = |Ψ 0,1,1,0 and |Ψ 150 = |Ψ 2,1,1,2 , H 0,0,+ is also being applied) or because the concrete operation being developed does not require such specification (e.g., there is no specification for the operation between |Ψ 67 = |Ψ 3,0,0,1 and |Ψ 193 = |Ψ 1,0,0,3 ). In some cases, complex families of subsequent operations are required, and then one family is specified by a group of indexes defining it.
where j −1 (i) is the inverse of j(i) and directions i = 1, 3 were used as examples. In addition, α k i,j are the components of S U s,s in the first operations, and β k j(i),i are the components of S U s,s , S U s ,s for the second operations with i = 0, 1, respectively. Figure 7 depicts each step of the process, using the local operations (alternatively, crossed interactions in H I I I could be considered).
The second case is for a pair of elements in the GBS basis differing in two subscripts of I and J : i s = j s ∀s = 1, . . . , d, s = k , k (in H I Ia,b interactions): Then, we analyze the entanglement of several subsystems in each case by taking the partial trace with respect to its complement. Calculations are direct. At the end, the association rules 0 ↔ i and j ↔ k should be applied to explicitly denote the viable relations between I and J , and to reduce some traces on parts k , k in (45) and (46). In Table 4 we report the generalized bipartite concurrence for pure states [36]: where, j is assumed as the direction label of the interaction involved. If m = min(m 1 , m 2 ), where m 1 , m 2 are the Hilbert space dimensions of each subsystem, then this measure changes smoothly from 0 for separable states to 2(m − 1)/m for maximally entangled states. Note that we takeσ i ≡ e iφ i σ i , although it is only relevant for σ 2 . With this distinction, we introduce φ = φ + φ i k − φ j k . Table 4. Bipartite concurrence C 2 (Tr S (ρ IJ )) for several subsystems in the SU(2) mixing of some pairs of GBS basis states.
3 2 − 1 2 sin 2 θ(cos 2 φ δ i k j k δ i k j k + sin 2 φ (1 − δ i k j k δ i k j k )) Table 4 includes some obvious results for "local" interactions on single parts (H I ) or on correspondent pairs (H I I I ): (a) any part is maximally entangled with respect to the remaining system (through its correspondent pair) if there are currently no active local or non-local crossed interactions in H I and H I I I , respectively, so C 2 (Tr S (ρ IJ )) = 1; (b) nevertheless, if these local or non-local crossed interactions act on the correspondent pair, each part of it can become separable or partially entangled to the remaining system; and (c) any correspondent pair (as a subsystem) is separable from the remaining system in any GBS basis state, so C 2 (Tr S (ρ IJ )) = 0. Note that in the cases (b) and (c) that the subsystem comprises two parts [k , k + d] being compared with the remaining system, so the Hilbert space dimension is four (m = 4). Similarly, the most important results here: (d) shows how interactions between non-correspondent parts (crossed or non-crossed) affect the original separability of each correspondent pair with respect to the remaining system, letting it become entangled with the remaining system. Finally, (e) exhibits the change of entanglement between non-correspondent parts. They are clearly originally entangled with their respective pair outside of the subsystem, but that entanglement becomes reduced (C 2 (Tr S (ρ IJ )) ≤ 3/2) due to the non-local interactions.

Generating Larger Maximal Entangled Systems
The generation of extended entanglement can be shown with a couple of introductory examples [27]. If β ij = Ψ 2i+i⊕j are the GBS basis elements for d = 1 corresponding to the Bell states [22], then considering the |GHZ and |W states of size 2d expressed in the GBS basis: where j sums over correspondent pairs. Note that we are alternating the notation in the kets by convenience: |Ψ k j is the Bell state |Ψ k on the j th correspondent pair, while Ψ i 1 ,i 2 ,...,i d = |Ψ I is the I = 4 d−1 i d + . . . + 4i 2 + i 1 element in the GBS basis. For d = 2, they are simply: where p, q, r ∈ Z. In the last operations, the block independence discussed in the previous section was applied to justify the construction of some simultaneous operations.

Recursive Generation of Larger Maximal Entangled Systems
In the previous subsection, we obtained the larger maximal entangled states |GHZ 4 and |W 4 departing from the more basic states such as |0000 . The enlargement of entangled states can be stated in a more impressive way as recursive processes. In each case, these processes are based on the control of the parameters involved and the independence among block types generated in each interaction.
Thus, the process shown in Figure 8 combines some of the operations depicted previously to develop |GHZ 2(d+1) departing from |GHZ 2d , stating a procedure to get larger versions of these maximal entangled states. The first step begins by using the state |Ψ 0 d+1 ⊗ |GHZ 2d . Then, a local operation is applied on each pair in the original state k = 1, 2, ..., d to reduce the factors (|Ψ 0 k + |Ψ 3 k ) and (|Ψ 0 j − |Ψ 3 j ) in (48) into |Ψ 0 j and |Ψ 3 j , respectively. Then, we exchange the indexes 30 ↔ 21 for the non-correspondent pairs k and d + 1 with a non-local operation. This transformation is followed by a couple of local operations changing the indexes 2 ↔ 3 for the pair k and 1 ↔ 3 for the pair d + 1 (which adds a factor i). In this last case, we transform the index 0 by itself, but adding the factor i . Finally, we revert for k = 1, 2, ..., d + 1 the initial transformation between |Ψ 0 k , |Ψ 3 k and (|Ψ 0 k ± |Ψ 3 k ), respectively. All additional index transformations are settled as the identity. The state obtained will be i |GHZ 2(d+1) . It is notable that only one 4-entangling operation between the added pair with another arbitrary pair from the original 2d-partite system has become necessary in this case. This reflects the low robustness of the genuine entanglement for these states. Considering the expression for |GHZ 2d in (48), the precise prescriptions are: state expressed only in terms of |Ψ 0 and |Ψ 3 , to finally be transformed into |GHZ 2(d+1) with the same kind of initial operations. To obtain the |W 2(d+1) state, we begin with |Ψ 0 d+1 ⊗ |W 2d , then we use the same local transformation to reduce the factors (|Ψ 0 k + |Ψ 3 k ) in (48) into |Ψ 0 k for each k = 1, 2, ..., d. Then, we apply a sequence of non-local transformations between the pairs k, d + 1 for k = 1, 2, ..., d to transfer probability between states with indexes 01 ↔ 10 there, in such a way as to reach the coefficient in each term. Finally, we revert the initial transformation for k = 1, 2, ..., d + 1, changing |Ψ 0 k into (|Ψ 0 k + |Ψ 3 k ). The final result is |W 2(d+1) , as is shown in Figure 9. Note how the entangling operations need to go through the overall pairs. It reflects the robustness of genuine entanglement in these states. By considering the expression for |W 2d in (48), the following process gives the prescriptions to reach |W 2(d+1) from |W 2d : As before, Hadamard-like block operations for H (3,k) I allow the states |W 2d and |W 2(d+1) to be switched, at the beginning and at the end, in terms of |Ψ 0 and |Ψ 1 . The remarkable set of operations are obtained with H (1,k,d+1) I Ia to entangle the added state |Ψ 0 d+1 through the operations (38), which progressively transfer the probability to the state |Ψ 4 d , completing a state easily transformed into |W 2(d+1) with the final set of operations. Additional exchange in the indexes is settled in the identity. The adequate set of k values for each step of operations should fulfill the d + 1 equations: These equations can be solved numerically for any d. Figure 10 shows the − log 10 i solutions for d = 1, 2, ..., 60 by taking i , δ i > 0. Note that i drops rapidly to zero when d and i grow.

Multipartite Entanglement and General States
In a previous subsection we described how to generate extended superposition using type I interactions. However, that process does not reach genuine entangled states. The use of type I Ia, I Ib interactions is mandatory to extend the entanglement as a set of operations involving elements of two pairs. Nevertheless, it is clear that many operations and combinations are necessary and possible.
For instance, by considering the permutation i, j, k from 1, 2, 3 and departing from the state |Ψ 0 2d , the process to reach an entangled state based on a complete combination from the basis elements for two correspondent pairs is as follows (note that the process is not unique). First, we apply a 2−local operation on the pair s and direction i followed by another on the pair s in the direction j. A linear combination from four basis elements is obtained. Then, we apply a 4−local operation in the direction δ ,p t,χ s,j Ψ 0,...,χ,..., ,...,0 , where C 4 = {0, 1, 2, 3} and p t, s,j is the extension of the inverse exchange rule presented before p s ( ), but specifying the rule j as a function of the direction of the interaction involved. The script t ∈ {0, i} is a label specifying each possible inverse. This means that if j is the characteristic direction of the interaction, then: p 0,i s,j = k = p 0,k s,j , p 0,0 s,j = 0 = p 0,j s,j and p i,i s,j = i = p i,k s,j , p i,0 s,j = j = p i,j s,j . This single process could be improved using additional interactions to grow the spectrum of coefficients α s β,α , β s,s β,β ;α,α in order to have a wider coverage of SU(4). In addition, it is clear the last process (or another alternative) should be repeated, varying one or two pairs in order to generate more complex entanglement. The question about how to generate a specific state under this procedure or to generate certain kind or level of entanglement is clearly open, mainly due to the poorly understood complexity to measure this property for large states in general.

Conclusions
Quantum gate array computation is based on the transformation of quantum states under certain universal operations. These operations are used to manipulate the information settled on quantum systems to simulate or reproduce computer processing, and normally use separable states as primary resources. Quantum systems involved-light or matter-are manipulated around entanglement generation in this kind of processing. Then, commonly involved interactions are non-local, implying that their parts become entangled when they are being manipulated. In the process, several slightly differentiated interactions are applied, each one with a different set of eigenvalues. This does not allow a common grammar to be set through the entire quantum information processing problem. SU(2) decomposition provides a procedure not only to reduce control in the quantum manipulation states. Together, it provides a common language to address the evolution through several kinds of similar interactions in order to manage a wider processing. Upon the selection of a compatible basis, it allows the recovery of two-state processing despite the inclusion of the necessary entangling interactions. Although we developed the procedure for certain types of well-known interactions (i.e., Heisenberg-Ising and Dzyaloshinskii-Moriya), the process can be extended to other interactions and architectures (the arrangement of qubits under interaction) by the adequate selection of the basis on which dynamics should be expressed conveniently. In addition, it is advised that other configurations based on qudits are possible using alternative group decompositions to SU(2 2d ) and SU(2). Finally, the development only proposes the change of quantum information grammar being used as function of the physical system in the deployment, preserving their applicability for most quantum information proposals in the literature.
Some applications of SU(2) decomposition are foreseen. It can be exploited in the quantum control of larger systems in which control schemes are not as well-developed as those of SU(2) dynamics.
The previously established decomposition allows the establishment of exact control when blocks are reduced to the standard forms I, NOT, H, etc. The success of such strategy for exact control depends on the number of free parameters involved, which can be reached using a sequence of pulses instead of a single one, or otherwise time-dependent controlled parameters in the Hamiltonian, although the block structure is conserved. Similarly, optimal control in terms of energy or time can be achieved when procedures such as those in [9,10] are adapted to each block in the depicted structure. More ambitious ideas about the control of quantum processing such as the use of traveling waves, ion traps, resonant cavities, or superconducting circuits [37][38][39][40] could be adapted to the architectures presented here.
Note that the selectivity of pairing in the blocks is related to the arisen non-diagonal elements (i.e., with the interactions generating diagonal-off entries in all cases). This approach to quantum evolution will allow analytical control of the flow of quantum information in different adaptive geometrical arrangements. The use of more feasible external fields (other than stepwise fields) is compulsory, which is completely compatible with the current SU(2) reduction scheme [41].
In a related but not necessarily equivalent direction, selective block decomposition could be useful for unitary factorization in quantum gate design (e.g., that developed for the SU(4) case [26]), particularly for large dedicated gates involving the processing of several qubits. A current challenge in the mathematical arena is solving how to express certain SU(2 2d ) matrices as a finite product in U(1) 2 2d−1 −1 × SU(2) 2 2d−1 , such as those developed here.
Finally, other applications in quantum processing could be engineered for multichannel quantum information storage, using certain subspaces to store differentiated information which could be processed simultaneously in other subspaces (e.g., in quantum image processing or quantum machine learning). Additional research should be developed to adapt this procedure to specific gate operations, and the translation of the most common algorithms into equivalent ones based on entangled resources like those shown here. For quantum magnetic systems, the most common interaction between two level systems is the Heisenberg-Ising interaction. This interaction is a low-order approximation for the far-field interaction between two magnetic dipoles in terms of the spin particles: − → s 1 · J · − → s 2 or − → σ 1 · J · − → σ 2 , when the spins − → s i =¯h 2 − → σ i are expressed in terms of Pauli operators by absorbing the factors¯h 2 in J, which is generally a tensor. When J becomes diagonal, we get the anisotropic Heisenberg-Ising interaction. Moreover, if those diagonal elements become equal, the interaction becomes isotropic.
In the context of this work, another kind of interaction appears-the Dzyaloshinskii-Moriya interaction, which is a contribution to the total magnetic exchange interaction between two neighboring magnetic spins [24,25]: − → D is a vector expressed in terms of the sources' orientation. Clearly, this Hamiltonian will contain terms such as D 1 σ 1 y ⊗ σ 2 z , D 2 σ 1 z ⊗ σ 2 x , D 3 σ 1 x ⊗ σ 2 y , where the script denotes the part and the subscript denotes the component (tensor product symbol ⊗ is introduced to remark that the product is between the spins of different quantum objects).
It is clear from the previous examples that the interactions contain terms involving one or two Pauli operators from the different physical parts. Although most terms with two spins appear there because interactions directly occur between a pair of physical objects, the motivation to include all classes of products of Pauli operators in the Hamiltonian (1) is to consider the most extensive types of interaction Notably, in the development of this work, precisely the previous interactions set a special kind of interactions, making the SU(2) decomposition possible Particularly we should note that each term in the Heisenberg-Ising and Dzyaloshinskii-Moriya interactions are only able to generate entangling operations between the pair of objects involved. However, extended entanglement could be generated by including many of those interactions between other pairs, as in the case of Ising chains. A conclusion from this paper is that non-physical terms containing more than two spin factors in the interaction could automatically generate more extended and inclusively genuine entanglement. For instance, for 2d qubits, one term containing 2d factors in one term of the Hamiltonian σ 1 z ⊗ σ 2 z ⊗ ...σ 2d z , which can generate genuine entanglement in fewer steps than are necessary in Section 6. Note also that powers or additional factors for each operator are not necessary because of their algebraic properties (any product of them for each part can be reduced to only one operator until unitary factors).
Although these examples are for magnetic systems, these kinds of Hamiltonians are not exclusive to those systems. Thus, for instance, the dipole interaction for a two-level system (an atom or ion restricted to excitation between two energy levels) in a radiation trap, particles in a double-well potential, etc., also have Hamiltonians expressed in terms of the Pauli matrices because they are the basis of SU(2) dynamics, common for all two-level systems (see A.2). Finally, there is a mathematical reason for the form of Hamiltonian (1). For all two-level quantum systems, dynamics are ruled by transformations given by elements of the unitary group of order 2, U(2) (see Appendix A.2), as solutions from the Schödinger equation for the evolution operator. In group theory, those elements can be depicted as the exponential of the generators of the group, which are precisely the Pauli operators defining an associated Lie algebra: exp(i∑ k∈0,1,2,3 α k σ k ) (see Appendix A.2). For composed systems, the set of generators (see Appendix A.2) and the basis elements (see Appendix A.3) for their dynamics are precisely the different products between the generators for each part: { d j=1 σ j k |k ∈ 0, 1, 2, 3}. Thus, through the Schrödinger equation, we can identify the exponent with the Hamiltonian in (1), thus representing the most general Hamiltonian for the current system composed of 2d two-level quantum systems.

Appendix A.2. Group Theory Basics in the Context of the SU(2) Decomposition
In the current Appendix we deliver a minimum of the group theory context to understand some aspects in this work. For a deeper treatment, [42,43] is a modern introductory resource. We begin by remarking on the notion of a group. It is a set G of elements g i ∈ G together with a defined product operation · fulfilling the properties: (a) Closure: g 1 · g 2 ∈ G for all g 1 , g 2 ∈ G (otherwise with a defined map: G × G → G); (b) Associativity: g1 · (g 2 · g 3 ) = (g1 · g 2 ) · g 3 for all g 1 , g 2 , g 3 ∈ G; (c) Identity element: there is a unique e ∈ G such that g · e = e · g = g for all g ∈ G; (d) Inverse: for each g ∈ G there exist g −1 ∈ G such that g · g −1 = g −1 · g = e. If G ⊂ G is itself a group, then we say G is a subgroup of G.
In two-level quantum systems we are interested in states defined in terms of a superposition of two orthonormal states |ψ 0 , |ψ 1 : |ψ = α 0 |ψ 0 + α 1 |ψ 1 . Equivalently, we can use the matrix notation: to depict such states. Those states have a time evolution |ψ(t) via the evolution operator U(t) obeying the Schrödinger Equation (2) in terms of the Hamiltonian operator, H. U(t) is an operator acting on the original state to evolve it: |ψ(t) = U(t) |ψ . It fulfills: (a) the outcome |ψ(t) belongs to the set depicted by a superposition of |ψ 0 , |ψ 1 ; and (b) the norm of the new state is preserved: ψ(t)|ψ(t) = ψ|U(t) † U(t)|ψ = ψ|ψ , then U(t) † = U(t) −1 . In the context of the Dirac notation, the dual U(t) † is another operator related with U(t). The evolution operator should clearly fulfill: (i) U(0) = I, the identity operator which leaves |ψ without change; and (ii) U(t 2 )U(t 1 ) = U(t 1 + t 2 ). Then, the reader can easily note that the set of operators U(t) for different values of t should form a group with the property U(t) † = U(t) −1 . This group is said the unitary group of order 2, U(2). Similarly, we can define a n−level system, where the evolution operators define the unitary group of order n, U(n).
For U(2), because the action of U(t) on |ψ is again a linear combination of |ψ 0 , |ψ 1 , then we know that: u i,j |ψ i ψ j or : U(t) = u 00 u 01 u 10 u 11 (A2) (in the following, for simplicity, we will adopt both representations as equivalent). Because of the norm definition for quantum states, we know that: u * i,j ψ j ψ i | or : U(t) † = u * 00 u * 10 u * 01 u *
We advise in the last structure that both e iφ andŨ(t) form groups separately. The set of numbers e iφ are clearly the U(1) group under the standard multiplication of complex numbers. We skip the demonstration thatŨ(t) with the standard matrix multiplication forms a group, which is trivial for the associativity, identity element, and inverse properties. Demonstration for the closure property is direct. We note that elements in this group fulfill the property |Ũ(t)| = 1. This group is said to be the special unitary group, SU(2). Normally, in quantum mechanics we select U(t) ∈ SU(2) because the phase e iφ is non-physical. For this reason we drop the tilde indistinctly. Because (A4), we say that U(2) is the direct product of U(1) and SU(2): U(2) = U(1) × SU(2) (the reader is advised that the term product is not due to the scalar product underlying in (A4), but instead to a pairing in terms of the Cartesian product of the elements of each group. For a formal definition, consult [42,43]; this concept will be relevant later). SU(2) is clearly a subgroup of U(2).
Another important property of the SU(2) group is that any element of it can be written as a linear combination of the Pauli matrices (this aspect is widely used in the text). This means that they are a basis for matrices in SU(2) (then also for U(2)). In fact: U(t) = (e −iφ u 00 )σ 0 + i (e −iφ u 01 )σ 1 + i (e −iφ u 01 )σ 2 + (e −iφ u 00 )σ 3 , where and are the real and imaginary part functions (in addition, note we are using here indistinctly the notation σ 0 = I, σ 1 = σ x = X, σ 2 = σ y = Y, σ 3 = σ z = Z, although in the text they have several meanings as the basis of the different SU(2) elements appearing there). Moreover, in several parts of the text, the following property is used, derived from the algebra fulfilled by Pauli matrices (obtained from the fact: (n · − → σ ) 2s = 1, s ∈ Z): e iαn· − → σ = cos α σ 0 + i sin α n · − → σ = cos α + in 3 sin α i sin α(n 1 − in 2 ) i sin α(n 1 + in 2 ) cos α − in 3 sin α , where n is a unitary vector with real components. From the last expression, it is easy to demonstrate that |e iαn· − → σ | = 1, so by comparing with (A4), it is advisable that (A6) is a parametrization for the elements in SU(2). Moreover, from the Baker-Campbell-Hausdorff formula [42,43]: interactions), we are consequently able to convert the involved Bell state into a separable state. When we look at this version of the GBS basis, it is clearer why Type I and III interactions become in entangling or unentagling operations on only one correspondent pair. Both types of operations actually resemble the effect on two-qubits processing with SU(4) operations such as those developed in [11], while the remaining system is not involved. Only the Type II operations provide more extended entangling properties.
where the superscript i in h i mn points out the consecutive number of blocks and S H I,I fulfills the syntactic notation followed in (28) and (29). We will exploit this notation in the following section for simplicity, where the matrix notation will become hardly extensive.
noting that the exchange involving two scripts implies the generation of entanglement between the two correspondent pairs (i.e., among the four qubits as a whole). In this case, eight blocks are different (but not necessarily independent,-because there are only 11 parameters free, including time t).
These two examples show in detail how the SU(2) decomposition is established. For cases d > 2, the situation becomes similar and they are easily understood using the last synthetic notation in terms of direct sums of blocks. It should finally be remarked that formulas (30) and (37) are computationally useful and efficient to connect the original Hamiltonian coefficients with the entries for each block.