Skip to main content
Royal Society Open Science logoLink to Royal Society Open Science
. 2014 Nov 26;1(3):140145. doi: 10.1098/rsos.140145

The minimum number of rotations about two axes for constructing an arbitrarily fixed rotation

Mitsuru Hamada 1,
PMCID: PMC4448841  PMID: 26064554

Abstract

For any pair of three-dimensional real unit vectors m^ and n^ with |m^Tn^|<1 and any rotation U, let Nm^,n^(U) denote the least value of a positive integer k such that U can be decomposed into a product of k rotations about either m^ or n^. This work gives the number Nm^,n^(U) 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 Nm^,n^(U) 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 R3, 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 m^ and n^ with |m^Tn^|<1, where m^T denotes the transpose of m^, let Nm^,n^(A) denote the least value of a positive integer k such that any rotation in A can be decomposed into (constructed as) a product of k rotations about either m^ or n^, where A=SU(2),SO(3). It is known that Nm^,n^(SO(3))=Nm^,n^(SU(2))=π/arccos|m^Tn^|+1 for any pair of three-dimensional real unit vectors m^ and n^ with |m^Tn^|<1 [1,2].

Then, a natural question arises: What is the least value, Nm^,n^(U), of a positive integer k such that an arbitrarily fixed rotation U can be decomposed into a product of k rotations about either m^ or n^? In this work, the minimum number Nm^,n^(U) 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 USU(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 Nm^,n^(SO(3)) [1,2] and a related result [5]. Prior to this work, the work by D'Alessandro [5] has treated the issue of determining Nm^,n^(D), DSO(3). That interesting result [5], however, gave Nm^,n^(D), DSO(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: Nm^,n^(U) is given in terms of an explicit function of parameters of USU(2); explicit optimal decompositions are presented; and this work's results on Nm^,n^(U) imply Lowenthal's formula on Nm^,n^(SO(3)) in a consistent self-contained manner.1

Regarding another direction of related research, we remark that Nm^,n^(A) is known as the order of (uniform) generation of the Lie group A, 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 Nm^,n^(SO(3)) needs a special proof (see [1,2] and [7, Appendix]).

Detailed elementary arguments below would help us dispel some confusions related to Nm^,n^(SU(2)) often found in textbooks on quantum computation. There, not to mention the ignorance of the fact Nm^,n^(SU(2))=π/arccos|m^Tn^|+1, a wrong statement equivalent to saying that Nm^,n^(SU(2)) were, at most, three, regardless of the choice of non-parallel vectors m^ and n^, 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 C2, and note that H determines the axis of the rotations [c(t)]1exp(itH)SU(2), tR, where c(t) is a square root of detexp(itH). (Often, although not always, differences of unitary matrices (evolutions) up to scalar multiples are ignorable.) Thus, explicit decompositions attaining the minimum Nm^,n^(U) of an arbitrary rotation U for the generic vectors m^ and n^ 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 Nm^,n^(U) 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: N denotes the set of strictly positive integers; S2={v^R3v^=1}, where v^=vx2+vy2+vz2 for v^=(vx,vy,vz)T; ⌈x⌉ denotes the smallest integer not less than xR. As usual, arccosx[0,π] and arcsinx[π/2,π/2] 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:

X=(0110),Y=(0ii0)andZ=(1001).

We shall work with a matrix

Rv^(θ):=(cosθ2)Ii(sinθ2)(vxX+vyY+vzZ), 3.1

where v^=(vx,vy,vz)TS2 and θR. This represents the rotation about v^ by angle θ (through the homomorphism in §2.4). In particular, for y^=(0,1,0)T and z^=(0,0,1)T, we put

Ry(θ):=Ry^(θ)=(cosθ2sinθ2sinθ2cosθ2)andRz(θ):=Rz^(θ)=(ei(θ/2)00ei(θ/2)).

For m^,n^S2 with |m^Tn^|<1, we define the following:

Nm^,n^(U):=min{jNV1,,VjRm^Rn^,U=V1Vj} 3.2

for USU(2), where Rv^:={Rv^(θ)θR}, and

Nm^,n^:=Nm^,n^(SU(2)):=min{kNUSU(2),Nm^,n^(U)k}. 3.3

Using the homomorphism F from SU(2) onto SO(3) to be defined in §3.4, we put R^v^:={F(Rv^(θ))θR}. We extend the definition of Nm^,n^ to SO(3):

Nm^,n^(D):=min{jNA1,,AjR^m^R^n^,D=A1Aj} 3.4

for D∈SO(3) and

Nm^,n^(SO(3)):=min{kNDSO(3),Nm^,n^(D)k}. 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 m^,n^S2 with |m^Tn^|<1,

Nm^,n^(SO(3))=Nm^,n^(SU(2))=πarccos|m^Tn^|+1.

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 α,γR and β∈[0,π] such that

U=(ei((γ+α)/2)cosβ2ei((γα)/2)sinβ2ei((γα)/2)sinβ2ei((γ+α)/2)cosβ2)=Rz(α)Ry(β)Rz(γ). 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

(abba) 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

(w+izy+ixy+ixwiz)=wI+i(xX+yY+zZ) 3.8

with some real numbers x,y,z and w such that w2+x2+y2+z2=1. Take a real number θ such that cos(θ/2)=w and sin(θ/2)=1w2=x2+y2+z2; write x, y and z as x=vxsin(θ/2),y=vysin(θ/2) and z=vzsin(θ/2), where vx,vy,vzR and vx2+vy2+vz2=1. Thus, using real numbers θ,vx,vy,vzR with vx2+vy2+vz2=1, any matrix in SU(2) can be written as

(cosθ2)Ii(sinθ2)(vxX+vyY+vzZ),

which is nothing but Rv^(θ) 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 R3 that sends (x,y,z)T to (x′,y′,z′)T through3

U(xX+yY+zZ)U=xX+yY+zZ. 3.9

Namely, for any (x,y,z)T,(x,y,z)TR3 with (3.9),

(xyz)=F(U)(xyz).

We also define

R^v^(θ):=F(Rv^(θ))forv^S2,θR. 3.10

3.5. Generic orthogonal axes and coordinate axes

Lemma 3.2 can be generalized as follows.

Lemma 3.3 —

Let l^,m^S2 be vectors with l^Tm^=0. Then, for any V ∈SU(2), there exist some α,γR and β∈[0,π] such that

V=Rm^(α)Rl^(β)Rm^(γ). 3.11

Proof —

As F is onto SO(3), there exists an element U∈SU(2) such that l^=F(U)(0,1,0)T and m^=F(U)(0,0,1)T.4 With this element U, some α,γR and some β∈[0,π], write UV U=Rz(α)Ry(β)Rz(γ) in terms of the parametrization (3.6). Then, since URz(α)U=Rm^(α), URy(β)U=Rl^(β) and URz(γ)U=Rm^(γ), we obtain (3.11). ▪

We also have the following lemma, which is easy but worth recognizing.

Lemma 3.4 —

Let arbitrary κ,νN, u^1,,u^κ,v^1,,v^νS2 and U∈SU(2) be given. Put u^1=F(U)u^1,,u^κ=F(U)u^κ,v^1=F(U)v^1, and v^ν=F(U)v^ν. Then, for any θ1,,θκ,ϕ1,ϕνR,

Ru^1(θ1)Ru^κ(θκ)=Rv^1(ϕ1)Rv^ν(ϕν)

if and only if (iff)

Ru^1(θ1)Ru^κ(θκ)=Rv^1(ϕ1)Rv^ν(ϕν).

Proof —

This readily follows from URu^j(θj)U=Ru^j(θj) and URv^j(ϕj)U=Rv^j(ϕj). ▪

4. The minimum numbers of constituent rotations and optimal constructions of an arbitrary rotation

Here, we present the result establishing Nm^,n^(U) with needed definitions.

Definition 4.1 —

For v^S2 and

U=(w+izy+ixy+ixwiz)=wI+i(xX+yY+zZ)SU(2), 4.1

where w,x,y,zR are parameters to express U uniquely, b(v^,U) is defined by

b(v^,U):=|(x,y,z)v^|. 4.2

Definition 4.2 —

Functions f:R3[0,π] and g:R2×(0,π/2]N are defined by

f(α,β,δ):=2arccoscos2β2cos2δ2+sin2β2sin2δ2+2cosαsinβ2sinδ2cosβ2cosδ2

and

g(α,β,δ):={2f(α,β,δ)2δ+12if f(α,β,δ)δ4otherwise.

Theorem 4.3 —

For any m^,n^S2 with m^Tn^[0,1), α,γR and β∈[0,π], if

b(m^,Uα,β,γm^,l^)b(n^,Uα,β,γm^,l^),

then

Nm^,n^(F(Uα,β,γm^,l^))=Nm^,n^(Uα,β,γm^,l^)=min{2β2δ+1,g(α,β,δ),g(γ,β,δ)},

where δ=arccosm^Tn^(0,π/2], l^=m^×n^1m^×n^ and

Uα,β,γm^,l^:=Rm^(α)Rl^(β)Rm^(γ).

Note that there is no loss of generality in assuming b(m^,Uα,β,γm^,l^) b(n^,Uα,β,γm^,l^), but also note that α,β and γ vary, in general, if m^ and n^ are interchanged.

We give two constructions or decompositions, which will turn out to attain the minimum number Nm^,n^(Uα,β,γm^,l^) in the theorem.

Proposition 4.4 —

Given arbitrary m^,n^S2 with m^Tn^[0,1), α,γR and β∈[0,π], put

δ=arccosm^Tn^(0,π2] 4.3

and

l^=m^×n^1m^×n^.

Then, for any kN and β1,…,βk∈(0,2δ] satisfying

β=β1++βk, 4.4

there exist some αj,γj,θjR such that

Rl^(βj)=Rm^(αj)Rn^(θj)Rm^(γj) 4.5

for j=1,…,k. For these parameters, it holds that

Rm^(α)Rl^(β)Rm^(γ)=Rm^(αα1)Rn^(θ1)Rm^(γ1α2)Rn^(θ2)Rm^(γ2α3)Rn^(θ3)Rm^(γk1αk)Rn^(θk)Rm^(γk+γ). 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 U=Rm^(α)Rl^(β)Rm^(γ)SU(2) into the product of 2⌈β/(2δ)⌉+1 rotations.6

Remark 4.6 —

For β,δR with 0≤β/2≤δπ/2, δ≠0, and tR, let

Ht(β,δ):={0if β2<δ=π2tif β2=δ=π2arcsintan(β/2)tanδotherwise.

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

σt(β,δ):=(Ht(β,δ)π2Ht(β,δ)+π22arcsinsin(β/2)sinδ) 4.7

and tjR can be chosen arbitrarily, j=1,…,k. (These make (4.6) hold.)

Proposition 4.7 —

Given any m^,n^S2 with m^Tn^[0,1), put δ=arccosm^Tn^(0,π/2] and l^=m^×n^1m^×n^. For an arbitrary U∈SU(2), choose parameters α,γR and β′∈[0,π] such that

Rl^(δ)U=Rm^(α)Rl^(β)Rm^(γ). 4.8

Then,

U=Rn^(α)Rl^(β+δ)Rm^(γ). 4.9

Furthermore, for any kN and β1,…,βk∈(0,2δ] satisfying

β+δ=β1++βk, 4.10

there exist some αj,γj,θjR such that

Rl^(βj)=Rm^(αj)Rn^(θj)Rm^(γj) 4.11

for j=1,…,k′. For these parameters, it holds that

U=Rn^(α)Rm^(α1)Rn^(θ1)Rm^(γ1α2)Rn^(θ2)Rm^(γ2α3)Rn^(θ3)Rm^(γk1αk)Rn^(θk)Rm^(γk+γ). 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 U=Rn^(α)Rl^(β+δ)Rm^(γ)SU(2) into the product of 2β/(2δ)+12 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 tjR can be chosen arbitrarily, j=1,…,k′.

5. Limits on constructions

In order to bound Nm^,n^(D), etc., from below, we use the geodesic metric on the unit sphere S2, which is denoted by d. Specifically,

d(u^,v^):=arccosu^Tv^[0,π] 5.1

for u^,v^S2. This is the length of the geodesic connecting u^ and v^ on S2. We have the following lemma. (Recall we have put R^v^(θ)=F(Rv^(θ)).)

Lemma 5.1 —

Let n^,m^ be arbitrary vectors in S2 with δ=d(m^,n^)=arccosm^Tn^(0,π]. Then, for any kN and ϕ1,,ϕ2kR, the following inequalities hold:

d(R^m^(ϕ2k1)R^n^(ϕ2k2)R^m^(ϕ3)R^n^(ϕ2)R^m^(ϕ1)m^,m^)2(k1)δ, 5.2
d(R^m^(ϕ2k1)R^n^(ϕ2k2)R^m^(ϕ3)R^n^(ϕ2)R^m^(ϕ1)m^,n^)(2k1)δ, 5.3
d(R^n^(ϕ2k)R^m^(ϕ2k1)R^m^(ϕ3)R^n^(ϕ2)R^m^(ϕ1)m^,n^)(2k1)δ 5.4
andd(R^n^(ϕ2k)R^m^(ϕ2k1)R^m^(ϕ3)R^n^(ϕ2)R^m^(ϕ1)m^,m^)2kδ. 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:

2d(Dm^,m^)2δ+12k1and2d(Dm^,n^)2δ+122k. 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 β,θR and for any u^,l^,m^S2 such that l^Tm^=0, the following two conditions are equivalent.

  • I. There exist some α,γR such that
    Ru^(θ)=Rm^(α)Rl^(β)Rm^(γ). 6.1
  • II. 1(m^Tu^)2|sin(θ/2)|=|sin(β/2)|.

Proof —

(1) Take an element U∈SU(2) such that

l^=F(U)(0,1,0)Tandm^=F(U)(0,0,1)T, 6.2

and put v^=(vx,vy,vz)T for the parameters vx,vy and vz such that

u^=vxl^×m^+vyl^+vzm^. 6.3

Then, owing to lemma 3.4, (6.1) holds iff

Rv^(θ)=Rz(α)Ry(β)Rz(γ). 6.4

(2) A direct calculation shows

Rz(α)Ry(β)Rz(γ)=cosβ2cosγ+α2Iisinβ2sinγα2Xisinβ2cosγα2Yicosβ2sinγ+α2Z. 6.5

Hence, (6.4) is equivalent to

cosθ2=cosβ2cosγ+α2, 6.6
vxsinθ2=sinβ2sinγα2, 6.7
vysinθ2=sinβ2cosγα2 6.8
andvzsinθ2=cosβ2sinγ+α2. 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

1vz2|sinθ2|=|sinβ2|. 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

η=γ+α2andζ=γα2, 6.11

we see, from paragraphs (1) and (2), that I is equivalent to the following condition: There exist some η,ζR such that

cosθ2=cosβ2cosη, 6.12
vxsinθ2=sinβ2sinζ, 6.13
vysinθ2=sinβ2cosζ 6.14
andvzsinθ2=cosβ2sinη. 6.15

Hence, it is enough to show that II implies the existence of some η,ζR satisfying (6.12)–(6.15).

Now suppose cos(β/2)0. Then, if we show

cos2(θ/2)cos2(β/2)+vz2sin2(θ/2)cos2(β/2)=1, 6.16

it will immediately imply the existence of η satisfying (6.12) and (6.15). From II, however, we have (6.10), and hence, (1vz2)sin2(θ/2)=sin2(β/2), i.e. 1(1vz2)sin2(θ/2)=cos2(β/2), which is equivalent to (6.16) by the assumption cos(β/2)0. If cos(β/2)=0, then |sin(β/2)|=1. This and (6.10) imply 1vz2=|sin(θ/2)|=1, and hence, vz=cos(θ/2)=0. Then, (6.12) and (6.15) hold for any choice of η.

In a similar way, if sin(β/2)0,

vx2sin2(θ/2)sin2(β/2)+vy2sin2(θ/2)sin2(β/2)=1 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 1vz2=vx2+vy2. If sin(β/2)=0, both (6.13) and (6.14) hold for any choice of ζ similarly. ▪

Proof of proposition 4.4 —

Choose a parameter θj such that |sin(θj/2)|=sin(βj/2)/sinδ, which is possible by the assumption βj∈(0,2δ]; then, it follows from lemma 6.1 that there exist some αj,γjR such that (4.5), i.e. Rl^(βj)=Rm^(αj)Rn^(θj)Rm^(γj) holds, j=1,…,k. Inserting these into

Rm^(α)Rl^(β)Rm^(γ)=Rm^(α)Rl^(β1)Rl^(βk)Rm^(γ),

we obtain (4.6). ▪

Proof of proposition 4.7 —

Note Rl^(δ)Rm^(α)Rl^(δ)=Rn^(α), which is equivalent to Ry(δ)Rz(α′)Ry(−δ)=Rv(α′), where v^=(sinδ,0,cosδ)T, 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 U=Rn^(α)Rl^(β+δ)Rm^(γ), which is (4.9). Then, applying to Rl^(β+δ)Rm^(γ), the decomposition in proposition 4.4 with (α,β,γ) replaced by (0,β′+δ,γ′), it readily follows that there exist some αj,γj and θjR, j=1,…,k′, that satisfy the following: |sin(θj/2)|=sin(βj/2)/sinδ and (4.11) for j=1,…,k′, and

Rl^(β+δ)Rm^(γ)=Rm^(α1)Rn^(θ1)Rm^(γ1α2)Rn^(θ2)Rm^(γ2α3)Rn^(θ3)Rm^(γk1αk)Rn^(θk)Rm^(γk+γ). 6.18

Thus, we obtain the proposition. ▪

Figure 1.

Figure 1.

Configuration of l^,m^ and n^ in propositions 4.4 and 4.7, and configuration of y^=(0,1,0)T, z^=(0,0,1)T and v^ 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 Rl^(2δ)=Rn^(π)Rm^(π), which is equivalent to Ry(2δ)=Rv(π)Rz(−π), where v^=(sinδ,0,cosδ)T, by lemma 3.4.

6.3. Proof of theorem 4.3

Let 2N1 and 2N denote the set of odd numbers in N and that of even numbers in N, respectively. We define the following for m^,n^S2 with |m^Tn^|<1:

Mm^,n^odd(U):=min{j2N1V1,V3,,VjRm^,V2,V4,,Vj1Rn^,U=VjVj1V1},Mm^,n^even(U):=min{j2NV1,V3,,Vj1Rm^,V2,V4,,VjRn^,U=VjVj1V1}andMm^,n^(U):=min{Mm^,n^odd(U),Mm^,n^even(U)}

for U∈SU(2);

Mm^,n^odd(D):=min{j2N1A1,A3,,AjR^m^,A2,A4,,Aj1R^n^,D=AjAj1A1},Mm^,n^even(D):=min{j2NA1,A3,,Aj1R^m^,A2,A4,,AjR^n^,D=AjAj1A1},andMm^,n^(D):=min{Mm^,n^odd(D),Mm^,n^even(D)}

for D∈SO(3). The following lemma largely solves the issue of determining the optimal number Nm^,n^(U).

Lemma 6.2 —

Let m^,n^, l^ and δ be as in theorem 4.3. Then, for any α,γR and β∈[0,π],

Mm^,n^odd(F(Uα,β,γm^,l^))=Mm^,n^odd(Uα,β,γm^,l^)=2β2δ+1 6.19

and

Mm^,n^even(F(Uα,β,γm^,l^))=Mm^,n^even(Uα,β,γm^,l^)=g(α,β,δ), 6.20

where Uα,β,γm^,l^ is as defined in theorem 4.3.

Corollary 6.3 —

Let m^,n^, l^ and δ be as in theorem 4.3. Then, for any α,γR and β∈[0,π],

Mm^,n^(F(Uα,β,γm^,l^))=Mm^,n^(Uα,β,γm^,l^)=min{2β2δ+1,g(α,β,δ)}. 6.21

Proof —

In the case where β=0, since Mm^,n^odd(Uα,β,γm^,l^)=1 and Mm^,n^even(Uα,β,γm^,l^)=2, (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

2β2δ+1Mm^,n^odd(F(Uα,β,γm^,l^))Mm^,n^odd(Uα,β,γm^,l^)2β2δ+1 6.22

while the second inequality trivially follows from the definition of Mm^,n^odd.

Note first that remark 4.5 to proposition 4.4 immediately implies the third inequality in (6.22). To prove the first inequality, assume

F(Uα,β,γm^,l^)=AjAj1A1 6.23

for some j=2k−1 with kN, where AνR^m^ if ν is odd and AνR^n^ otherwise.

We shall evaluate d(F(Uα,β,γm^,l^)m^,m^)=d(AjAj1A1m^,m^). Noting that d(F(Uα,β,γm^,l^)m^,m^)=β, we have β≤2(k−1)δ by (5.2) of lemma 4.1. This implies ⌈β/(2δ)⌉≤k−1, and therefore,

2β2δ+12k1=j. 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 g(α,β,δ)=2f(α,β,δ)/(2δ)+12 in this case, we shall show the first and third inequalities in

2f(α,β,δ)2δ+12Mm^,n^even(F(Uα,β,γm^,l^))Mm^,n^even(Uα,β,γm^,l^)2f(α,β,δ)2δ+12 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 U=Uα,β,γm^,l^. To see β′=f(α,β,δ), rewrite (4.8), using lemma 3.4, as

Ry(δ)Rz(α)Ry(β)Rz(γ)=Rz(α)Ry(β)Rz(γ). 6.26

Then, a direct calculation shows the absolute value of the (1,1)-entry of the left-hand side equals

cos2β2cos2δ2+sin2β2sin2δ2+2cosαsinβ2sinδ2cosβ2cosδ2.

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 kN, where AνR^m^ if ν is odd and AνR^n^ otherwise. Note that n^=R^l^(δ)m^ and hence, for U=Rn^(α)Rl^(β+δ)Rm^(γ) in proposition 3.7,

d(F(U)m^,n^)=d(R^l^(β+δ)m^,n^)=d(R^l^(β+δ)m^,R^l^(δ)m^)=(β+δ)δ=β.

Then, we have β′≤(2k−1)δ by (5.4) of lemma 5.1. This implies ⌈(β′+δ)/(2δ)⌉≤k, and, therefore,

2β+δ2δ2k=j. 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),

Nm^,n^(U)=min{Mm^,n^odd(U),Mm^,n^even(U),Mn^,m^odd(U),Mn^,m^even(U)},

and we can write U in terms of three parametric expressions:

U=Ru^(θ)=Uα,β,γm^,l^=Uα~,β~,γ~n^,l^,

where β,β~[0,π], α,γ,α~,γ~,θR and u^S2. Then, we have

β2=arcsin[1(m^Tu^)2|sinθ2|]andβ~2=arcsin[1(n^Tu^)2|sinθ2|]

owing to lemma 5.1, and, hence,

Mm^,n^odd(U)=2arcsin1(m^Tu^)2|sin(θ/2)|δ+1

and

Mn^,m^odd(U)=2arcsin1(n^Tu^)2|sin(θ/2)|δ+1

owing to lemma 5.2. Then, if |m^Tu^||n^Tu^| whenever sin(θ/2)0, which implies Mm^,n^odd(U)Mn^,m^odd(U), we shall have

Nm^,n^(U)=min{Mm^,n^odd(U),Mm^,n^even(U),Mn^,m^even(U)}=min{2β2δ+1,g(α,β,δ),Mn^,m^even(U)} 6.28

for U=Uα,β,γm^,l^. But [sin(θ/2)0|m^Tu^||n^Tu^|] follows from b(m^,Uα,β,γm^,l^)b(n^,Uα,β,γm^,l^) by the definition of b. (This is because writing U in (4.1) as U=Ru^(θ), θR, u^S2, results in sin(θ/2)u^=(x,y,z)T as in §2.3, whereby b(v^,U)=|sin(θ/2)||u^Tv^|.) Hence, we have (6.28).

A short additional argument (appendix D) shows

Mn^,m^even(Uα,β,γm^,l^)=g(γ,β,δ), 6.29

and, therefore,

Nm^,n^(Uα,β,γm^,l^)=min{2β2δ+1,g(α,β,δ),g(γ,β,δ)}.

Finally, from corollary 6.3 or from the argument in appendix E, it readily follows that Nm^,n^(F(Uα,β,γm^,l^))=Nm^,n^(Uα,β,γm^,l^). 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 δ=arccosm^Tn^(0,π/2] without loss of generality. If b(m^,U) b(n^,U), 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 U=Ru^1(ϕ1)Ru^j(ϕj) implies U=Ru^j(ϕj)Ru^1(ϕ1)]. If b(m^,U)<b(n^,U), interchanging m^ and n^, 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 Nm^,n^(U) of a positive integer k such that U can be decomposed into the product of k rotations about either m^ or n^ for an arbitrarily fixed element U in SU(2), or in SO(3), where m^,n^S2 are arbitrary real unit vectors with |m^Tn^|<1. Decompositions of U attaining the minimum number Nm^,n^(U) 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:

minimizelength(τ1,,τν,m^1,,m^ν)subject toRm^1(τ1)Rm^2(τ2)Rm^ν(τν)=U,νN;τjR,m^jAfor j=1,,ν

where length(τ1,,τν,m^1,,m^ν):=ν, U is an arbitrary fixed rotation and AS2 with |A|=2 (the minimum of ‘length’, the primary part of an optimal solution, has been denoted by Nm^,n^(U)). 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. [1012] suggest considering the quantity Nm^,n^(U) or analogues. A difference in background between this paper and Brezov et al. [1012] 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 Rm^1(τ1)Rm^2(τ2)Rm^3(τ3)=U, i.e. the above equation with ν=3) is considered. In the series of Brezov et al. [1012], they investigated such decompositions of the Davenport type, seemingly with emphasis on physical aspects. Note that Nm^,n^(SU(2))=maxUNm^,n^(U)=π/arccos|m^Tn^|+1, m^±n^, is greater than three except in the classical case, where m^ and n^ 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. [1012].

Appendix A. Element in SU(2) associated with l^ and m^

Our goal here is to prove (in a constructive manner) that for any pair of vectors l^,m^S2 with l^Tm^=0, there exists some element U∈SU(2) such that l^=F(U)(0,1,0)T and m^=F(U)(0,0,1)T. Expressing U as U=Rz(α~)Ry(β~)Rz(γ~), we shall specify desired α~,β~ and γ~. By a direct calculation with

R^y(θ)=(cosθ0sinθ010sinθ0cosθ)andR^z(θ)=(cosθsinθ0sinθcosθ0001),

where R^y(θ):=F(Ry(θ)) and R^z(θ):=F(Rz(θ)), we have F(U)(0,0,1)T=(cosα~sinβ~,sinα~sinβ~,cosβ~)T. On the other hand, the condition l^=F(U)(0,1,0)T is equivalent to R^y(β~)R^z(α~)l^=R^z(γ~)(0,1,0)T, i.e.

(cosβ~cosα~cosβ~sinα~sinβ~sinα~cosα~0cosα~sinβ~sinα~sinβ~cosβ~)l^=(sinγ~cosγ~0). A 1

Hence, choosing parameters α~ and β~ such that (cosα~sinβ~,sinα~sinβ~,cosβ~)T=m^, cf. spherical coordinates, and γ~ that satisfies (A.1), we have a desired element U=Rz(α~)Ry(β~)Rz(γ~) such that l^=F(U)(0,1,0)T and m^=F(U)(0,0,1)T.

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 Rn^(θ)=Rm^(α)Rl^(β)Rm^(γ), where l^,m^ and n^ 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 θ,α,β,γR, and n^,l^,m^S2 such that l^Tm^=0,

Rn^(θ)=Rm^(α)Rl^(β)Rm^(γ) B 1

holds iff the following conditions hold:

cosγ+α2=cos(θ/2)cos(β/2)andsinγ+α2=m^Tn^sin(θ/2)cos(β/2) B 2

whenever cos(β/2)0,

sinγα2=(l^×m^)Tn^sin(θ/2)sin(β/2)andcosγα2=l^Tn^sin(θ/2)sin(β/2) B 3

whenever sin(β/2)0, and

1(m^Tn^)2|sinθ2|=|sinβ2|. B 4

Corollary B.2 —

Given any δ∈(0,π/2] and l^,m^S2 such that l^Tm^=0, put

n^=(sinδ)l^×m^+(cosδ)m^. B 5

Then, (i) for any θ,α,γR and β∈[0,π], (B 1) holds if

β2δ

and there exists some tR such that (recall Ht is defined in remark 4.6)

(αγθ)=±(Ht(β,δ)π2Ht(β,δ)+π22arcsinsin(β/2)sinδ)or(αγθ)=±(Ht(β,δ)+π2Ht(β,δ)+3π22π2arcsinsin(β/2)sinδ); B 6

(ii) for any αR and β∈(0,π], if (B 1) holds for some θ,γR, then β≤2δ and there exist some jZ and tR such that8

α=±Ht(β,δ)±π2+πj;

(iii) for any γR and β∈(0,π], if (B 1) holds for some θ,αR, then β≤2δ and there exist some jZ and tR such that

γ=±Ht(β,δ)±π2+πj.

Proof —

Set v^=(vx,vy,vz)T with

vx=(l^×m^)Tn^,vy=l^Tn^andvz=m^Tn^.

Then, according to paragraphs (1) and (2) in the proof of lemma 6.1, for any θ,α,β,γR, (B 1) holds iff (6.6)–(6.9) hold. But (6.6)–(6.9) hold iff (B 4), [cos(β/2)0] and [sin(β/2)0] hold. This completes the proof of the lemma.

To see the corollary (recall figure 1 and), note

(l^×m^)Tn^=sinδ,l^Tn^=0andm^Tn^=cosδ.

Then, (B 4), [cos(β/2)0] and [sin(β/2)0] hold if the following two conditions are satisfied: (a) β≤2δ and (b)

{γ+α2=arcsintan(β/2)tanδγα2=π2θ=2arcsinsin(β/2)sinδor{γ+α2=πarcsintan(β/2)tanδγα2=π2θ=2π2arcsinsin(β/2)sinδ

unless β/2=δ=π/2,9 and

{γ+α2=sγα2=π2θ=β

for some sR 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 Mm^,n^even(Uα,β,γm^,l^)4, i.e. either Mm^,n^even(Uα,β,γm^,l^)=2 or Mm^,n^even(Uα,β,γm^,l^)=4. We also have Mm^,n^even(F(U))=Mm^,n^even(U) for any U∈SU(2) (appendix E). Hence, all we need to show is that

θ,ϕR,Rm^(α)Rl^(β)Rm^(γ)=Rn^(θ)Rm^(ϕ) C 1

implies f(α,β,δ)≥δ. This can be shown easily with corollary B.2, (ii). ▪

Proof 2 —

We shall show that (C 1), i.e.

θ,γ~R,Rm^(α)Rl^(β)Rm^(γ~)=Rn^(θ), C 2

implies f(α,β,δ)=δ, which is enough. Note that f(α,β,δ)=β′ for the angle β′∈[0,π] such that

α,γR,Rl^(δ)Rm^(α)Rl^(β)Rm^(γ)=Rm^(α)Rl^(β)Rm^(γ) C 3

(Proof of lemma 6.2 in §6.3). From (C 2) and (C 3), we have

α,γ,γ~,θR,Rm^(α)Rl^(β)Rm^(γγ+γ~)=Rl^(δ)Rn^(θ),

which is, by lemma 3.4, equivalent to

α,γ,γ~,θR,Rz(α)Ry(β)Rz(γγ+γ~)=Ry(δ)Rv^(θ), C 4

where v^=(sinδ,0,cosδ)T. The absolute value of the (1,1)-entry of the right-hand side in (C 4) equals cos(δ/2) 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 Mn^,m^even(U)=Mm^,n^even(U) for any U∈SU(2), by definition, and also that (Uα,β,γm^,l^)=Uγ,β,αm^,l^=Uγπ,β,α+πm^,l^ for any α,γ and β∈[0,π], cf. footnote 2. These facts give Mn^,m^even(Uα,β,γm^,l^)=g(γπ,β,δ)=g(γ,β,δ) as desired.10

Appendix E. Proof that Mm^,n^even(F(U))=Mm^,n^even(U) and Nm^,n^(F(U))=Nm^,n^(U)

Let any m^,n^S2 with |m^Tn^|<1 and U∈SU(2) be given. By definition, Mm^,n^even(F(U))Mm^,n^even(U). 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 UV .

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 jN, v^1,,v^jS2 and ϕ1,…,ϕj R such that F(U)=F(Rv^1(ϕ1))F(Rv^j(ϕj)), then U=±Rv^1(ϕ1)Rv^j(ϕj). But Rv^1(ϕ1)Rv^j(ϕj)=Rv^1(ϕ1+2π)Rv^2(ϕ2)Rv^j(ϕj). This implies Mm^,n^even(F(U))Mm^,n^even(U), and hence, Mm^,n^even(F(U))=Mm^,n^even(U). We also have Nm^,n^(F(U))=Nm^,n^(U), etc., similarly.

Appendix F. Proof of theorem 3.1

Put

δ=arccos|m^Tn^|(0,π2].

Note Nm^,n^(U)=Nm^,n^(U) by definition. Hence, we shall prove the statement assuming m^Tn^0, which is enough.

First, we give another corollary to lemma 6.2.

Corollary F.1 —

For any α,γR, and for any β∈[0,π],

Nm^,n^(Uα,β,γm^,l^)Mm^,n^(Uα,β,γm^,l^)min{2β2δ+1,maxαRg(α,β,δ)}.

Proof —

The first inequality follows from the definitions of Nm^,n^ and Mm^,n^. The second inequality immediately follows from corollary 6.3. ▪

It is easy to show, using corollary F.1, that

Nm^,n^(F(U))Nm^,n^(U)ν+1 F 1

for any U∈SU(2), where ν:=⌈π/δ⌉. But we have ν+1Nm^,n^(F(U)) and, therefore, the equality among all sides of (F 1) for

U={Rm^(π)Rl^(πδ)if ν is evenRl^(π)if ν is odd.

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 jk and tj=π/2 (j=1,…,k), we have the following special form of (4.6):

Rm^(α)Rl^(β)Rm^(γ)=Rm^(α)[Rn^(π)Rm^(π)]k1Rm^(αk)Rn^(θk)Rm^(γk+γ), G 1

where

βk=β2(k1)δ

since βj=2δ for j<k.

The analogous special case of (4.12) with k′=⌈β′/(2δ)+1/2⌉, βj=2δ for jk′ and tj=π/2 (j=1,…,k′) is

U=Rn^(α)[Rn^(π)Rm^(π)]k1Rm^(αk)Rn^(θk)Rm^(γk+γ), G 2

where

βk=β+δ2(k1)δ.

In particular, if β′≤δ, this equation becomes

U=Rn^(α)Rm^(αk)Rn^(θk)Rm^(γk+γ). 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 m^ and n^ 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 m^, and the label 1 indicates the other case. To express sequences of angles efficiently, we introduce the following notation:

jstands forπ,π,,π,π, G 4

where the pattern ‘π,−π’ is repeated j times, and

jstands forπ,π,,π,π, G 5

where the pattern ‘−π,π’ is repeated j times (jZ,j0). We put Π={jjZ,j0}{jjZ,j0}.

A decomposition is represented as a list of the form

[r0,r1,,rN], G 6

where r0∈{0,1} and rjRΠ 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 Rn^(π/3)Rm^(π/4), the output expressing this is [0,π/3,−π/4]; if the optimal one is Rm^(π/8)Rn^(π)Rm^(π), the output is [0,π/8,π,−π] (or [0,π/8,∧∧1]).

To proceed, we need some definitions. The symbol ⊕ denotes the exclusive or operation (addition in Z/2Z). We define a function reverse as follows: reverse(s)=−s for sR, reverse(s)=s for sΠ and

reverse(r)=[r01,reverse(rN),,reverse(r1)]

for a list r of the form (G 6).

We use functions a'(α,β,γ,δ) and c'(α,β,γ,δ) that return α′ and γ′, respectively, such that

Ry(δ)Rz(α)Ry(β)Rz(γ)=Rz(α)Ry(β)Rz(γ).

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

U(w,x,y,z)=(w+izy+ixy+ixwiz)SU(2) G 7

as in definition 4.1. Throughout, relations

m^=(mx,my,mz)Tandn^=(nx,ny,nz)T 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 αR, β∈[0,π] and γR, respectively, such that

w2+z2cosγ+α2=w, G 9
x2+y2sinγα2=x, G 10
x2+y2cosγα2=y G 11

and

w2+z2sinγ+α2=z G 12

and cos(β/2)=w2+z2, i.e. such that

(ei((γ+α)/2)cosβ2ei((γα)/2)sinβ2ei((γα)/2)sinβ2ei((γ+α)/2)cosβ2)=Rz(α)Ry(β)Rz(γ)=(w+izy+ixy+ixwiz).

Similarly, functions a~(mx,my,mz) and b~(mx,my,mz) that return spherical coordinates α~ and β~, respectively, such that (cosα~sinβ~,sinα~sinβ~,cosβ~)=(mx,my,mz) will be used freely. We also use

sign(x)={1if x01if x<0,

and a function normalised_vprod(mx,my,mz,nx,ny,nz) that returns m^×n^1(m^×n^)T, recall (G 8).

The following function represents the main step (for obtaining γ~) of the calculation of the SU(2) element associated with l^=(lx,ly,lz)T and m^ that has been described in appendix A:

c~(α~,β~,lx,ly,lz)=sign(lxcosβ~cosα~lycosβ~sinα~+lzsinβ~)arccos(lxsinα~+lycosα~). 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: w,x,y,zR with w2+x2+y2+z2=1; mx,my,mz,nx,ny,nzR with mx2+my2+mz2=1, nx2+ny2+nz2=1 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;

δ:=arccosm^Tn^;

If b(m^,U(w,x,y,z))<b(n^,U(w,x,y,z)), 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 l^ and m^ in appendix A */

α~:=a~(mx,my,mz);

β~:=b~(mx,my,mz);

γ~:=c~(α~,β~,lx,ly,lz);

 /* Main step */

 1. Set V=Rz(α~)Ry(β~)Rz(γ~) and calculate parameters w′,x′,y′,z′ such that

U(w,x,y,z)=VU(w,x,y,z)V.

 2. Obtain α:=a(w′,x′,y′,z′), β:=b(w′,x′,y′,z′), and γ:=c(w′,x′,y′,z′).

 3. Put β′:=f(α,β,δ), β′′:=f(γ,−β,δ), and

N:=min{2β2δ+1,g(α,β,δ),g(γ,β,δ)}.

 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

1

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.

2

The restriction of β to [0,π] does not seem common. However, in a straightforward proof of this lemma, β∈[0,π] can be chosen so that cos(β/2)=|a| and sin(β/2)=|b| 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 α,γR. This readily follows from equations Rv^(θ+2π)=Rv^(θ), v^S2, θR, and Rz(−π)Ry(β′)Rz(π)=Ry(−β′), βR.

3

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 Rv^(θ) can be derived in a natural manner, but one may consult Biedenharn & Louck [4, ch. 2] for it.)

4

For the sake of constructiveness, such an element U is constructed in appendix A.

5

To make the construction explicit, one can set βj=2δ for jk. The analogous comment applies to the division of β′+δ in proposition 4.7.

6

All remarks except remark 4.5, which needs no proof, will be proved in what follows.

7

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 Rn^(θ)=Rm^(α)Rl^(β)Rm^(γ) 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).

8

Here, wx±y+z means w∈{x+y+z,xy+z,−x+y+z,−xy+z}.

9

tan(β/2)/tanδ should be understood as 0 if β/2<δ=π/2.

10

As a check, one can show, using corollary B.2, (iii), that Mn^,m^even(Uα,β,γm^,l^)=4 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]

Articles from Royal Society Open Science are provided here courtesy of The Royal Society

RESOURCES