Abstract
For any pair of three-dimensional real unit vectors and with and any rotation U, let denote the least value of a positive integer k such that U can be decomposed into a product of k rotations about either or . This work gives the number as a function of U. Here, a rotation means an element D of the special orthogonal group SO(3) or an element of the special unitary group SU(2) that corresponds to D. Decompositions of U attaining the minimum number are also given explicitly.
Keywords: SU(2), SO(3), rotation
2. Introduction
In this work, an issue on optimal constructions of rotations in the Euclidean space , under some restriction, is addressed and solved. By a rotation or rotation matrix, we usually mean an element of the special orthogonal group SO(3). However, we follow the custom, in quantum physics, to call not only an element of SO(3) but also that of the special unitary group SU(2) a rotation. This is justified by the well-known homomorphism from SU(2) onto SO(3) (§2.4). Given a pair of three-dimensional real unit vectors and with , where denotes the transpose of , let denote the least value of a positive integer k such that any rotation in can be decomposed into (constructed as) a product of k rotations about either or , where . It is known that for any pair of three-dimensional real unit vectors and with [1,2].
Then, a natural question arises: What is the least value, , of a positive integer k such that an arbitrarily fixed rotation U can be decomposed into a product of k rotations about either or ? In this work, the minimum number is given as an explicit function of U, where U is expressed in terms of parameters known as Euler angles [3,4]. Moreover, optimal, that is minimum-achieving, decompositions (constructions) of any fixed element U∈SU(2) are presented explicitly.
In this work, not only explicit constructions but also simple inequalities on geometric quantities, which directly show lower bounds on the number of constituent rotations, will be presented. Remarkably, the proposed explicit constructions meet the obtained lower bounds, which shows both the optimality of the constructions and the tightness of the bounds.
The results in this work were obtained before the author came to know Lowenthal's formula on [1,2] and a related result [5]. Prior to this work, the work by D'Alessandro [5] has treated the issue of determining , D∈SO(3). That interesting result [5], however, gave , D∈SO(3), only algorithmically (with the largest index of a sequence of real numbers with some property). The distinctive features of this work include the following: is given in terms of an explicit function of parameters of U∈SU(2); explicit optimal decompositions are presented; and this work's results on imply Lowenthal's formula on in a consistent self-contained manner.1
Regarding another direction of related research, we remark that is known as the order of (uniform) generation of the Lie group , and this notion has been extended to other Lie groups. The interested reader is referred to relatively extensive treatments on uniform generation [6,7], where one would find that even determining the order needs a special proof (see [1,2] and [7, Appendix]).
Detailed elementary arguments below would help us dispel some confusions related to often found in textbooks on quantum computation. There, not to mention the ignorance of the fact , a wrong statement equivalent to saying that were, at most, three, regardless of the choice of non-parallel vectors and , is observed.
Regarding physics, this work has been affected by the issue of constructing an arbitrary unitary operator on a Hilbert space discussed in quantum physics [8]. This is relevant to universal gates for quantum computation [9]. In this context, requiring the availability of rotations about a pair of exactly orthogonal axes seems too idealistic. For example, consider a Hamiltonian H of a quantum system represented by , and note that H determines the axis of the rotations , , where c(t) is a square root of . (Often, although not always, differences of unitary matrices (evolutions) up to scalar multiples are ignorable.) Thus, explicit decompositions attaining the minimum of an arbitrary rotation U for the generic vectors and will be useful. For applications to control, the reader is referred to D'Alessandro [5] and references therein.
This paper is organized as follows. After giving preliminaries in §2, the main theorem establishing and explicit constructions of rotations are presented in §3. Then, inequalities that show limits on constructions are presented in §4. The proofs of the results of this work are presented in §5. Section 6 contains the conclusion. Several arguments are relegated to appendices.
3. Preliminaries and a known result
3.1. Definitions
The notation to be used includes the following: denotes the set of strictly positive integers; , where for ; ⌈x⌉ denotes the smallest integer not less than . As usual, and for x∈[−1,1]. The Hermitian conjugate of a matrix U is denoted by U†.
Throughout, I denotes the 2×2 identity matrix; X, Y and Z denote the following Pauli matrices:
We shall work with a matrix
| 3.1 |
where and . This represents the rotation about by angle θ (through the homomorphism in §2.4). In particular, for and , we put
For with , we define the following:
| 3.2 |
for U∈SU(2), where , and
| 3.3 |
Using the homomorphism F from SU(2) onto SO(3) to be defined in §3.4, we put . We extend the definition of to SO(3):
| 3.4 |
for D∈SO(3) and
| 3.5 |
3.2. The maximum of the minimum number of constituent rotations over all target rotations
This work's results lead to an elementary self-contained proof of the following known theorem (appendix F).
Theorem 3.1 (Lowenthal [1,2]) —
For any with
3.3. Parametrizations of the elements in SU(2)
The following lemma presents a well-known parametrization of SU(2) elements.
Lemma 3.2 —
For any element U∈SU(2), there exist some and β∈[0,π] such that
3.6
The parameters α,β and γ in this lemma are often called Euler angles.2 The lemma can be rephrased as follows: any matrix in SU(2) can be written as
| 3.7 |
with some complex numbers a and b such that |a|2+|b|2=1 [3]. Hence, any matrix in SU(2) can be written as
| 3.8 |
with some real numbers x,y,z and w such that w2+x2+y2+z2=1. Take a real number θ such that and ; write x, y and z as and , where and . Thus, using real numbers with , any matrix in SU(2) can be written as
which is nothing but in (3.1).
3.4. Homomorphism from SU(2) onto SO(3)
For U∈SU(2), we denote by F(U) the matrix of the linear transformation on that sends (x,y,z)T to (x′,y′,z′)T through3
| 3.9 |
Namely, for any with (3.9),
We also define
| 3.10 |
3.5. Generic orthogonal axes and coordinate axes
Lemma 3.2 can be generalized as follows.
Lemma 3.3 —
Let be vectors with . Then, for any V ∈SU(2), there exist some and β∈[0,π] such that
3.11
Proof —
As F is onto SO(3), there exists an element U∈SU(2) such that and .4 With this element U, some and some β∈[0,π], write U†V U=Rz(α)Ry(β)Rz(γ) in terms of the parametrization (3.6). Then, since , and , we obtain (3.11). ▪
We also have the following lemma, which is easy but worth recognizing.
Lemma 3.4 —
Let arbitrary and U∈SU(2) be given. Put and . Then, for any
if and only if (iff)
Proof —
This readily follows from and . ▪
4. The minimum numbers of constituent rotations and optimal constructions of an arbitrary rotation
Here, we present the result establishing with needed definitions.
Definition 4.1 —
For and
4.1 where are parameters to express U uniquely, is defined by
4.2
Definition 4.2 —
Functions and are defined by
and
Theorem 4.3 —
For any with and β∈[0,π], if
then
where and
Note that there is no loss of generality in assuming , but also note that α,β and γ vary, in general, if and are interchanged.
We give two constructions or decompositions, which will turn out to attain the minimum number in the theorem.
Proposition 4.4 —
Given arbitrary with and β∈[0,π], put
4.3 and
Then, for any and β1,…,βk∈(0,2δ] satisfying
4.4 there exist some such that
4.5 for j=1,…,k. For these parameters, it holds that
4.6
Remark 4.5 —
The least value of k such that (4.4) holds for some β1,…,βk∈ (0,2δ] is ⌈β/(2δ)⌉.5 Hence, this proposition gives a decomposition of an arbitrary element into the product of 2⌈β/(2δ)⌉+1 rotations.6
Remark 4.6 —
For with 0≤β/2≤δ≤π/2, δ≠0, and , let
Then, an explicit instance of the set of parameters αj, γj and θj for which (4.5) holds is given by (αj,γj,θj)T=σtj(βj,δ), where
4.7 and can be chosen arbitrarily, j=1,…,k. (These make (4.6) hold.)
Proposition 4.7 —
Given any with put and . For an arbitrary U∈SU(2), choose parameters and β′∈[0,π] such that
4.8 Then,
4.9 Furthermore, for any and β′1,…,β′k′∈(0,2δ] satisfying
4.10 there exist some such that
4.11 for j=1,…,k′. For these parameters, it holds that
4.12
Remark 4.8 —
The least value of k′ such that (4.10) holds for some β′1,…,β′k′∈ (0,2δ] is ⌈(β′+δ)/(2δ)⌉=⌈β′/(2δ)+1/2⌉. Moreover, if β′≥δ and k′=⌈β′/(2δ)+1/2⌉, the parameter α′1 can be chosen so that it satisfies α′1=0 as well as (4.11) and (4.12). Hence, when β′≥δ, this proposition and the fact just mentioned give a decomposition of an arbitrary element into the product of rotations, and when β′<δ, a decomposition of U into the product of four rotations.
Remark 4.9 —
An explicit instance of the set of parameters α′j,γ′j and θ′j, j=1,…,k′, for which (4.11) and (4.12) hold is given by (α′j,γ′j,θ′j)T= σtj(β′j,δ), where can be chosen arbitrarily, j=1,…,k′.
5. Limits on constructions
In order to bound , etc., from below, we use the geodesic metric on the unit sphere S2, which is denoted by d. Specifically,
| 5.1 |
for . This is the length of the geodesic connecting and on S2. We have the following lemma. (Recall we have put .)
Lemma 5.1 —
Let be arbitrary vectors in S2 with . Then, for any and the following inequalities hold:
5.2
5.3
5.4
5.5
This can be shown easily by induction on k using the triangle inequality for d. In what follows, (5.2) and (5.4) will be used in the following forms:
| 5.6 |
These bounds hold when D and D′∈SO(3) equal the product of 2k−1 rotations and that of 2k rotations, respectively, in lemma 5.1 (since k is an integer). It will turn out that these bounds are tight.
6. Proof of the results
6.1. Structure of the proof
Here, the structure of the whole proof of the results in this work is described. Theorem 4.3 is obtained as a consequence of lemma 6.2 to be presented. The constructive half of lemma 6.2 is due to propositions 4.4 and 4.7. The other half of lemma 6.2, related to limits on constructions, is due to lemma 5.1. Theorem 3.1 is derived from theorem 4.3 in appendix F.
6.2. Proof of propositions 4.4 and 4.7
The following lemma is fundamental to the results in this work.
Lemma 6.1 —
For any and for any such that the following two conditions are equivalent.
I. There exist some such that
6.1 II. .
Proof —
(1) Take an element U∈SU(2) such that
6.2 and put for the parameters vx,vy and vz such that
6.3 Then, owing to lemma 3.4, (6.1) holds iff
6.4 (2) A direct calculation shows
6.5 Hence, (6.4) is equivalent to
6.6
6.7
6.8
6.9 (3) We shall prove I ⇒ II. On each side of (6.7) and (6.8), squaring and summing the resultant pair, we have
6.10 (Equations (6.6) and (6.9) also imply (6.10) similarly.) But (6.10) implies II in view of (6.3).
(4) Next, we shall prove II ⇒ I.
Transforming (α,β) into (η,ζ), where the two pairs are related by
6.11 we see, from paragraphs (1) and (2), that I is equivalent to the following condition: There exist some such that
6.12
6.13
6.14
6.15 Hence, it is enough to show that II implies the existence of some satisfying (6.12)–(6.15).
Now suppose . Then, if we show
6.16 it will immediately imply the existence of η satisfying (6.12) and (6.15). From II, however, we have (6.10), and hence, , i.e. , which is equivalent to (6.16) by the assumption . If , then . This and (6.10) imply , and hence, . Then, (6.12) and (6.15) hold for any choice of η.
In a similar way, if ,
6.17 will immediately imply the existence of ζ satisfying (6.13) and (6.14). But (6.17) follows again from II or (6.10) since . If , both (6.13) and (6.14) hold for any choice of ζ similarly. ▪
Proof of proposition 4.4 —
Choose a parameter θj such that , which is possible by the assumption βj∈(0,2δ]; then, it follows from lemma 6.1 that there exist some such that (4.5), i.e. holds, j=1,…,k. Inserting these into
we obtain (4.6). ▪
Proof of proposition 4.7 —
Note , which is equivalent to Ry(δ)Rz(α′)Ry(−δ)=Rv(α′), where , by lemma 3.4 (figure 1) and therefore, can be checked easily by a direct calculation. Using this equation, we can rewrite (4.8) as , which is (4.9). Then, applying to , the decomposition in proposition 4.4 with (α,β,γ) replaced by (0,β′+δ,γ′), it readily follows that there exist some α′j,γ′j and , j=1,…,k′, that satisfy the following: and (4.11) for j=1,…,k′, and
6.18 Thus, we obtain the proposition. ▪
Figure 1.

Configuration of and in propositions 4.4 and 4.7, and configuration of , and in arguments around these propositions.
Remarks 4.6 and 4.9 to these propositions are proved in appendix B. The statement on α′1 in remark 4.8 follows from remark 4.9 (put β′1=2δ and t1=π/2) or, more directly, from an equation , which is equivalent to Ry(2δ)=Rv(π)Rz(−π), where , by lemma 3.4.
6.3. Proof of theorem 4.3
Let and denote the set of odd numbers in and that of even numbers in , respectively. We define the following for with :
for U∈SU(2);
for D∈SO(3). The following lemma largely solves the issue of determining the optimal number .
Lemma 6.2 —
Let and δ be as in theorem 4.3. Then, for any and β∈[0,π],
6.19 and
6.20 where is as defined in theorem 4.3.
Corollary 6.3 —
Let and δ be as in theorem 4.3. Then, for any and β∈[0,π],
6.21
Proof —
In the case where β=0, since and , (6.19) and (6.20) are trivially true. We shall prove the statement for β>0.
To establish (6.19), we shall show the first and third inequalities in
6.22 while the second inequality trivially follows from the definition of .
Note first that remark 4.5 to proposition 4.4 immediately implies the third inequality in (6.22). To prove the first inequality, assume
6.23 for some j=2k−1 with , where if ν is odd and otherwise.
We shall evaluate . Noting that , we have β≤2(k−1)δ by (5.2) of lemma 4.1. This implies ⌈β/(2δ)⌉≤k−1, and therefore,
6.24 From this bound, we have the first inequality in (6.22), and hence (6.19).
To establish (6.20), we shall first treat the major case where f(α,β,δ)≥δ. Recalling that in this case, we shall show the first and third inequalities in
6.25 while the second inequality holds trivially.
Note that remark 4.8 to proposition 4.7 will imply the third inequality upon showing that β′ in proposition 4.7 satisfies β′=f(α,β,δ) when . To see β′=f(α,β,δ), rewrite (4.8), using lemma 3.4, as
6.26 Then, a direct calculation shows the absolute value of the (1,1)-entry of the left-hand side equals
This shows β′=f(α,β,δ) in view of (3.6).
To prove the first inequality in (6.25), assume (6.23) holds for some j=2k with , where if ν is odd and otherwise. Note that and hence, for in proposition 3.7,
Then, we have β′≤(2k−1)δ by (5.4) of lemma 5.1. This implies ⌈(β′+δ)/(2δ)⌉≤k, and, therefore,
6.27 From this bound, we have the first inequality in (6.25) and, hence, the equality among all sides of (6.25). This shows (6.20) in the case where f(α,β,δ)≥δ. The proof of (6.20) in the other case is given in appendix C. This completes the proof of the lemma. The proved lemma immediately implies the corollary. ▪
Proof of theorem 4.3 —
Note that for any U∈SU(2),
and we can write U in terms of three parametric expressions:
where , and . Then, we have
owing to lemma 5.1, and, hence,
and
owing to lemma 5.2. Then, if whenever , which implies , we shall have
6.28 for . But follows from by the definition of b. (This is because writing U in (4.1) as , , , results in as in §2.3, whereby .) Hence, we have (6.28).
A short additional argument (appendix D) shows
6.29 and, therefore,
Finally, from corollary 6.3 or from the argument in appendix E, it readily follows that . Hence, we obtain the theorem. ▪
From the viewpoint of construction, we summarize the (most directly) suggested way to obtain an optimal construction of a given element U∈SU(2), where we assume without loss of generality. If , choose a construction that attains the minimum in (6.28). The construction is among that of proposition 4.4, that of proposition 4.7 and that of proposition 4.7 applied to U† in place of U [note implies ]. If , interchanging and , apply the construction just described.7 See appendix G for a detailed description of the above construction method.
7. Conclusion
This work has established the least value of a positive integer k such that U can be decomposed into the product of k rotations about either or for an arbitrarily fixed element U in SU(2), or in SO(3), where are arbitrary real unit vectors with . Decompositions of U attaining the minimum number have also been given explicitly.
8. Comments on Brezov et al. [10–12]
In this paper, an algorithm for solving the following unusual optimization problem was presented:
where , U is an arbitrary fixed rotation and A⊂S2 with |A|=2 (the minimum of ‘length’, the primary part of an optimal solution, has been denoted by ). To this author's knowledge, only the work by D'Alessandro [5] and this paper have discussed this optimization problem.
Naturally, the present author could not find any (explicit or implicit) indication that Brezov et al. [10–12] suggest considering the quantity or analogues. A difference in background between this paper and Brezov et al. [10–12] may be understood as follows. While the situation assumed in this paper is that only two axes are available in constructing an arbitrary rotation, assuming a different situation results in problem formulations different from ours. For example, in Leite [7, Lemma 4.2] (attributed to Davenport), a situation where three axes are available but the number of factors in a decomposition is limited to three or less (in words, an equation , i.e. the above equation with ν=3) is considered. In the series of Brezov et al. [10–12], they investigated such decompositions of the Davenport type, seemingly with emphasis on physical aspects. Note that , , is greater than three except in the classical case, where and are orthogonal to each other.
Despite such differences in essence and background, note in the proof of this paper's formula (6.20) for the minimum even number of factors in lemma 6.2, on which the main theorem (theorem 4.3) relies, the case where the minimum even number is 2 or 4 needs an exceptional treatment (appendix C). This exceptionality would motivate one to read treatments on decompositions into two factors, and such can be found in Brezov et al. [10–12].
Appendix A. Element in SU(2) associated with and
Our goal here is to prove (in a constructive manner) that for any pair of vectors with , there exists some element U∈SU(2) such that and . Expressing U as , we shall specify desired and . By a direct calculation with
where and , we have . On the other hand, the condition is equivalent to , i.e.
| A 1 |
Hence, choosing parameters and such that , cf. spherical coordinates, and that satisfies (A.1), we have a desired element such that and .
Appendix B. Details on angles in propositions 4.4 and 4.7
Examining the proof of lemma 6.1, we can be specific about α and γ to have the following lemma and corollary. In particular, the corollary gives a sufficient condition, (i), and two necessary conditions, (ii) and (iii), for , where and are set as in propositions 4.4 and 4.7. Remarks 4.6 and 4.9 will be clear from (i). Later, (ii) and (iii) will be used in appendices C and D, respectively, though the use of them is not mandatory.
Lemma B.1 —
For any and such that
B 1 holds iff the following conditions hold:
B 2 whenever
B 3 whenever and
B 4
Corollary B.2 —
Given any δ∈(0,π/2] and such that put
B 5 Then, (i) for any and β∈[0,π], (B 1) holds if
and there exists some such that (recall Ht is defined in remark 4.6)
B 6 (ii) for any and β∈(0,π], if (B 1) holds for some then β≤2δ and there exist some and such that8
(iii) for any and β∈(0,π], if (B 1) holds for some then β≤2δ and there exist some and such that
Proof —
Set with
Then, according to paragraphs (1) and (2) in the proof of lemma 6.1, for any , (B 1) holds iff (6.6)–(6.9) hold. But (6.6)–(6.9) hold iff (B 4), [] and [] hold. This completes the proof of the lemma.
To see the corollary (recall figure 1 and), note
Then, (B 4), [] and [] hold if the following two conditions are satisfied: (a) β≤2δ and (b)
unless β/2=δ=π/2,9 and
for some if β/2=δ=π/2. This readily gives two solutions for (B 1). Rewriting these solutions with Ht and checking that flipping the signs of the solutions gives other solutions, we obtain (i). Showing (ii) and (iii) is as easy as showing (i). ▪
Appendix C. Proofs of (6.20) in the case f(α,β,δ)<δ
Proof 1 —
Proposition 4.7 and remark 4.8 show , i.e. either or . We also have for any U∈SU(2) (appendix E). Hence, all we need to show is that
C 1 implies f(α,β,δ)≥δ. This can be shown easily with corollary B.2, (ii). ▪
Proof 2 —
We shall show that (C 1), i.e.
C 2 implies f(α,β,δ)=δ, which is enough. Note that f(α,β,δ)=β′ for the angle β′∈[0,π] such that
C 3 (Proof of lemma 6.2 in §6.3). From (C 2) and (C 3), we have
which is, by lemma 3.4, equivalent to
C 4 where . The absolute value of the (1,1)-entry of the right-hand side in (C 4) equals since Ry(−δ)Rv(θ)=Rz(θ)Ry(−δ), which is equivalent to the equation Rv(θ)=Ry(δ)Rz(θ)Ry(−δ) used before. In view of (3.6), this implies β′=δ, i.e. f(α,β,δ)=δ as desired. ▪
Appendix D. Proof of (6.29)
Observe that for any U∈SU(2), by definition, and also that for any α,γ and β∈[0,π], cf. footnote 2. These facts give as desired.10
Appendix E. Proof that and
Let any with and U∈SU(2) be given. By definition, . We shall show the inequality in the other direction using the following lemma.
Lemma E.1 —
For any U,V ∈SU(2), F(U)=F(V) iff U=±V .
Proof —
This directly follows from the well-known fact that the kernel of F is {I,−I}, which can be checked with (3.1). ▪
From this lemma, it readily follows that if there exist some , and ϕ1,…,ϕj such that , then . But . This implies , and hence, . We also have , etc., similarly.
Appendix F. Proof of theorem 3.1
Put
Note by definition. Hence, we shall prove the statement assuming , which is enough.
First, we give another corollary to lemma 6.2.
Corollary F.1 —
For any and for any β∈[0,π],
Proof —
The first inequality follows from the definitions of and . The second inequality immediately follows from corollary 6.3. ▪
It is easy to show, using corollary F.1, that
| F 1 |
for any U∈SU(2), where ν:=⌈π/δ⌉. But we have and, therefore, the equality among all sides of (F 1) for
Thus, we have proved theorem 3.1 elementarily.
Appendix G. Procedure for obtaining an optimal decomposition
In proposition 4.4 and remark 4.6, setting k=⌈β/(2δ)⌉, βj=2δ for j≠k and tj=π/2 (j=1,…,k), we have the following special form of (4.6):
| G 1 |
where
since βj=2δ for j<k.
The analogous special case of (4.12) with k′=⌈β′/(2δ)+1/2⌉, β′j=2δ for j≠k′ and tj=π/2 (j=1,…,k′) is
| G 2 |
where
In particular, if β′≤δ, this equation becomes
| G 3 |
The aim of this appendix is to present a procedure to produce the parameters (angles) of the optimal decomposition having the form of (G 1), (G 2) or (G 3), where interchange of and is allowed.
First, we describe the data format of output decompositions. We shall use a label taking values in {0,1}, where the label 0 indicates that the rightmost factor in the output decomposition is a rotation about , and the label 1 indicates the other case. To express sequences of angles efficiently, we introduce the following notation:
| G 4 |
where the pattern ‘π,−π’ is repeated j times, and
| G 5 |
where the pattern ‘−π,π’ is repeated j times (). We put .
A decomposition is represented as a list of the form
| G 6 |
where r0∈{0,1} and for j=1,…,N. The first entry r0 denotes the label. The part r1,…,rN lists the angles of all factors in a decomposition, where the order is preserved in listing the angles. For example, if the optimal decomposition is , the output expressing this is [0,π/3,−π/4]; if the optimal one is , the output is [0,π/8,π,−π] (or [0,π/8,∧∧1]).
To proceed, we need some definitions. The symbol ⊕ denotes the exclusive or operation (addition in ). We define a function reverse as follows: reverse(s)=−s for , reverse(s)=s for s∈Π and
for a list r of the form (G 6).
We use functions a'(α,β,γ,δ) and c'(α,β,γ,δ) that return α′ and γ′, respectively, such that
We shall not write down algorithms for these functions as it is as trivial as writing down the standard functions a and c in what follows. Below, the functions b, f, g and σt defined in §3 will be used.
The core of the procedure consists of the following two functions to represent the above two decompositions, where interchange∈{0,1} is an external variable to be defined outside the functions.
DecompositionOdd (α,β,γ,δ,N){
k:=(N−1)/2; If k=0, then return [interchange, α+γ]
βlast:=β−2(k−1)δ;
(αlast,γlast,θlast)T:=σπ/2(βlast,δ); /* σt is defined in (4.7) */
If k>1, then
return [interchange,α,∧∧k−2,π,−π−αlast,θlast,−γlast+γ];
else
return [interchange,α−αlast,θlast,−γlast+γ]; }
DecompositionEven (α,β,γ,δ,N,β′){
k′:=N/2;
α′:=a'(α,β,γ,δ);
γ′:=c'(α,β,γ,δ);
β′last:=β′+δ−2(k′−1)δ;
(α′last,γ′last,θ′last)T:=σπ/2(β′last,δ);
If β′>δ, then
return [interchange,α′+π, −∧∧k′−2, −π−α′last, θ′last, −γ′last+γ′];
else {
If β′=δ, then
return [interchange,α′+θ′last, −γ′last+γ′];
else
return [interchange, α′, −α′last, θ′last, −γ′last+γ′]; } }
In what follows, w,x,y and z are the parameters to specify
| G 7 |
as in definition 4.1. Throughout, relations
| G 8 |
should be understood.
The following standard functions for converting (w,x,y,z) into the Euler angles would not need to be described: a(w,x,y,z), b(w,x,y,z) and c(w,x,y,z), which return , β∈[0,π] and , respectively, such that
| G 9 |
| G 10 |
| G 11 |
and
| G 12 |
and , i.e. such that
Similarly, functions and that return spherical coordinates and , respectively, such that will be used freely. We also use
and a function normalised_vprod(mx,my,mz,nx,ny,nz) that returns , recall (G 8).
The following function represents the main step (for obtaining ) of the calculation of the SU(2) element associated with and that has been described in appendix A:
| G 13 |
Now we present the procedure, where w,x,y and z are the parameters of U(w,x,y,z) as in (G 7) to be decomposed.
Procedure for obtaining an optimal decomposition.
Inputs: with w2+x2+y2+z2=1; with , and mxnx+myny+mznz≥0.
Output: a list consisting of a label ∈{0,1}, and the angles of all factors in an optimal decomposition.
interchange:=0;
;
If , then {
(tx,ty,tz):=(mx,my,mz);
(mx,my,mz):=(nx,ny,nz);
(nx,ny,nz):=(tx,ty,tz);
interchange:=1; }
(lx,ly,lz):=normalised_vprod(mx,my,mz,nx,ny,nz);
/* Euler angles of SU(2) element associated with and in appendix A */
;
;
;
/* Main step */
1. Set and calculate parameters w′,x′,y′,z′ such that
2. Obtain α:=a(w′,x′,y′,z′), β:=b(w′,x′,y′,z′), and γ:=c(w′,x′,y′,z′).
3. Put β′:=f(α,β,δ), β′′:=f(γ,−β,δ), and
4. Do one of the following three processes according to the case:
Case 1 [ N=2⌈β/(2δ)⌉+1 ]
return DecompositionOdd (α,β,γ,δ,N);
Case 2 [ N=g(α,β,δ) ]
return DecompositionEven (α,β,γ,δ,N,β′);
Case 3 [ N=g(γ,−β,δ) ]
return reverse(DecompositionEven (−γ−π,β,−α+π,δ,N,β′′));
End of the procedure.
Footnotes
Here, the crux of the difficulty in obtaining this work's results will be explained. Finding the minimum odd number of factors needed for decomposing U, which is expressed with a standard parameter β of U, together with minimum-achieving decompositions, was relatively easy. The crux lay in obtaining a solution to attain the minimum even number of factors, which was found to be expressed with another parameter β′ eventually.
The restriction of β to [0,π] does not seem common. However, in a straightforward proof of this lemma, β∈[0,π] can be chosen so that and when the first row of U is (a,b). Also any Rz(α′)Ry(β′)Rz(γ′) without this restriction can be written as Rz(α)Ry(β)Rz(γ) with some β∈[0,π] and . This readily follows from equations , , , and Rz(−π)Ry(β′)Rz(π)=Ry(−β′), .
The objects treated in this subsection and previous one can be found in Wigner [3, ch. 15], where −Y and −Z have been used instead of our Y and Z in defining the homomorphism. Owing to this difference, the homomorphism in Wigner [3] is TF(U)T, where T is the diagonal matrix with diagonal entries 1 (leftmost), −1 and −1. (For example, TF(Ry(θ))T and TF(Rz(θ))T have appeared in Wigner [3, ch. 15] while we shall use F(Ry(θ)) and F(Rz(θ)) in appendix A. The general form can be derived in a natural manner, but one may consult Biedenharn & Louck [4, ch. 2] for it.)
For the sake of constructiveness, such an element U is constructed in appendix A.
To make the construction explicit, one can set βj=2δ for j≠k. The analogous comment applies to the division of β′+δ in proposition 4.7.
All remarks except remark 4.5, which needs no proof, will be proved in what follows.
One (seemingly difficult) issue arises: determine all optimal decompositions of an arbitrarily fixed rotation. Note that in propositions 4.4 and 4.7 and their proofs, any solution for can be used (see corollary B.2 in appendix B for explicit solutions, among which one is chosen to be used in remarks 4.6 and 4.9).
Here, w=±x±y+z means w∈{x+y+z,x−y+z,−x+y+z,−x−y+z}.
should be understood as 0 if β/2<δ=π/2.
As a check, one can show, using corollary B.2, (iii), that if f(γ,−β,δ)<δ in the same way as in appendix C.
Funding statement
This work was supported by SCOPE (Ministry of Internal Affairs and Communications) and by Japan Society for the Promotion of Science KAKENHI grant nos. 22540150 and 21244007.
References
- 1.Lowenthal F. 1971. Uniform finite generation of the rotation group. Rocky Mt. J. Math. 1, 575–586. (doi:10.1216/RMJ-1971-1-4-575) [Google Scholar]
- 2.Lowenthal F. 1972. Uniform finite generation of the SU(2) and SL(2,R). Can. J. Math. 24, 713–727. (doi:10.4153/CJM-1972-067-x) [Google Scholar]
- 3.Wigner EP. 1959. Group theory and its application to the quantum mechanics of atomic spectra. New York, NY: Academic Press. [Google Scholar]
- 4.Biedenharn LC, Louck JD. 1985. Angular momentum in quantum physics: theory and application. New York, NY: Cambridge University Press. [Google Scholar]
- 5.D'Alessandro D. 2004. Optimal evaluation of generalized Euler angles with applications to control. Automatica 40, 1997–2002. (doi:10.1016/j.automatica.2004.06.006) [Google Scholar]
- 6.Koch RM, Lowenthal F. 1975. Uniform finite generation of three-dimensional linear Lie groups. Can. J. Math. 27, 396–417. (doi:10.4153/CJM-1975-048-0) [Google Scholar]
- 7.Leite FS. 1991. Bounds on the order of generation of SO(n,R) by one-parameter subgroups. Rocky Mt. J. Math. 21, 879–911. (doi:10.1216/rmjm/1181072975) [Google Scholar]
- 8.Reck M, Zeilinger A, Bernstein HJ, Bertani P. 1994. Experimental realization of any discrete unitary operator. Phys. Rev. Lett. 73, 58–61. (doi:10.1103/PhysRevLett.73.58) [DOI] [PubMed] [Google Scholar]
- 9.Boykin PO, Mor T, Pulver M, Roychowdhury V, Vatan F. 1999. On universal and fault-tolerant quantum computing: a novel basis and new constructive proof of universality for Shor's basis. In 40th Annu. Symp. on Foundations of Computer Science, 17–19 October 1999, New York, NY, pp. 486–494. IEEE. [Google Scholar]
- 10.Brezov D, Mladenova C, Mladenov I. 2012. Vector decompositions of rotations. J. Geom. Symmetry Phys. 28, 67–103. [Google Scholar]
- 11.Brezov D, Mladenova C, Mladenov I. 2013. Vector parameters in classical hyperbolic geometry. J. Geom. Symmetry Phys. 30, 19–48. [Google Scholar]
- 12.Brezov D, Mladenova C, Mladenov I. 2014. A decoupled solution to the generalized Euler decomposition problem in ℝ3 and ℝ2,1. J. Geom. Symmetry Phys. 33, 47–78. [Google Scholar]
