Open access peer-reviewed chapter

Convexity, Majorization and Time Optimal Control of Coupled Spin Dynamics

Written By

Navin Khaneja

Submitted: 07 March 2018 Reviewed: 28 July 2018 Published: 05 November 2018

DOI: 10.5772/intechopen.80567

From the Edited Volume

Applied Modern Control

Edited by Le Anh Tuan

Chapter metrics overview

946 Chapter Downloads

View Full Metrics

Abstract

In this chapter, we study some control problems that derive from time optimal control of coupled spin dynamics in NMR spectroscopy and quantum information and computation. Time optimal control helps to minimize relaxation losses. In a two qubit system, the ability to synthesize, local unitaries, much more rapidly than evolution of couplings, gives a natural time scale separation in these problems. The generators of unitary evolution, g , are decomposed into fast generators k (local Hamiltonians) and slow generators p (couplings) as a Cartan decomposition g = p ⊕ k . Using this decomposition, we exploit some convexity ideas to completely characterize the reachable set and time optimal control for these problems. The main contribution of the chapter is, we carry out a global analysis of time optimality.

Keywords

  • Kostant convexity
  • spin dynamics
  • Cartan decomposition
  • Cartan subalgebra
  • Weyl group
  • time optimal control

1. Introduction

A rich class of model control problems arise when one considers dynamics of two coupled spin 1 2 . The dynamics of two coupled spins, forms the basis for the field of quantum information processing and computing [1] and is fundamental in multidimensional NMR spectroscopy [2, 3]. Numerous experiments in NMR spectroscopy, involve synthesizing unitary transformations [4, 5, 6] that require interaction between the spins (evolution of the coupling Hamiltonian). These experiments involve transferring, coherence and polarization from one spin to another and involve evolution of interaction Hamiltonians [2]. Similarly, many protocols in quantum communication and information processing involve synthesizing entangled states starting from the separable states [1, 7, 8]. This again requires evolution of interaction Hamiltonians between the qubits.

A typical feature of many of these problems is that evolution of interaction Hamiltonians takes significantly longer than the time required to generate local unitary transformations (unitary transformations that effect individual spins only). In NMR spectroscopy [2, 3], local unitary transformations on spins are obtained by application of rf-pulses, whose strength may be orders of magnitude larger than the couplings between the spins. Given the Schróedinger equation for unitary evolution

U ̇ = i H c + j = 1 n u j H j U , U 0 = I , E1

where H c represents a coupling Hamiltonian, and u j are controls that can be switched on and off. What is the minimum time required to synthesize any unitary transformation in the coupled spin system, when the control generators H j are local Hamiltonians and are much stronger than the coupling between the spins ( u j can be made large). Design of time optimal rf-pulse sequences is an important research subject in NMR spectroscopy and quantum information processing [4, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21], as minimizing the time to execute quantum operations can reduce relaxation losses, which are always present in an open quantum system [22, 23]. This problem has a special mathematical structure that helps to characterize all the time optimal trajectories [4]. The special mathematical structure manifested in the coupled two spin system, motivates a broader study of control systems with the same properties.

The Hamiltonian of a spin 1 2 can be written in terms of the generators of rotations on a two dimensional space and these are the Pauli matrices i σ x , i σ y , i σ z , where,

σ z = 1 2 1 0 0 1 ; σ y = 1 2 0 i i 0 ; σ x = 1 2 0 1 1 0 . E2

Note

σ x σ y = i σ z , σ y σ z = i σ x , σ z σ x = i σ y , E3

where A B = AB BA is the matrix commutator and

σ x 2 = σ y 2 = σ z 2 = 1 4 , E4

The Hamiltonian for a system of two coupled spins takes the general form

H 0 =   a α σ α 1 +   b β 1 σ β +   J αβ σ α σ β , E5

where α , β x y z . The Hamiltonians σ α 1 and 1 σ β are termed local Hamiltonians and operate on one of the spins. The Hamiltonian

H c =   J αβ σ α σ β , E6

is the coupling or interaction Hamiltonian and operates on both the spins.

The following notation is therefore common place in the NMR literature.

I α = σ α 1 ; S β = 1 σ β . E7

The operators I α and S β commute and therefore exp i α a α I α + β b β S β =

exp i α a α I α exp i β b β S β = exp i α a α σ α 1 ( 1 exp i β b β σ β , E8

The unitary transformations of the kind

exp i α a α σ α exp i β b β σ β ,

obtained by evolution of the local Hamiltonians are called local unitary transformations.

The coupling Hamiltonian can be written as

H c = J αβ I α S β . E9

Written explicitly, some of these matrices take the form

I z = σ z 1 = 1 2 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 . E10

and

I z S z = σ z σ z = 1 4 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 . E11

The 15 operators,

i I α S β I α S β ,

for α , β x y z , form the basis for the Lie algebra g = su 4 , the 4 × 4 , traceless skew-Hermitian matrices. For the coupled two spins, the generators iH c , iH j su 4 and the evolution operator U t in Eq. (1) is an element of SU 4 , the 4 × 4 , unitary matrices of determinant 1 .

The Lie algebra g = su 4 has a direct sum decomposition g = p k , where

k = i I α S β , p = i I α S β . E12

Here k is a subalgebra of g made from local Hamiltonians and p nonlocal Hamiltonians. In Eq. (1), we have iH j k and iH c p , It is easy to verify that

k k k , k p p , p p p . E13

This decomposition of a real semi-simple Lie algebra g = p k satisfying (13) is called the Cartan decomposition of the Lie algebra g [24].

This special structure of Cartan decomposition arising in dynamics of two coupled spins in Eq. (1), motivates study of a broader class of time optimal control problems.

Consider the following canonical problems. Given the evolution

U ̇ = X d + j u j t X j U , U 0 = 1 , E14

where U SU n , the special Unitary group (determinant 1 , n × n matrices U such that U U = 1 , ' is conjugate transpose). Where X j k = so n , skew symmetric matrices and

X d = i λ 1 0 0 0 λ 2 0 0 0 λ n , λ i = 0 .

We assume X j LA , the Lie algebra ( X j and its matrix commutators) generated by generators X j is all of so n . We want to find the minimum time to steer this system between points of interest, assuming no bounds on our controls u j t . Here again we have a Cartan decomposition on generators. Given g = su n , traceless skew-Hermitian matrices, generators of SU n , we have g = p k , where p = iA , where A is traceless symmetric and k = so n . As before, X d p and X j k . We want to find time optimal ways to steer this system. We call this SU n SO n problem. For n = 4 , this system models the dynamics of two coupled nuclear spins in NMR spectroscopy.

In general, U is in a compact Lie group G (such as SU n ), with X d , X j in its real semisimple (no abelian ideals) Lie algebra g and

U ̇ = X d + j u j t X j U , U 0 = 1 . E15

Given the Cartan decomposition g = p k , where X d p , X j LA = k and K = exp k (product of exponentials of k ) a closed subgroup of G, We want to find the minimum time to steer this system between points of interest, assuming no bounds on our controls u j t . Since X j LA = k , any rotation (evolution) in subgroup K can be synthesized with evolution of X j [25, 26]. Since there are no bounds on u j t , this can be done in arbitrarily small time [4]. We call this G K problem.

The special structure of this problem helps in complete description of the reachable set [27]. The elements of the reachable set at time T , takes the form U T

S = K 1 exp T k α k W k X d W k 1 K 2 , E16

where K 1 , K 2 , W k exp k , and W k X d W k 1 all commute, and α k > 0 , α k = 1 . This reachable set is formed from evolution of K 1 , K 2 and commuting Hamiltonians W k X d W k 1 . Unbounded control suggests that K 1 , K 2 , W k can be synthesized in negligible time.

This reachable set can be understood as follows. The Cartan decomposition of the Lie algebra g , in Eq. (13) leads to a decomposition of the Lie group G [24]. Inside p is contained the largest abelian subalgebra, denoted as a . Any X p is Ad K conjugate to an element of a , i.e. X = Ka 1 K 1 for some a 1 a .

Then, any arbitrary element of the group G can be written as

G = K 0 exp X = K 0 exp Ad K a 1 = K 1 exp a 1 K 2 , E17

for some X p where K i K and a 1 a . The first equation is a fact about geodesics in G / K space [24], where K = exp k is a closed subgroup of G . Eq. (17) is called the KAK decomposition [24].

The results in this chapter suggest that K 1 and K 2 can be synthesized by unbounded controls X i in negligible time. The time consuming part of the evolution exp a 1 is synthesized by evolution of Hamiltonian X d . Time optimal strategy suggests evolving X d and its conjugates W k X d W k 1 where W k X d W k 1 all commute.

Written as evolution

G = K 1 k exp t k W k X d W k 1 K 2 = K 1 k W k exp t k X d W k 1 K 2 .

where K 1 , K 2 , W k take negligible time to synthesize using unbounded controls u i and time-optimality is characterized by synthesis of commuting Hamiltonians W k X d W k 1 . This characterization of time optimality, involving commuting Hamiltonians is derived using convexity ideas [4, 28]. The remaining chapter develops these notions.

The chapter is organized as follows. In Section 2, we study the SU n SO n problem. In Section 3, we study the general G K problem. The main contribution of the chapter is, we carry out a global analysis of time optimality.

Given Lie algebra g , we use killing form x y = tr ad x ad y as an inner product on g . When g = su n , we also use the inner product x y = tr x y . We call this standard inner product.

Advertisement

2. Time optimal control for SU n / SO n problem

Remark 1. Birkhoff’s convexity states, a real n × n matrix A is doubly stochastic ( i   A ij = j   A ij = 1 , for A ij 0 ) if it can be written as convex hull of permutation matrices P i (only one 1 and everything else zero in every row and column). Given Θ SO n and X = λ 1 0 0 0 λ 2 0 0 0 λ n , we have diag Θ X Θ T = B diag X where diag X is a column vector containing diagonal entries of X and B ij = Θ ij 2 and hence i   B ij = j   B ij = 1 , making B a doubly stochastic matrix, which can be written as convex sum of permutations. Therefore B diag X = i α i P i diag X , i.e. diagonal of a symmetric matrix Θ X Θ T , lies in convex hull of its eigenvalues and its permutations. This is called Schur convexity.

Remark 2. G = SU n has a closed subgroup K = SO n and a Cartan decomposition of its Lie algerbra g = su n as g = p k , for k = so n and p = iA where A is traceless symmetric and a is maximal abelian subalgebra of p , such that a = i λ 1 0 0 0 0 0 λ n , where i λ i = 0 . KAK decomposition in Eq. (17) states for U SU n , U = Θ 1 exp Ω Θ 2 where Θ 1 , Θ 2 SO n and

Ω = i λ 1 0 0 0 0 0 λ n ,

where i λ i = 0 .

Remark 3. We now give a proof of the reachable set (16), for the SU n SO n problem. Let U t SU n be a solution to the differential Eq. (14)

U ̇ = X d + i u i X i U , U 0 = I .

To understand the reachable set of this system we make a change of coordinates P t = K t U t , where, K ̇ = i u i X i K . Then

P ̇ t = Ad K t X d P t , Ad K X d = KXK 1 .

If we understand reachable set of P t , then the reachable set in Eq. (14) is easily derived.

Theorem 1. Let P t SU n be a solution to the differential equation

P ̇ = Ad K t X d P ,

and K t SO n and X d = i λ 1 0 0 0 λ 2 0 0 0 λ n . The elements of the reachable set at time T , take the form K 1 exp iμT K 2 , where K 1 , K 2 SO n and μ λ ( μ lies in convex hull of λ and its permutations), where λ = λ 1 λ n .

Proof. As a first step, discretize the evolution of P t , as piecewise constant evolution, over steps of size τ . The total evolution is then

P n = i exp Ad k i X d τ , E18

For t n 1 τ , choose small step Δ , such that t + Δ < , then P t + Δ = exp Ad K X d Δ P t .

By KAK, P t = K 1 exp i ϕ 1 0 0 0 0 exp i ϕ 2 0 0 0 0 0 0 0 0 exp i ϕ n A K 2 , where K 1 , K 2 SO n . To begin with, assume eigenvalues ϕ j ϕ k , where n is an integer. When we take a small step of size Δ , P t changes to P t + Δ as K 1 , K 2 , A change to

K 1 t + Δ = exp Ω 1 Δ K 1 , K 2 t + Δ = exp Ω 2 Δ K 2 , A t + Δ = exp a Δ A ,

where, Ω 1 , Ω 2 k and a a . Let Q t + Δ = K 1 t + Δ A t + Δ K 2 t + Δ , which can be written as

Q t + Δ = exp Ω 1 Δ K 1 exp a Δ A exp Ω 2 Δ K 2 . E19
Q t + Δ = exp Ω 1 Δ exp K 1 a K 1 Δ exp K 1 A Ω 2 A K 1 Δ P t . E20

Observe

P t + Δ = exp Ad K X d Δ P t . E21

We equate P t + Δ and Q t + Δ to first order in Δ . This gives,

Ad K X d = Ω 1 + K 1 a K 1 + K 1 A Ω 2 A K 1 . E22

Multiplying both sides with K 1 K 1 gives

Ad K ¯ X d = Ω 1 + a + A Ω 2 A . E23

where, K ¯ = K 1 K and Ω 1 = K Ω K .

We evaluate A Ω 2 A , for Ω 2 so n .

A Ω 2 A kl = exp i ϕ k ϕ l Ω 2 kl = cos ϕ k ϕ l Ω 2 kl S kl + i sin ϕ k ϕ l Ω 2 kl R kl . E24

such that S is skew symmetric and R is traceless symmetric matrix with iR p . Note iR a and onto a , by appropriate choice of Ω 2 .

Given Ad K ¯ X d p , we decompose it as

Ad K ¯ X d = P Ad K ¯ X d + Ad K ¯ X d = Ω 1 + a + A Ω 2 A ,

with P denoting the projection onto a ( a = i λ 1 0 0 0 0 0 λ n , where i λ i = 0 .) w.r.t to standard inner product and Ad K ¯ X d to the orthogonal component. In Eq. (24), ϕ k ϕ l 0 , π , we can solve for Ω 2 kl such that iR = Ad K ¯ X d . This gives Ω 2 . Let a = P Ad K ¯ X d and choose Ω 1 = Ad K ¯ X d A Ω 2 A = S k .

With this choice of Ω 1 , Ω 2 and a , P t + Δ and Q t + Δ are matched to first order in Δ and

P t + Δ Q t + Δ = o Δ 2 .

Consider the case, when A is degenerate. Let,

A = A 1 0 0 0 A 2 0 0 0 A n , E25

where A k is n k fold degenerate (modulo sign) described by n k × n k block. WLOG, we arrange

A k = exp i ϕ k I r × r 0 0 I s × s . E26

Consider the decomposition

Ad K ¯ X d = P Ad K ¯ X d + Ad K ¯ X d ,

where P denotes projection onto n k × n k blocks in Eq. (25) and Ad K X d , the orthogonal complement.

P X 11 X 12 X 1 n X 21 X 22 X 2 n X n 1 X n 2 X nn = X 11 0 0 0 X 22 0 0 0 X nn , E27

where X ij are blocks.

Then we write

Q t + Δ = exp Ω 1 Δ K 1 exp P Ad K ¯ X d Δ A exp Ω 2 Δ K 2 . E28

where in Eq. (24) we can solve for Ω 2 kl such that iR = Ad K ¯ X d . This gives Ω 2 . Choose, Ad K ¯ X d A Ω 2 A = Ω 1 k , this gives Ω 1 = K 1 Ω 1 K 1 . Again P t + Δ Q t + Δ = o Δ 2 . We write Eq. (28) slightly differently.

Let H 1 be a rotation formed from block diagonal matrix

H 1 = Θ 1 0 0 0 Θ 2 0 0 0 Θ n , E29

where Θ k is n k × n k sub-block in SO n k . H 1 = exp h 1 is chosen such that

H 1 P Ad K ¯ X d H 1 = a

is a diagonal matrix. Let H 2 = exp ( A 1 h 1 A h 2 , where h 2 is skew symmetric, such that

h 1 = θ 1 0 0 0 θ 2 0 0 0 θ n , h 2 = θ ̂ 1 0 0 0 θ ̂ 2 0 0 0 θ ̂ n , E30

where

θ k , θ ̂ k is n k × n k sub-block in so n k , related by (see 26)

θ ̂ k = A k θ k A k , θ k = θ 11 r × r θ 12 θ 12 θ 22 s × s , θ ̂ k = θ 11 θ 12 θ 12 θ 22 E31

Note H 1 P Ad k X d H 1 = a lies in convex hull of eigenvalues of X d . This is true if we look at the diagonal of H 1 Ad K X d H 1 , it follows from Schur Convexity. The diagonal of H 1 Ad k X d H 1 is zero as its inner product

tr a 1 H 1 Ad k X d H 1 = tr H 1 a 1 H 1 Ad k X d = 0 .

as H 1 a 1 H 1 has block diagonal form which is perpendicular to Ad k X d . Therefore diagonal of H 1 P Ad k X d H 1 is same as diagonal of H 1 Ad K X d H 1 .

Now using H 1 AH 2 = A , from 28, we have

Q t + Δ = exp Ω 1 Δ K 1 exp P Ad K ¯ X d Δ H 1 AH 2 exp Ω 2 Δ K 2 . E32
Q t + Δ = exp Ω 1 Δ K 1 H 1 exp a Δ AH 2 exp Ω 2 Δ K 2 . E33

where the above expression can be written as

Q t + Δ = exp Ω 1 Δ exp K 1 H 1 a H 1 K 1 Δ exp K 1 A Ω 2 A K 1 Δ P t .

where Ω 1 , H 1 , a , Ω 2 , are chosen such that

Ω 1 + K 1 H 1 a H 1 K 1 + K 1 A Ω 2 A K 1 = Ad K X d .
Ω 1 + H 1 a H 1 + A Ω 2 A = Ad K ¯ X d .
Q t + Δ P t + Δ = o Δ 2 P t .
Q t + Δ = I + o Δ 2 P t + Δ .
Q t + Δ Q t + Δ T = I + o Δ 2 P t + Δ P T t + Δ I + o Δ 2 = P t + Δ P T t + Δ I + o Δ 2 .
P t + Δ P T t + Δ = K 1 exp i 2 ϕ 1 0 0 0 exp i 2 ϕ 2 0 0 0 exp i 2 ϕ n K 1 T .

Let F = P t + Δ P T t + Δ and G = Q t + Δ Q T T + Δ we relate the eigenvalues, of F and G . Given F , G , as above, with F G ε , and a ordered set of eigenvalues of F, denote λ F = exp i 2 ϕ 1 exp i 2 ϕ 2 exp i 2 ϕ n , there exists an ordering (correspondence) of eigenvalues of G , such that λ F λ G < ε .

Choose an ordering of λ G call μ that minimizes λ F λ G .

F = U 1 D λ U 1 and G = U 2 D μ U 2 , where D λ is diagonal with diagonal as λ , let U = U 1 U 2 ,

F G 2 = D λ UD μ U 2 = λ 2 + μ 2 tr D λ UD μ U + UD μ U D λ ,

By Schur convexity,

tr D λ UD μ U + UD μ U D λ = i α i λ P i μ + P i μ λ ,

where P i are permutations. Therefore F G 2 > λ μ 2 .

Therefore,

λ QQ T t + Δ = λ PP T t + Δ + o Δ 2 .

The difference

o Δ 2 = exp Ω 1 + K 1 H 1 a H 1 K 1 + K 1 A Ω 2 A K 1 Δ exp Ad K X d Δ exp Ω 1 Δ exp K 1 H 1 a H 1 K 1 Δ exp K 1 A Ω 2 A K 1 Δ ,

is regulated by size of Ω 2 , which is bounded by Ω 2 X d sin ϕ i ϕ j , where sin ϕ i ϕ j is smallest non-zero difference. Δ is chosen small enough such that o Δ 2 < ε Δ .

For each point t 0 T , we choose an open nghd N t = t N t t + N t , such that o t Δ 2 < ε Δ for Δ N t . N t forms a cover of 0 T . We can choose a finite subcover centered at t 1 , , t n (see Figure 1A). Consider trajectory at points P t 1 , , P t n . Let t i , i + 1 be the point in intersection of N t i and N t i + 1 . Let Δ i + = t i , i + 1 t i and Δ i + 1 = t i + 1 t i , i + 1 . We consider points P t i , P t i + 1 , P t i , i + 1 , Q t i + Δ i + Q i + , Q t i + 1 Δ i + 1 Q i + 1 as shown in Figure 1B.

Figure 1.

A. Collection of overlapping neighborhoods forming the finite subcover. B. Depiction of P i , P i + 1 , Q i + , Q i , P i , i + 1 as in proof of Theorem 1.

Then we get the following recursive relations.

λ Q i + Q i + T = exp 2 a i + Δ i + λ P i P i T E34
λ P i , i + 1 P i , i + 1 T = λ Q i + Q i + T + o Δ i + 2 E35
λ Q i + 1 Q i + 1 T = λ P i , i + 1 P i , i + 1 T + o Δ i + 1 2 E36
exp 2 a i + 1 Δ i + 1 λ P i + 1 P i + 1 T = λ Q i + 1 Q i + 1 T E37

where a i + and a i + 1 correspond to a in Eq. (33) and lie in the convex hull of the eigenvalues X d .

Adding the above equations,

λ P i + 1 P i + 1 T = exp o Δ 2 exp ( 2 a i + Δ i + + a i + 1 Δ i + 1 λ P i P i . E38
λ P n P n T = exp ( o Δ 2 εT exp 2 i a i + Δ i + + a i + 1 Δ i + 1 λ P 1 P 1 T . E39

where o Δ 2 in Eq. (38) is diagonal.

λ P n P n T = exp ( o Δ 2 εT exp 2 T k α k P k λ λ P 1 P 1 T = exp ( o Δ 2 εT exp 2 μT λ P 1 P 1 T , E40

where μ λ and P 1 = I .

P n = K 1 exp 1 2 o Δ 2 εT exp μT K 2 . E41

Note, P n K 1 exp μT K 2 = o ε . This implies that P n belongs to the compact set K 1 exp μT K 2 , else it has minimum distance from this compact set and by making Δ 0 and hence ε 0 , we can make this arbitrarily small. In Eq. (18), P n P T as τ 0 . Hence P T belongs to compact set K 1 exp μT K 2 . q.e.d.

Corollary 1. Let U t SU n be a solution to the differential equation

U ̇ = X d + i u i X i U ,

where X i LA , the Lie algebra generated by X i , is so n and X d = i λ 1 0 0 0 λ 2 0 0 0 λ n . The elements of reachable set at time T , takes the form U T K 1 exp iμT K 2 , where K 1 , K 2 SO n and μ λ , where λ = λ 1 λ n and the set S = K 1 exp iμT K 2 belongs to the closure of reachable set.

Proof. Let V t = K t U t , where, K ̇ = i u i X i K . Then

V ̇ t = Ad K t X d V t .

From Theorem 1, we have V T K 1 exp iμT K 2 . Therefore U T K 1 exp iμT K 2 . Given

U = K 1 exp iμT K 2 = K 1 exp i j α j P j λ T K 2 = K 1 j exp it j X d K j , t j = T .

We can synthesize K j in negligible time, therefore U T U < ε , for any desired ε . Hence U is in closure of reachable set. q.e.d.

Remark 4. We now show how Remark 2 and Theorem 1 can be mapped to results on decomposition and reachable set for coupled spins/qubits. Consider the transformation

W = exp I y S y exp i π 2 I z

The transformation maps the algebra k = su 2 × su 2 = I α S α to k 1 = so 4 , four dimensional skew symmetric matrices, i.e., Ad W k = k 1 . The transformation maps p = I α S β to p 1 = iA , where A is traceless symmetric and maps a = i I x S x I y S y I z S z to a 1 = i S z 2 I z 2 I z S z , space of diagonal matrices in p 1 , such that a x I x S x + a y I y S y + a z I z S z gets mapped to the four vector (the diagonal) λ 1 λ 2 λ 3 λ 4 = a y + a z a x a x + a y a z a x + a y + a z a x + a z a y .

Corollary 2. Canonical decomposition. Given the decomposition of SU(4) from Remark 2, we can write

U = exp Ω 1 exp i λ 1 0 0 0 0 0 λ 4 exp Ω 2 ,

where Ω 1 , Ω 2 so 4 . We write above as

U = exp Ω 1 exp i a x 2 S z + a y 2 I z + a z I z S z exp Ω 2 ,

Multiplying both sides with W . W gives

W UW = K 1 exp ia x I x S x + a y I y S y + a z I z S z K 2 ,

where K 1 , K 2 SU 2 × SU 2 local unitaries and we can rotate to a x a y a z .

Corollary 3. Digonalization. Given iH c = i αβ J αβ I α S β , there exists a local unitary K such that

K iH c K = i a x I x S x + a y I y S y + a z I z S z , a x a y a z .

Note W iH c W p 1 . Then choose Θ SO n such that Θ W iH c W Θ = i a x 2 S z + a y 2 I z + a z I z S z and hence

W exp Ω W iH c W exp Ω W = i a x I x S x + a y I y S y + a z I z S z .

where K = W exp Ω W is a local unitary. We can rotate to ensure a x a y a z .

Corollary 4. Given the evolution of coupled qubits U ̇ = i H c + j u j H j U , we can diagonalize H c = αβ J αβ I α S β by local unitary X d = K H c K = a x I x S x + a y I y S y + a z I z S z , a x a y a z , which we write as triple a x a y a z . From this, there are 24 triples obtained by permuting and changing sign of any two by local unitary. Then U T S where

S = K 1 exp T i α i a i b i c i K 2 , α i > 0 i α i = 1 .

Furthermore S belongs to the closure of the reachable set. Alternate description of S is

U = K 1 exp i α I x S x + β I y S y + γ I z S z K 2 , α β γ ,

α a x T and α + β ± γ a x + a y ± a z T .

Proof. Let V t = K t U t , where K ̇ = i j u j X j K . Then

V ̇ t = Ad K t iX d V t .

Consider the product

V = i exp Ad K i iX d Δ t

where K i SU 2 SU 2 and X d = a x I x S x + a y I y S y + a z I z S z , where a x a y a z . Then,

WV W = i exp Ad WK i W iWX d W Δ t

Observe WK i W SO 4 and WX d W = diag λ 1 λ 2 λ 4 . Then using results from Theorem 1, we have

WV W = J 1 exp J 2 = J 1 exp i j α j P j λ J 2 , J 1 , J 2 SO 4 , μ λT

Multiplying both sides with W W , we get

V = K 1 exp T i α i a i b i c i K 2 , α i > 0 i α i = 1 .

which we can write as

V = K 1 exp i α I x S x + β I y S y + γ I z S z K 2 , α β γ ,

where using μ λT , we get,

α + β γ a x + a y a z T E42
α a x T E43
α + β + γ a x + a y + a z T . E44

Furthermore U = KV . Hence the proof. q.e.d.

Advertisement

3. Time optimal control for G / K problem

Remark 5. Stabilizer: Let g = p k be Cartan decomposition of real semisimple Lie algebra g and a p be its Cartan subalgebra. Let a a . ad a 2 : p p is symmetric in basis orthonormal wrt to the killing form. We can diagonalize ad a 2 . Let Y i be eigenvectors with nonzero (negative) eigenvalues λ i 2 . Let X i = a Y i λ i , λ i > 0 .

ad a Y i = λ i X i , ad a X i = λ i Y i .

X i are independent, as α i X i = 0 implies α i λ i Y i = 0 . Since Y i are independent, X i are independent. Given X X i , then a X = 0 , otherwise we can decompose it in eigenvectors of ad a 2 , i.e., a X = i α i a i + j β j Y j , where a i are zero eigenvectors of ad a 2 . Since 0 = X [ a a X = a X 2 , which means a X = 0 . This is a contradiction. Y i are orthogonal, implies X i are orthogonal, a Y i a Y j = [ a , a Y i Y j = λ i 2 Y i Y j = 0 . Let k 0 k satisfy a k 0 = 0 . Then k 0 = X i .

Y ˜ i denote eigenvectors that have λ i as non-zero integral multiples of π . X ˜ i are ad a related to Y ˜ i . We now reserve Y i for non-zero eigenvectors that are not integral multiples of π .

Let

f = a i Y ˜ i , h = k 0 X ˜ i ,

X ˜ i , X l , k j where k j forms a basis of k 0 , forms a basis of k . Let A = exp a .

AkA 1 = A i α i X i + l α l X ˜ l + j α j k j A , where k k

AkA 1 = i α i cos λ i X i sin λ i Y i + l ± α l X ˜ l + j α j k j

The range of A A 1 in p , is perpendicular to f . Given Y p such that Y f . The norm X of X k , such that p part of AXA 1 p = Y satisfies

X Y sin λ s . E45

where λ s 2 is the smallest nonzero eigenvalue of ad a 2 such that λ s is not an integral multiple of π .

A 2 kA 2 stabilizes h k and f p . If k k , is stabilized by A 2 A 2 , λ i = , i.e., k h . This means h is an subalgebra, as the Lie bracket of y z k for y , z h is stabilized by A 2 A 2 .

Let H = exp h , be an integral manifold of h . Let H ˜ K be the solution to A 2 H ˜ A 2 = H ˜ or A 2 H ˜ H ˜ A 2 = 0 . H ˜ is closed, H H ˜ . We show that H ˜ is a manifold. Given element H 0 H ˜ K , where K is closed, we have a exp B δ k nghd of H 0 , in exp B δ ball nghd of H 0 , which is one to one. For x B δ k , A 2 exp x A 2 = exp x , implies,

A 2 exp i α i X i + l β l X ˜ l + j γ j k j H 0 A 2 = exp i α i cos 2 λ i X i sin 2 λ i Y i + l β l X ˜ l + j γ j k j H 0 = exp i α i X i + l β l X ˜ l + j γ j k j H 0 ,

then by one to one property of exp B δ , we get α i = 0 and x h . Therefore exp B δ h H 0 is a nghd of H 0 .

Given a sequence H i exp h converging to H 0 , for n large enough H n exp B δ h H 0 . Then H 0 is in invariant manifold exp h . Hence exp h is closed and hence compact.

Let y f , then there exists a h 0 h such that exp h 0 y exp h 0 a . We maximize the function a r exp h y exp h , over the compact group exp h , for regular element a r a and . . is the killing form. At the maxima, we have at t = 0 , d dt a r exp h 1 t exp h 0 y exp h 0 exp h 1 t = 0 .

a r h 1 exp h 0 y exp h 0 = h 1 a r exp h 0 y exp h 0 ,

if exp h 0 y exp h 0 a , then a r exp h 0 y exp h 0 k . The bracket a r exp h 0 y exp h 0 is Ad A 2 invariant and, hence, belongs to h . We can choose h 1 so that gradient is not zero. Hence exp h 0 y exp h 0 a . For z p such that z f , we have exp h 0 z exp h 0 a .

a exp h 0 z exp h 0 = exp h 0 a exp h 0 z = 0 ,

as exp h 0 a exp h 0 is Ad A 2 invariant, hence exp h 0 a exp h 0 f . In above, we worked with killing form. For g = su n , we may use standard inner product.

Remark 6. Kostant’s convexity: [28] Given the decomposition g = p k , let a p and X a ,. Let W i exp k such that W i X W i a are distinct, Weyl points. Then projection (w.r.t killing form) of Ad K X on a lies in convex hull of these Weyl points. The C be the convex hull and let projection P Ad K X lie outside this Hull. Then there is a separating hyperplane a , such that Ad K X a < C a . W.L.O.G we can take a to be a regular element. We minimize Ad K X a , with choice of K and find that minimum happens when Ad K X a = 0 , i.e. Ad K X is a Weyl point. Hence P Ad K X i α i W i X W i 1 , for α i > 0 and i α i = 1 . The result is true with a projection w.r.t inner product that satisfies x y z = x y z , like standard inner product on g = su n .

Theorem 2 Given a compact Lie group G and Lie algebra g . Consider the Cartan decomposition of a real semisimple Lie algebra g = p k . Given the control system

X ̇ = Ad K t X d X , P 0 = 1

where X d a , the Cartan subalgebra a p and K t exp k , a closed subgroup of G . The end point

P T = K 1 exp T i α i W i X d K 2 ,

where K 1 , K 2 exp k and W i X d a are Weyl points, α i > 0 and i α i = 1 .

Proof. As in proof of Theorem 1, we define

P t + Δ = exp Ad K X d Δ P t = exp Ad K X d Δ K 1 exp a K 2

and show that

exp Ad K X d Δ K 1 AK 2 = K a exp a 0 Δ + C Δ 2 AK b = K a exp a + a 0 Δ + C Δ 2 K b , E46

where for K ¯ = K 1 1 K ,

Ad K ¯ X d = P Ad K ¯ X d a 0 + Ad K ¯ X d .

where P is projection w.r.t killing form and a 0 f , the centralizer in p as defined in Remark 5, C Δ 2 f is a second order term that can be made small by choosing Δ . K a , K b exp k .

To show Eq. (46), we show there exists K 1 , K 2 K such that

exp k 1 K 1 exp Ad K ¯ X d Δ exp A k 2 A 1 K 2 = exp a 0 Δ + C Δ 2 , E47

where K 1 and K 2 are constructed by a iterative procedure as described in the proof below.

Given X and Y as N × N matrices, considered elements of a matrix Lie algebra g , we have,

log e X e Y X + Y = n > 0 1 n 1 n 1 i n X r 1 Y s 1 X r n Y s n i = 1 n r i + s i r 1 ! s 1 ! r n ! s n ! , E48

where r i + s i > 0 .

We bound the largest element (absolute value) of log e X e Y X + Y , denoted as log e X e Y X + Y 0 , given X 0 < Δ and Y 0 < b 0 Δ k , where k 1 , Δ < 1 , b 0 Δ < 1 .

log e X e Y X + Y 0 n = 1 Nb 0 e Δ k + 1 + n > 1 1 n 2 Ne 2 n b 0 Δ n + k 1 n E49
Nb 0 e Δ k + 1 + Ne 2 2 b 0 Δ k + 1 1 + 2 Ne 2 Δ + E50
Nb 0 e Δ k + 1 + Ne 2 2 b 0 Δ k + 1 1 2 Ne 2 Δ M ˜ b 0 Δ k + 1 E51

where 2 N Δ < 1 and M ˜ Δ < 1 .

Given decomposition of g = p k , p k with respect to the negative definite killing form B X Y = tr ad X ad Y . Furthermore there is decomposition of p = a a .

Given

U 0 = exp a 0 Δ + b 0 Δ + c 0 Δ ,

where a 0 a , b 0 a and c 0 k , such that a 0 0 + b 0 0 + c 0 0 < 1 , which we just abbreviate as a 0 + b 0 + c 0 < 1 (we follow this convention below).

We describe an iterative procedure

U n = Π k = 1 n exp c k Δ U 0 Π k = 0 n exp b k Δ , E52

where c k k and b k a , such that the limit

n U n = exp a 0 Δ + C Δ 2 , E53

where a 0 , C a .

U 1 = exp c 0 Δ exp a 0 Δ + b 0 Δ + c 0 Δ exp b 0 Δ = exp a 0 Δ + b 0 Δ + c 0 Δ 2 exp b 0 Δ = exp a 0 Δ + b 0 Δ 2 + c 0 Δ 2 = exp a 1 + b 1 + c 1 Δ

Note b 0 and c 0 are elements of g and need not be contained in a and k .

Where, using bound in c 0 M ˜ c 0 , which gives a 0 + b 0 + c 0 Δ a 0 + b 0 + c 0 . Using the bound again, we obtain, b 0 M ˜ b 0 . We can decompose, b 0 + c 0 Δ , into subspaces a 0 + b 1 + c 1 , where a 0 M b 0 + c 0 Δ , b 1 M b 0 + c 0 Δ and c 1 M b 0 + c 0 Δ , where B X X λ max X 2 , where X is Frobenius norm and B X X λ min X 2 . Let M = N λ max λ min .

This gives, a 0 M b 0 + c 0 Δ , b 1 M b 0 + c 0 Δ and c 1 M b 0 + c 0 Δ . This gives

a 1 a 0 + M ˜ M b 0 + c 0 Δ   b 1 M ˜ M b 0 + c 0 Δ   c 1 M ˜ M b 0 + c 0 Δ

For 4 M ˜ M Δ < 1 , we have, a 1 + b 1 + c 1 a 0 + b 0 + c 0 . Continuing and using b k + c k 2 M ˜ M Δ b k 1 + c k 1 2 M ˜ M Δ k b 0 + c 0 .

Similarly,

a k a k 1 0 2 M ˜ M Δ k b 0 + c 0

Note, a k b k c k is a Cauchy sequences which converges to a ,0,0 , where

a a 0 0 b 0 + c 0 k = 1 2 M ˜ M Δ k 2 M M ˜ Δ b 0 + c 0 1 2 M ˜ M Δ C Δ ,

where C = 4 M ˜ M b 0 + c 0 .

The above exercise was illustrative. Now we use an iterative procedure as above to show Eq. (47).

Writing

Ad K ¯ X d = P Ad K ¯ X d a 0 + Ad K ¯ X d b 0 ,

where a 0 f and b 0 f , consider again the iterations

U 0 = exp c ¯ 0 Δ exp a 0 Δ + b 0 Δ exp b 0 Δ + c ¯ 0 Δ = exp c ¯ 0 Δ exp a 0 Δ + c ¯ 0 Δ + b 0 Δ 2 = exp a 0 Δ + b 0 Δ 2 + c 0 Δ 2 = exp a 1 Δ + b 1 Δ + c 1 Δ

We refer to Remark 5, Eq. (45). Given b 0 Δ p such that b 0 Δ f . If A k A = b 0 Δ + c ¯ 0 Δ , then k h b 0 Δ (killing norm).

c ¯ 0 k , is bounded c ¯ 0 Mhb 0 , where M as before converts between two different norms. Using bounds derived above b 0 M ˜ Mh + 1 b 0 , and c 0 M ˜ Mhb 0 , 2 M ˜ Mh + 1 Δ < 1 , we obtain.

which gives a 0 + b 0 Δ + c ¯ 0 a 0 + b 0 M ˜ Mh + 1 Δ + Mh 1 . For appropriate M , we have

a 1 a 0 + M 3 b 0 + c 0 Δ b 1 M 3 b 0 + c 0 Δ c 1 M 3 b 0 + c 0 Δ

we obtain

a 1 + b 1 + c 1 a 0 + M b 0 + c 0 Δ a 0 + b 0 + c 0

where Δ is chosen small.

U 1 = exp c 1 + c ¯ 1 Δ exp a 1 Δ + b 1 Δ + c 1 Δ exp b 1 Δ + c ¯ 1 Δ = exp c 1 + c ¯ 1 Δ exp a 1 Δ + c 1 + c ¯ 1 Δ + b 1 Δ 2 = exp a 1 Δ + b 1 Δ 2 + c 1 Δ 2 = exp a 2 Δ + b 2 Δ + c 2 Δ

where c ¯ 1 k , such that c ¯ 1 Mhb 1 .

where, using bounds derived above b 1 M ˜ Mh + 1 b 1 , and c 1 M ˜ Mhb 1 + c 1 , where using the bound 2 M ˜ Mh + 1 Δ < 1 , we obtain

which gives a 1 + b 1 Δ + c 1 + c ¯ 1 a 1 + 1 + Mh b 1 + c 1 a 0 + b 0 + c 0 .

We can decompose, b 1 + c 1 Δ 2 , into subspaces a 1 + b 2 + c 2 Δ , where a 1 M b 1 + c 1 Δ , b 2 M b 1 + c 1 Δ and c 2 M b 1 + c 1 Δ , where M as before converts between two different norms.

This gives

a 2 a 1 + 4 M ˜ M 2 h b 1 + c 1 Δ   b 2 4 M ˜ M 2 h b 1 + c 1 Δ   c 2 4 M ˜ M 2 h b 1 + c 1 Δ

For x = 8 M ˜ M 2 h Δ < 2 3 , we have, a 2 + b 2 + c 2 a 1 + b 1 + c 1 a 0 + b 0 + c 0 ,

Using b k + c k x b k 1 + c k 1 x k b 0 + c 0 .

Similarly,

a k a k 1 0 x k b 0 + c 0

Note, a k b k c k is a Cauchy sequences which converges to a ,0,0 , where

a a 0 0 x b 0 + c 0 k = 0 x k x b 0 + c 0 1 x C Δ ,

where C = 16 M ˜ M 2 h b 0 + c 0 .

The above iterative procedure generates k 1 and k 2 in Eq. (47), such that

exp K 1 Ad K X d K 1 Δ = exp k 1 exp a 0 Δ + C Δ 2 exp A k 2 A .

where a 0 Δ + C Δ 2 f . By using a stabilizer H 1 , H 2 , we can rotate them to a such that

exp Ad K X d Δ K 1 AK 2 = K a H 1 exp a 0 Δ + C Δ 2 AH 2 K b

such that H 1 1 a 0 Δ + C Δ 2 H 1 = a 0 Δ + C Δ 2 is in a and a 0 = P H 1 1 a 0 H 1 is projection onto a such that

P H 1 1 a 0 H 1 = k α k W k X d .

This follows because the orthogonal part of Ad K ¯ X d to f written as Ad K ¯ X d remains orthogonal of f

H 1 Ad K X d H a = Ad K X d H a H 1 = Ad K X d a ' = 0

( a f ), remains orthogonal to a . Therefore P H 1 1 a 0 H 1 = P H 1 1 Ad K ¯ X d H 1 = k α k W k X d .

exp Ad K X d Δ K 1 AK 2 = K a exp a + a 0 Δ + C Δ 2 K b .

Lemma 1 Given P = K 1 exp a + a 1 Δ A 1 K 2 = K 3 exp b b 1 Δ A 2 K 4 , where a , b , a 1 , b 1 a . We can express

exp b = K a exp a + a 1 Δ + W b 1 Δ K b ,

where W b 1 is Weyl element of b 1 . Furthermore

exp b + b 2 Δ = K a exp a + a 1 Δ + W b 1 Δ + W b 2 Δ K b .

Proof. Note, A 2 = K 3 1 PK 4 1 , commutes with b 1 . This implies

A 2 = K ˜ exp a + a 1 Δ K commutes with b 1 . This implies A 2 b 1 A 2 1 = b 1 , i.e., K ˜ exp a + a 1 Δ Ad K b 1 exp a + a 1 Δ K ˜ ' = b 1 , which implies that Ad K b 1 f . Recall, from Remark 5,

exp a + a 1 Δ Ad K b 1 exp a + a 1 Δ = k c k Y k cos λ k + X k sin λ k .

This implies k c k sin λ k X k = 0 , implying λ k = . Therefore,

exp 2 a + a 1 Δ Ad K b 1 exp 2 a + a 1 Δ = Ad K b 1 .

We have shown existence of H 1 such that H 1 Ad K b 1 H 1 1 a , using H 1 , H 2 as before,

K ˜ exp a + a 1 Δ K exp b 1 Δ = K ˜ H 2 exp a + a 1 Δ H 1 exp Ad K b 1 Δ K = K a exp a + a 1 Δ + W b 1 Δ K b .

Applying the theorem again to

K a exp a + a 1 Δ + W b 1 Δ K b exp b 2 Δ = K a exp a + a 1 Δ + W b 1 Δ + W b 2 Δ K b .

Lemma 2 Given P i = K 1 i A i K 2 i = K 1 i exp a i K 2 i , we have P i , i + 1 = exp H i + Δ i + P i , and P i , i + 1 = exp H i + 1 Δ i + 1 P i + 1 , where H i + = Ad K i X d . From above we can express

P i , i + 1 = K a i + exp a i + a 1 i + Δ + i + a 2 i + Δ + i 2 K b i + .

where a 1 i + and a 2 i + are first and second order increments to a i in the positive direction. The remaining notation is self-explanatory.

P i , i + 1 = K a i + 1 exp a i + 1 a 1 i + 1 Δ i + 1 a 2 i + 1 Δ i + 1 2 K b i + 1 .
exp a i + 1 = K 1 exp a i + a 1 i + Δ + i + a 2 i + Δ + i 2 + W a 1 i + 1 Δ i + 1 + a 2 i + 1 Δ i + 1 2 K 2 .
W a 1 i + 1 Δ i + 1 + a 2 i + 1 Δ i + 1 2 = P W a 1 i + 1 Δ i + 1 + P W a 2 i + 1 Δ i + 1 2 = k α k W k X d Δ i + 1 + o Δ i + 1 2

where, a i , a 1 i , a 2 i a .

Using Lemma 1 and 2, we can express

P n T = K 1 exp a n exp K 2 = K 1 exp i W a i + Δ i + + W a i + 1 Δ i + 1 exp o Δ 2 εT K 2

Letting ε go to 0 , we have

P n T = K 1 exp T i α i W i X d K 2 .

Hence the proof of theorem. q.e.d.

Advertisement

4. Conclusion

In this chapter, we studied some control problems that derive from time optimal control of coupled spin dynamics in NMR spectroscopy and quantum information and computation. We saw how dynamics was decomposed into fast generators k (local Hamiltonians) and slow generators p (couplings) as a Cartan decomposition g = p k . Using this decomposition, we used some convexity ideas to completely characterize the reachable set and time optimal control for these problems.

References

  1. 1. Nielsen M, Chuang I. Quantum Information and Computation. New York: Cambridge University Press; 2000
  2. 2. Ernst RR, Bodenhausen G, Wokaun A. Principles of Nuclear Magnetic Resonance in One and Two Dimensions. Oxford: Clarendon Press; 1987
  3. 3. Cavanagh J, Fairbrother WJ, Palmer AG, Skelton NJ. Protein NMR spectroscopy. In: Principles and Practice. New York: Academic Press; 1996
  4. 4. Khaneja N, Brockett RW, Glaser SJ. Time optimal control of spin systems. Physical Review A. 2001;63:032308
  5. 5. Khaneja N, Glaser SJ. Cartan decomposition of SU 2 n and control of spin systems. Chemical Physics. 2001;267:11-23
  6. 6. D’Alessandro D. Constructive controllability of one and two spin 1/2 particles. Proceedings 2001 American Control Conference; Arlington, Virginia; June 2001
  7. 7. Kraus B, Cirac JI. Optimal creation of entanglement using a two qubit gate. Physical Review A. 2001;63:062309
  8. 8. Bennett CH, Cirac JI, Leifer MS, Leung DW, Linden N, Popescu S, et al. Optimal simulation of two-qubit hamiltonians using general local operations. Physical Review A. 2002;66:012305
  9. 9. Khaneja N, Glaser SJ, Brockett RW. Sub-Riemannian geometry and optimal control of three spin systems. Physical Review A. 2002;65:032301
  10. 10. Vidal G, Hammerer K, Cirac JI. Interaction cost of nonlocal gates. Physical Review Letters. 2002;88:237902
  11. 11. Hammerer K, Vidal G, Cirac JI. Characterization of nonlocal gates. Physical Review A. 2002;66:062321
  12. 12. Yuan H, Khaneja N. Time optimal control of coupled qubits under non-stationary interactions. Physical Review A. 2005;72:040301(R)
  13. 13. Yuan H, Khaneja N. Reachable set of bilinear control systems under time varying drift. System and Control Letters. 2006;55:501
  14. 14. Zeier R, Yuan H, Khaneja N. Time optimal synthesis of unitary transformations in fast and slow qubit system. Physical Review A. 2008;77:032332
  15. 15. Yuan H, Zeier R, Khaneja N, Lloyd S. Constructing two qubit gates with minimal couplings. Physical Review A. 2009;79:042309
  16. 16. Reiss T, Khaneja N, Glaser S. Broadband geodesic pulses for three spin systems: Time-optimal realization of effective trilinear coupling terms and indirect SWAP gates. Journal of Magnetic Resonance. 2003;165:95
  17. 17. Khaneja N, Glaser S. Efficient transfer of coherence through Ising spin chains. Physical Review A. 2002;66:060301
  18. 18. Khaneja N, Heitmann B, Spörl A, Yuan H, Schulte-Herbrüggen T, Glaser SJ. Shortest paths for efficient control of indirectly coupled qubits. Physical Review A. 2007;75:012322
  19. 19. Yuan H, Zeier R, Khaneja N. Elliptic functions and efficient control of Ising spin chains with unequal couplings. Physical Review A;77:032340
  20. 20. Yuan H, Khaneja N. Efficient synthesis of quantum gates on a three-spin system with triangle topology. Physical Review A;84:062301
  21. 21. Yuan H, Wei D, Zhang Y, Glaser S, Khaneja N. Efficient synthesis of quantum gates on indirectly coupled spins. Physical Review A;89:042315
  22. 22. Redfield AG. The theory of relaxation processes. Advances in Magnetic and Optical Resonance. 1965;1:1-32
  23. 23. Lindblad G. On the generators of quantum dynamical semigroups. Communications in Mathematical Physics. 1976;48:199
  24. 24. Helgason S. Differential Geometry, Lie Groups, and Symmetric Spaces. Cambridge: Academic Press; 1978
  25. 25. Brockett RW. System theory on group manifolds and Coset spaces. SIAM Journal of Control. 1972;10:265-284
  26. 26. Jurdjevic V, Sussmann H. Control systems on lie groups. Journal of Differential Equations. 1972;12:313-329
  27. 27. Jurdjevic V. Geometric Control Theorey. New York: Cambridge University Press; 1997
  28. 28. Kostant B. On convexity, the Weyl group and the Iwasawa decomposition. Annales scientifiques de l’cole Normale Supérieure. 1973;6(4):413-455

Written By

Navin Khaneja

Submitted: 07 March 2018 Reviewed: 28 July 2018 Published: 05 November 2018