• Aucun résultat trouvé

QUANTUM HAMILTONIAN AND DIPOLE MOMENT IDENTIFICATION IN PRESENCE OF LARGE CONTROL PERTURBATIONS

N/A
N/A
Protected

Academic year: 2022

Partager "QUANTUM HAMILTONIAN AND DIPOLE MOMENT IDENTIFICATION IN PRESENCE OF LARGE CONTROL PERTURBATIONS"

Copied!
15
0
0

Texte intégral

(1)

DOI:10.1051/cocv/2016026 www.esaim-cocv.org

QUANTUM HAMILTONIAN AND DIPOLE MOMENT IDENTIFICATION IN PRESENCE OF LARGE CONTROL PERTURBATIONS

Ying Fu

1

and Gabriel Turinici

1,2

Abstract.The problem of recovering the Hamiltonian and dipole moment is considered in a bilinear quantum control framework. The process uses as inputs some measurable quantities (observables) for each admissible control. If the implementation of the control is noisy the data available is only in the form of probability laws of the measured observable. Nevertheless it is proved that the inversion process still has unique solutions (up to phase factors). Both additive and multiplicative noises are considered.

Numerical illustrations support the theoretical results.

Mathematics Subject Classification. 93-XX, 49-XX, 81Q93.

Received September 26, 2014. Revised January 20, 2016. Accepted May 17, 2016.

1. Introduction and motivation

Successful manipulation of quantum dynamics (see [5] and references therein for a recent review) leads to interesting perspectives among which is the possibility to identify the system through measurements of control- dependent observations. This technique, called quantum identification or quantum inversion, was documented both theoretically [1,4,16,23] and numerically [8,11,18]. However although the numerical implementations show interesting robustness of the identification process with respect to noise, there is less theoretical guidance to explain this fact. Two fundamental questions concerning the well-posedness of this problem arise: the existence and the uniqueness of the Hamiltonian, and/or the dipole moment, compatible with the given measurements.

In this work we only study the uniqueness.

More specifically we start from the setting in [16] which treats the case without noise. After some technical preliminaries in Section3 we address the noise-free case in Section4 and relax many of the assumptions used in the previous work. Then in Section5we introduce the possibility that the control is subject at each time to unknown perturbations. We consider both additive and multiplicative noise. Since the actual control that acts on the system is unknown, only the probability laws of the observations are available. We explain which are the properties of the set of measurements required to determine uniquely (up to phase factors) the free Hamiltonian and dipole moment.

Then a numerical implementation is presented in Section6. Some closing remarks are the object of Section7.

Keywords and phrases.Quantum control, quantum identification.

1 Universit´e Paris-Dauphine, PSL Research University, CNRS, Ceremade, 75016 Paris, France.[email protected]

2 Institut Universitaire de France, 1 Rue Descartes, 75231 Paris cedex 05, France.[email protected]

Article published by EDP Sciences c EDP Sciences, SMAI 2017

(2)

1.1. Notations

We introduce the following notations

LM1,M2,...,Mm is the Lie algebra spanned by the matricesM1, M2, . . . , Mm;

for any matrix or vectorXwe denote byXits conjugate (the matrix whose entries are the complex conjugates of the entries ofX) and byX its adjoint (the transpose conjugate);

• HN is the set of all Hermitian matricesHN ={X∈CN×N|X=X};

• SN is the unit sphere ofCN:SN ={v∈CN|v= 1};

Ψ(t, H, u(·), μ, Ψ0) is the solution of the equation (2.1) below; to simplify the notation, when there is no ambiguity, we denote itΨ(t);

λk(X), k = 1, . . . , N are the eigenvalues of X ∈ HN taken in increasing order; we also introduce φk(X) k= 1, . . . , N to be eigenvectors ofX (forming an orthonormal basis ofCN) corresponding to eigenvalues λk(X); note that Span{φk(X)}may not be unique;

SU(N) is the special unitary group of degree N, which is the group of N ×N unitary matrices with determinant 1;

su(N) is the Lie Algebra of skew-Hermitian matrices (the Lie algebra ofSU(N));

2. The model

We present the mathematical framework following closely the notations of the previous work [16].

Consider a controlled quantum system with time-dependent wave-function Ψ(t) satisfying the Schr¨odinger

equation:

˙(t, H, u(·), μ, Ψ0) = (H+u(t)μ)Ψ(t, H, u(·), μ, Ψ0)

Ψ(0, H, u(·), μ, Ψ0) =Ψ0, (2.1)

whereH is the internal (“free”) Hamiltonian andμthe coupling operator between the controlu(t)∈L1loc(R+;R) and the system. We work in a finite dimensional framework, thereforeH, μ∈ HN for someN N. The goal is to determine the matrix entries ofH and μfrom laboratory measurements of some observables depending on Ψ(t). The controlu(t) can be changed in order to gather enough information on the system.

However, contrary to [16], we allow in this work some time independent perturbations to appear in the control u(t). That is, when the control is implemented in practice the nominal control intensity required by the experimentalist, denoted (t), is perturbed byY which means that u=u(t, (·), Y); here Y is a discrete random variable with possible outcomesy1, y2, . . .. We assume that the law of the random variable Y is time independent. A first example is the additive perturbation u(t) = (t) +Y. Such perturbation models have already been used in the quantum computing literature under the name of “fixed systematic errors”, see section VI.A. equation (40) of [14] or “systematic control error”, see [15]. In [19] the authors use a noise model called

“low frequency noise” (see Sect. IV.C. of [12]): it is defined as the portion of the (control) amplitude noise that has a correlation time that is long (up to 103times) compared to the timescale of the dynamics therefore it can be considered as constant in time. Additional noise models (additive or multiplicative) are presented in [24].

The perturbation Y is unknown and thus Ψ(t) is a random variable, as are all measurements depending on Ψ(t). Repeating the control experiment several times the experimentalist will only learn the law of the measurements. From now on we will denote byLYZthe law of the random variableZ (that is measurable with respect to the sigma-algebra generated byY).

Two different settings are considered depending on which parameters are to be identified and the nature of the information available:

Setting(S1): The HamiltonianH is known and the goal is to identify the dipole momentμ.

Setting(S2): Both the HamiltonianH and the dipole momentμare unknown.

The measurements are of the form OΨ(T, H, u, μ, Ψ0), Ψ(T, H, u, μ, Ψ0) with O ∈ HN a member of a list of possible measurements. Often, the experimentalist only measures one observable in a list (but can repeat the

(3)

experiment many times). This means that for general O1, O2 ∈ HN no information is available on the joint distribution of the values O1Ψ(T, H, u, μ, Ψ0), Ψ(T, H, u, μ, Ψ0) and O2Ψ(T, H, u, μ, Ψ0), Ψ(T, H, u, μ, Ψ0) of these two observables.

3. Some technical preliminaries

3.1. Complete sets of commuting observables

We recall in this section several facts about complete sets of commuting observables (hereafter abbreviated CSCO). We refer the reader to ([6], p. 146) for details.

First, recall that an observable is a self-adjoint operator onCN. Once a basis ofCN is chosen the observable can be represented as a matrixO∈ HN.

A set of observables O = {O1, . . . , OK} is called set of commuting observables (named SCO hereafter) if [Ok, O] = 0,∀k, ∈ {1, . . . , K}.

When all observables in the SCO are multiples of the identity operator the SCO is said to be trivial; unless specified otherwise, we only work with non-trivial SCO.

All observables in the SCO Ocan be diagonalized simultaneously i.e., there exists at least an orthonormal basisΦ=1, . . . , φN} ofCN such that anyO ∈ O is diagonal in the basisΦ. This means that in particular any φ is an eigenvector of any observable O ∈ O. In general the basis Φ is not unique because of possible degeneracies in the spectrum of the observables inO. By definition a SCO is called acomplete set of commuting observables (CSCO) if the orthonormal basis that diagonalizes the SCO is unique up to phase factors and permutations,i.e., if{ϕ1, . . . , ϕN}is another orthonormal basis rendering allO∈ Odiagonal then there exists a permutationσof{1, . . . , N}and phasesβ1, . . . , βN Rsuch thatϕk= ekφσ(k) for allk= 1, . . . , N.

Examples:

(1) Let H be a Hamiltonian with all eigenvaluesλ(H) of multiplicity 1. ThenO={H}is a CSCO.

(2) Let {v1, . . . , vN} be an orthonormal basis of CN. Then defining Pk to be the projection on vk (that is Pk =vkvk) the setO={Pk,1≤k≤N}is a CSCO. In this casePk are called populations of the statesvk. (3) ConsiderN = 3 andO={Od} with:

Od=

−1 0 0 0 1/2 0 0 0 1/2

. (3.1)

Because the eigenspace corresponding to the eigenvalue 1/2 is of dimension 2 O is not a CSCO.

In this case both the canonical base of C3: {(1,0,0)T,(0,1,0)T,(0,0,1)T} and the orthonormal basis {(1,0,0)T,(0,1/2,−√

3/2)T,(0,

3/2,1/2)T}renderOd diagonal.

(4) Consider the truncated spin-less Hydrogen atom whose eigenstates can be labeled by a set of three indexes φn,l,mwithn= 1,2, . . . , Nt,l= 0,1, . . . , n−1,m=−l,−l+ 1, . . . , l1, l. HereNtNis a fixed truncation threshold. A CSCO is given by the operators H (Hamiltonian), L2 (square of the angular momentum operator),Lz(thezcomponent of the angular momentum operator) which act on the eigenstateφn,l,mas:

n,l,m=CH

n2φn,l,m, L2φn,l,m=l(l+ 1)2φn,l,m, Lzφn,l,m=n,l,m, (3.2) withCH an universal constant andthe Plank constant. Herenis called principal quantum number,lthe angular momentum quantum number andmthe magnetic quantum number. Note that in this case{H, L2} is a SCO but not a CSCO.

Measuring simultaneously all observables in a CSCO is in principle possible as it is compatible with the Heisenberg uncertainty principle since all observables in a CSCO commute two by two; therefore the values of those observables may be simultaneously computed with infinite precision.

(4)

The following characterization of a CSCO will be used in the following sections:

Lemma 3.1. Let O={O1, . . . , OK} be a SCO. ThenOis a CSCO iff there existγ1, . . . , γKRsuch that all eigenvalues of K

k=1γkOk have multiplicity one.

Proof. We prove first the direct implication. Consider a basisΦ =1, . . . , φN} of CN that renders all Ok diagonal and denote (Ok)jthejth eigenvalue ofOk, that isOkφj= (Ok)jφj. Suppose now by contradiction that for any γ = (γ1, . . . , γK) RK there exists i(γ) =j(γ)≤N, such thatK

k=1γk(Ok)i(γ) =K

k=1γk(Ok)j(γ). Define the functions g1,2 :RK Rby g1,21, . . . , γK) =K

k=1γk[(Ok)1(Ok)2] and let A1,2 = RK;g1,2(γ) = 0}. We obtain that 1≤1<2≤NA1,2 =RK. By the Baire’s theorem at least a couple (1, 2) exists such that A1,2 has non empty interior. Therefore the analytic function g1,2 is null on a non empty open set hence it is null everywhere.

But this means that (Ok)1 = (Ok)2 for all k = 1, . . . , K. Therefore for all Ok ∈ O the 1th eigenvalue is of multiplicity 2 (the 1th eigenvector and the 2th eigenvector are associated to the same eigenvalue) which contradicts the uniqueness of the basis that diagonalizes O, and hence we obtain a contradiction with the definition of a CSCO.

The reverse implication is more straightforward. Any basisΦ=1, . . . , φN}that renders allOk ∈ Odiagonal will also renderK

k=1γkOk diagonal. But by hypothesis all eigenvalues ofK

k=1γkOk are distinct and therefore the basisΦis unique (up to permutation and phases) and henceOis a CSCO.

3.2. Background on controllability results

Let L N and G1, . . . , GL be L finite dimensional, connected, compact and simple Lie groups with the identity elementId. LetA, Bg for all= 1, . . . , L whereg is the Lie algebra ofG.

Definition 3.2. ConsiderLbilinear systems on the Lie groupsG: dX(t)

dt = (A+u(t)B)X(t),

X(0) =Id. (3.3)

The systems are calledsimultaneously controllable (or ensemble controllable)if there existsTA1,...,AL,B1,...,BL >0 such that for all T TA1,...,AL,B1,...,BL and for all V G, = 1, . . . , L arbitrary, there exists a control u∈L1([0, T],R) withX(T) =V,= 1, . . . , L.

LetA=A1 . . .

AL L

=1g andB=B1 . . .

BLL

=1g. The following simultaneous control- lability results are proved in ([21], Thms. 1 & 2 and [3], Lem. 3, p. 29).

Theorem 3.3. The collection (3.3)of L bilinear systems is simultaneously controllable if and only if LA,B = L

=1g or equivalently dimRLA,B=L

=1dimRg.

Lemma 3.4. We suppose thatLA,B =g, for all= 1, . . . , L. ThenLA,B =L

=1gif and only if there exist , ∈ {1, . . . , L},= and an isomorphism f :gg such that f(A) =A andf(B) =B.

Theorem 3.5. LetGbe a finite dimensional, connected, compact and simple Lie group andgbe its Lie algebra.

Let A, B gsuch that LA,B=gandα1,. . . ,αL Rbe real constants, αi j ∀i =j. Consider the collection of control systems on G:

dX(t)

dt ={A+ (u(t) +α)B}X(t),

X(0) =Id. (3.4)

Then the collection of systems (3.4)is simultaneously controllable.

(5)

Remark 3.6. Although the Theorems 3.3 and 3.5 are formulated on a Lie group, this is enough to obtain controllability for the wave-function; recall that if X(t, H, u(·), μ) : R× HN ×L1loc(R+;R)× HN SU(N) satisfies the following equation:

iX˙(t, H, u(·), μ) = (H+u(t)μ)X(t, H, u(·), μ),

X(0, H, u(·), μ) =Id, (3.5)

thenΨ(t, H, u(·), μ, Ψ0) =X(t, H, u(·), μ)Ψ0is the solution of (2.1). SinceSU(N) is transitive on the sphereSN (see [7], p. 88), if the control system is controllable on the Lie groupSU(N) then it will also be controllable in the wave-function formulation.

4. Inversion without noise

Theorem 4.1 (Setting (S1)). Let H, μ1, μ2 ∈ HN, H diagonal, Ψ01, Ψ02 ∈ SN and denote for a = 1,2 and L1loc(R+,R):Ψa(t, ) =Ψ(t, H, (·), μa, Ψ0a). Let O be a (non-trivial) SCO. We suppose thatN 3 and:

(A1):LiH,iμ1 =LiH,iμ2 =su(N).

(A2):tr(H) =tr(μ1) =tr(μ2) = 0.

the eigenvalues ofH are all of multiplicity one.

Then there existsT >0 such that if:

1(T, ), Ψ1(T, )=2(T, ), Ψ2(T, ) ∀∈L1([0, T];R), ∀O∈ O, (4.1) then for somei)Ni=1RN:

1)jk= ei(αj−αk)2)jk, ∀j, k≤N. (4.2) Remark 4.2.

(1) Assumption(A1)is required for the simultaneous controllability, see Theorem3.3and Lemma 3.4.

(2) The assumption (A2) can be made without loss of generality according to [16]. In fact, changing the HamiltonianH and/ or dipole momentμby adding a multiple of the identity operatorId, does not change the observations. In this case, the state Ψ(t) is replaced by eΨ(t) with the phase ϕ∈ R depending on tr(H),tr(μ) and on the controlu.

Remark 4.3. The proof also shows that the values of any additional observable commuting withHare identical for both systems, in particular all populations are always identical.

Moreover, whenμ1 andμ2are matrices of dipole operators (i.e., have the form of real potentials) truncated to dimensionN, thenμ1andμ2are real symmetric matrices; the Theorem implies (μ1)jk=±2)jkfor allj, k.

In general this is not enough to conclude thatμ1=μ2as it can be seen from the counter-example 1 from ([16], p. 381) whereN = 3,Ψ01=Ψ02= (1,0,0)T:

H =

E1 0 0 0 E2 0 0 0 E2

, μ1=

⎝ 0 −μα 0

−μα 0 μβ 0 μβ 0

, μ2=

⎝0 μα 0 μα 0 μβ

0 μβ 0

, E1, E2, μα, μβR(arbitrary). (4.3)

In this case all control fields give rise to identical populations for both systems. This under-determination can be mitigated under additional hypothesis as in Remark4.8.

(6)

Remark 4.4. When eigenvalues ofH are degenerate butOis a CSCO the Theorem4.6below should be used instead.

Proof. Consider the collection of two systems (H, μ1) and (H, μ2) seen as a control system onSU(N) SU(N) with operatorsiH

iH,iμ1

2su(N)

su(N). This collection can either be controllable or not. Denote Rt={(Ψ1(t, ), Ψ2(t, ))|∈L1([0, t];R)},R=t≥0Rt. It is known (see [13], Thm. 6.5 item (ii) p. 322) that there existsT such that RT =R.

SinceOis a non-trivial SCO it contains at least an observable, denotedO, that is not multiple of the identity.

For this observable there exist Ψx, Ψy ∈ SN such that x, Ψx = y, Ψy. But the condition (4.1) shows that no controlexists that drivesΨ01toΨxandΨ02toΨy; therefore the joint systemiH

iH,iμ1

2is not controllable simultaneously. Then it exists an automorphism ofsu(N) that sendsiHtoiHand1to2. But the automorphisms ofsu(N) are of the formX su(N)→W XW−1su(N) orX su(N)→W XW−1su(N) for someW ∈SU(N). Recall that the matrixH is real (because it is diagonal and inHN). Consider first that one can findW ∈SU(N) such thatH=W HW−1andμ2=W μ1W−1. The first identity shows that [H, W] = 0 and thereforeW is diagonal with the diagonal containing entries of the form e,≤N; the conclusion follows from the second identity. Consider now that there existsW ∈SU(N) such thatiH=W iHW−1; then [H2, W] = 0, thusW diagonal and thereforeH =−H, impossible.

Remark 4.5. The result is stronger than the Theorem 1 in ([16], p. 380) which requires:

A stronger condition on the spectrum ofH (the non-degenerate transition condition); recall that the transi- tions ofH are called non-degenerate if the eigenvaluesλk(H) ofH satisfyλi(H)−λj(H)a(H)−λb(H) for all (a, b) = (i, j). Here we only ask that the eigenvalues have multiplicity one.

That observables in O are the populations (thus in particular O is a CSCO). Here a single non-trivial observable is enough.

That the equality (4.1) take place at all timesT 0. Here only one time (large enough) is required.

Theorem 4.6 (Setting (S2)). Let μ1, μ2, H1, H2 ∈ HN, Ψ01, Ψ02 ∈ SN and denote for a = 1,2 and L1loc(R+,R):Ψa(t, ) =Ψ(t, Ha, (·), μa, Ψ0a). We suppose thatN 3 and the following assumptions hold true:

(A1):LiH1,iμ1 =LiH2,iμ2 =su(N);

(A2):tr(H1) =tr(H2) =tr(μ1) =tr(μ2) = 0;

Let O={O1, . . . , OK} be a CSCO andΦ=1, . . . , φN} an orthonormal basis that diagonalizes O.

Then there existsT >0 such that if:

OkΨ1(T, ), Ψ1(T, )=OkΨ2(T, ), Ψ2(T, ) ∀∈L1([0, T];R), ∀k= 1, . . . , K, (4.4) then there existi)Ni=1RN andθ∈Rsuch that for all j, k≤N either

μ1φj, φk= ei(αj−αk)μ2φj, φk, H1φj, φk= ei(αj−αk)H2φj, φk, Ψ01, φj= ei(θ−αj02, φj, (4.5) or

μ1φj, φk=ei(αj−αk)μ2φj, φk, H1φj, φk=ei(αj−αk)H2φj, φk, Ψ01, φj= ei(θ−αj)Ψ02, φj. (4.6) Remark 4.7. When O is not a CSCO, the same proof allows only to obtain that an isomorphism of Lie algebras exists that sendsiH1toiH2and1to2. In general it is not possible to obtain more than a general isomorphism as shown by the following counter-example:

H1=

⎝1 0 0 0−1/2 0 0 0 1/2

, W =

⎝1 0 0

0 1/2

3/2 0−√

3/2 1/2

, μ1=

⎝0 1 2 1 0 0 2 0 0

, (4.7)

(7)

H2=W H1W−1=H1, μ2=W μ1W−1=

⎝ 0

3 + 1/2 1−√

3/2

3 + 1/2 0 0

1−√

3/2 0 0

, Ψ02=W Ψ01,O={Od}. (4.8)

It is immediate to see that Odψ, ψ= 1/23/2|ψ,(1,0,0)T|2 and that W(1,0,0)T = (1,0,0)T. When the controlon the first system realizes the transformationX the observable is 1/23/2|XΨ01,(1,0,0)T|2; at the same time the control realizes the transformationW XW−1 on the second system giving the observable 1/2 3/2|W XW−1W Ψ01,(1,0,0)T|2. But W XW−1W Ψ01,(1,0,0)T = 01, W−1(1,0,0)T = 01,(1,0,0)T. Therefore it is not possible to distinguish between the couple (H1, μ1) and (H2, μ2) (at least for this initial data).

Remark 4.8. If, for physical reasons, we know the initial state of the system, thenΨ01=Ψ02; when this initial state has non-zero components along every element of the basis,i.e.Ψ01, φk = 0, for allk≥1 the equation (4.5) implies ej = e for allj= 1, . . . , N which means H1=H2 andμ1=μ2. When some coefficientsΨ01, φkare zero, further symmetries may occur and one can have, for instance,μ12: see counter-example 1 from ([16], p. 381) presented in Remark4.3.

On the other hand, in this case, the conclusion (4.6) can be written more conveniently in the adapted basis {v1= e−iα1/2φ1, . . . , vN = e−iαN/2φk}:

μ1vj, vk=−μ2vj, vk, H1vj, vk=−H2vj, vk, Ψ01=Ψ02= eiθ/2

N

=1

ςv, ςR. (4.9)

Proof. Denote byT the time at which the couple of systems (H1, μ1), (H2, μ2), seen as a control system on SU(N)

SU(N) with operatorsiH

iH,iμ1

2 su(N)su(N) reaches all attainable states. Since a CSCO is a non-trivial SCO it follows as in the Theorem 4.1that there exists an isomorphism of f :su(N) su(N) such thatiH2=f(iH1),2=f(iμ1).

All isomorphisms of su(N) are of the formX su(N) WXW−1 su(N) or X su(N) →WXW−1 su(N) for someW ∈SU(N). We only treat here the “exotic” casef(X) =WXW−1 as the second alternative is similar. ThusH2=−W H1W−1 andμ2=−W μ1W−1. With the notations in the equation (3.5) we write:

X(t, H2, u(·), μ2) =X(t,−W H1W−1, u(·),−W μ1W−1) =W X(t, H1, u(·), μ1)W−1. (4.10) As the first system is controllable then every stateX ∈SU(N) can be reached by some controlu(·) thus

Ok01, XΨ01=OkW XW−1Ψ02, W XW−1Ψ02,∀X ∈SU(N),∀k≤K. (4.11) Note that (4.11) also holds for any linear combination of observables inO. We invoke the Lemma3.1and obtain the existence of an observableO, diagonal in the basisΦand with all eigenvalues distinct, such that

OXΨ01, XΨ01=OW XW−1Ψ02, W XW−1Ψ02,∀X ∈SU(N). (4.12) The vectors φk are eigenvectors of O and denote as λk(O) the corresponding eigenvalues. In particular O=N

k=1λk(O)φkφk. We can suppose thatλ1(O)< λ2(O)< . . . < λN(O) (otherwise re-index the vectors).

Let us writeW−1Ψ02=01+yv withx, y∈C,|x|2+|y|2= 1,v∈ SN,v⊥Ψ01.

Suppose y = 0; then there exists X SU(N) such that 01 = φN and Xv Span{W−1φN, φN}. Then OXΨ01, XΨ01 = λN(O) = OW XW−1Ψ02, W XW−1Ψ02. Since λN(O) is the maximum possible value forO and all eigenspaces of O are of dimension 1 it follows thatW XW−1Ψ02 Span{φN} henceXW−1Ψ02 Span{W−1φN}. Then:

1 =|XW−1Ψ02, W−1φN|=|X(xΨ01+yv), W−1φN|=|xφN, W−1φN|=|x||φN, W−1φN|. (4.13)

(8)

It follows y = 0, |x| = 1; therefore W−1Ψ02 Span{Ψ01} which means that there exists θ R such that Ψ02= eW Ψ01; after trivial simplifications the equality (4.12) can be written

OXΨ01, XΨ01=OW XΨ01, W XΨ01,∀X ∈SU(N). (4.14) ButX ∈SU(N) means that01 can be chosen arbitrary inSN; we have therefore:

∀w∈ SN : Ow, w=OW w, W w=WOW w, w=WOW w, w. (4.15) But this impliesO=WOW and thus:

N

k=1

λk(O)φkφk=O=WOW =W N

k=1

λk(O)φkφk

W =

N

k=1

λk(O)(Wφk)(Wφk). (4.16)

Since all eigenvalues ofO are non-degenerate the representationO=N

k=1λk(O)φkφk is unique up to phases.

Therefore there existαk Rsuch that Wφk = e−iαkφk or, equivalently,Wφk = ekφk.

The conclusion follows from the relationshipsH2=−W H1W,μ2=−W μ1W andΨ02= eW Ψ01.

5. Inversion in presence of noise

Let (Ω,F,P) be a discrete probability space, V = {y Rd| ∈ I ⊂ N} a set of values in Rd (possibly infinite) and letY :Ω→ V be a random variable. We can suppose that for ally∈ V,P(Y =y)>0 (otherwise we eliminate all y such that P(Y =y) = 0). Moreover after re-indexing I we can suppose that I = N or I ={1, . . . , L0} for someL0N. Denoteξk=P(Y =yk),∀k∈ I.

We can suppose that (ξ)≥1 is a decreasing sequence (re-indexing if necessary).

5.1. Technical preliminaries: a correspondence lemma

LetJa :CN×N R,a= 1,2 andh:Rd+1Rbe real analytic functions withJa bounded.

Lemma 5.1. Let Aa, Basu(N),T >0,L1([0, T],R)and denote byXa(t, y, )the solution of dXa(t,y, )

dt = (Aa+h((t), y)Ba)Xa(t, y, )

Xa(0, y, ) =Id, (5.1)

for a= 1,2 and any∈ I. Suppose that the following equality in law holds

LY(J1(X1(T, Y, ))) =LY(J2(X2(T, Y, ))) ∀∈L1([0, T],R). (5.2) Then for any ∈ I, there existsn0(, ξ1, . . . , ξn, . . .)andκ()∈ I,κ()≤n0(, ξ1, . . . , ξn, . . .)such that

J1(X1(T, y, )) =J2(X2(T, yκ(), )) ∀∈L1([0, T],R). (5.3) Proof. Let∈ I. The proof is divided in several steps.

Step 1:

Fix a control. We introduce the notation:

vak=Ja(Xa(T, yk, )), a= 1,2 and k∈ I.

(9)

According to the assumption (5.2) we know thatJ1(X1(T, Y, )) andJ2(X2(T, Y, )) follow the same law. Thus P(J1(X1(T, Y, )) =v1) =P(J2(X2(T, Y, )) =v1). Then

k∈I/v2k=v1

ξk =

k∈I/vk1=v1

ξk≥ξ>0. (5.4)

Therefore {k ∈ I/v2k = v1} = . In addition, there exists a n0() ∈ I such that

k>n0(),k∈Iξk < ξ and

k>n0()−1,k∈Iξk ≥ξ (by convention a sum over an empty set of indexes is zero). So we have {k ∈ I/k n0(), vk2 =v1} =∅. The indexn0() depends only on the law ofY and the index.

Letting vary inL1([0, T];R) we obtain a functionκ1:L1([0, T];R)→ {k∈ I, k≤n0()}such that

J1(X1(T, y, )) =J2(X2(T, yκ1( ), )). (5.5) Note: when the indexκ1() with the property (5.5) is not unique, any compatible value in the set{k∈ I, k≤ n0()}can be chosen.

Step 2:

Let n∈N. We consider the spacePn of piecewise constant controls Pn ={f : [0, T] R| f =α11[0,T n]+ α21]T

n,2Tn]+. . .+αn1

](n−1)n T,T], α1, . . . , αn R}. Denoteα= (α1, . . . , αn). Therefore for anyk∈ I, we can define the functionsgk fromRn toRby

gk(α) =J2(X2(T, yk, α))−J1(X1(T, y, α)), withα=α11[0,T

n]+α21]T

n,2Tn]+. . .+αn1

](n−1)n T,T]. We know that

Xa(T, yk, α) = e(Aa+h(αn,yk)Ba)Tne(Aa+h(αn−1,yk)Ba)Tn. . .e(Aa+h(α1,yk)Ba)Tn a= 1,2. (5.6) Therefore the functions Xa are analytic in α (recall that the function h is analytic in α), and since Ja are analytic, the functionsgk are analytic. We denoteAk ={α∈Rn/gk(α) = 0}. EachAk is closed becausegk is continuous. In Step 1, it is proved that

∃κP :Rn→ {k∈ I, k≤n0()} such that ∀α∈Rn gκP(α)(α) = 0. (5.7) So

k∈I,k≤n0()Ak=Rn. By the Baire’s theorem, it exists aksuch thatAk has an interior point. This means thatgk is analytic and identically zero on a not empty open set. Therefore,gk 0. So∀n,∃κ2(n)∈ {k∈ I, k≤ n0()}such thatgκ2(n)() = 0, for any control∈ Pn.

Step 3:

Take q N and denote Bq ={k ∈ I, k ≤n0()}/gk() = 0, ∈ P2q}. In Step 2 it is proved that for any q N the set Bq is not empty. Obviously (Bq)q∈N is a decreasing sequence and Bq becomes constant from a certain term, thus B =

q≥0Bq =∅. This means that there exists κ() ∈ {k ∈ I, k n0()} such that gκ()() = 0,∀∈ P2q for allq. Yet,

q=0P2q is dense inL1([0, T];R). So we havegκ()() = 0, for any control in L1([0, T];R).

5.2. Main results

We setd= 1.

Theorem 5.2. Consider the same setting and assumptions as in the Theorem 4.6 with the exception of the relation (4.4). Then there existsT >0 such that if:

LYOkΨ1(T, +Y), Ψ1(T, +Y)=LYOkΨ2(T, +Y), Ψ2(T, +Y) ∀∈L1([0, T];R), ∀k= 1, . . . , K, (5.8) then either the conclusion (4.5)or the conclusion (4.6)of the Theorem 4.6holds(see also Rem.4.8).

Remark 5.3. WhenOis not a CSCO, the same proof allows only to obtain that an isomorphism of Lie algebras exists that sendsiH1 toiH2and 1to 2.

Références

Documents relatifs

For spin/spring systems we consider: compos- ite systems made of 2-level sub-systems coupled to quantized harmonic oscillators; multi-frequency averaging in infinite

In this note, we consider the problem of iden- tifying the dipole moment (which is assumed to be real) of an N −level quantum system, initialized to a known state (ground state), from

This method thus directly compares the efficiency of the preparation of the circular state using the optimized pulse with that of the adiabatic passage (estimated at ∼99. 5% ;

In the next section, an equation describing the evolution of the Wigner functions of quantum sys tems obtained by quantizing Hamiltonian systems with infinitedimensional phase

Quantum optimal control theory using the Zhu–Rabitz algorithm is applied in a second application to propose the realization of a quantum dynamics sim- ulator using the motional

These Dirac structures can then be networked together such as to execute arbitrary quantum algorithms using the interconnected universal RLC circuit gates, where variable

4.29 Final population transfer as a function of the deviation &#34; for energy- optimal dissipative STIREP with respect to various time area of the transient population in the

We develop an inverse geometric optimization technique that allows the derivation of optimal and robust exact solutions of low-dimension quantum control problems driven by