{'fraction_non_alphanumeric': 0.05890075438424611, 'fraction_numerical': 0.017086313314392084, 'mean_word_length': 3.9723304754481683, 'pattern_counts': {'":': 0, '<': 4, '<?xml version=': 0, '>': 5, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 22, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Environment-invariant measure of distance between evolutions of an open quantum system

The problem of quantifying the difference between evolutions of an open quantum system (in particular, between the actual evolution of an open system and the ideal target operation on the corresponding closed system) is important in quantum control, especially in control of quantum information processing. Motivated by this problem, we develop a measure for evaluating the distance between unitary evolution operators of a composite quantum system that consists of a sub-system of interest (e.g., a quantum information processor) and environment. The main characteristic of this measure is the invariance with respect to the effect of the evolution operator on the environment, which follows from an equivalence relation that exists between unitary operators acting on the composite system, when the effect on only the sub-system of interest is considered. The invariance to the environment's transformation makes it possible to quantitatively compare the evolution of an open quantum system and its closed counterpart. The distance measure also determines the fidelity bounds of a general quantum channel (a completely positive and trace-preserving map acting on the sub-system of interest) with respect to a unitary target transformation. This measure is also independent of the initial state of the system and straightforward to numerically calculate. As an example, the measure is used in numerical simulations to evaluate fidelities of optimally controlled quantum gate operations (for one- and two-qubit systems), in the presence of a decohering environment. This example illustrates the utility of this measure for optimal control of quantum operations in the realistic case of open-system dynamics.


Introduction
Control and optimization of open quantum systems is a rapidly growing area of theoretical [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15] and experimental [16,17,18,19,20,21,22,23] research. This research is connected, to a considerable degree, to a large body of work that has been recently devoted to integrating concepts and methods of optimal quantum control [24,25,26,27] into the fields of quantum information and quantum computation (QC) [28]. In particular, optimal control theory was used to design external control fields for generating quantum-gate operations in the presence of an environment [29,30,31,32,33,34,35,36]. In this context, an important problem is to evaluate the distance between different quantum operations, especially between actual and ideal processes [28,37,38,39,40,41,42,43]. One obstacle in the comparison of such processes is the reliance of many existing distance and fidelity measures on the initial state of the system or, to a lesser extent, on an integration or optimization over all possible states. Another difficulty arises when we consider the evolution of the quantum system of interest, in this case, a quantum information processor (QIP), that is coupled to a (finite-dimensional) environment. The main obstacle is that the unitary time-evolution operator for the composite system (consisting of the QIP and environment) and the target unitary operator for the QIP have different dimensions.
In this work, we develop a measure (originally proposed in [44]) that quantifies the distance between evolutions of a composite (bipartite) quantum system in such a way that only the effect of the evolution operator on one component (the sub-system of interest) is relevant in the measure, while the effect on the other component (the environment) can be arbitrary. Due to the invariance to the transformation on the environment, it is possible to evaluate the difference between unitary evolutions of the composite system (including the environment) and the sub-system of interest alone (excluding the environment), i.e., between unitary quantum operations of different dimensions. Therefore, the proposed measure enables us to compare unitary quantum operations (or, more generally, quantum channels [28]) corresponding to dynamics of ideal (i.e., closed) and real (i.e., open) systems. When the sub-system of interest is not coupled to an environment, the proposed distance measure reduces to a form that was previously used to evaluate the fidelity of closed-system unitary operations (see, e.g., [45,46,47]). Another important advantage of this distance measure is that it is independent of the initial state of the system. This property is important, since the fundamental objective of QC is to generate a specified target transformation for any initial state.
The development of an appropriate objective functional is a crucial issue for control and optimization (for both classical and quantum systems) [48]. Since maxima or minima of the objective functional determine control optimality, the selection of the objective is just as important as that of the physical model and optimization algorithm. Therefore, constructing an objective functional that represents control goals in the best possible way is one of the first tasks in any application of optimal control. In addition, the emerging studies of quantum control landscapes [49], for state-preparation control [50,51], observable control [52,53,54], and unitary-transformation control [55,56,57], emphasize the profound effects that the choice of the objective functional has on the optimization [the control landscape is defined by the objective as a function of control variables, J = J (C)]. In particular, the relationship between the control landscape structure and optimization search efforts was recently analyzed [58,59]. The measure we present here is well-suited for directly evaluating distances between general operations resulting from control of open quantum systems. The utility of this distance measure for optimal control of quantum gates in the presence of an environment is illustrated with a detailed numerical example.
This article is organized as follows. Section 2 presents an equivalence relation between unitary evolution operators acting on a composite (bipartite) quantum system. This relation is based on the effect of these operators on the sub-system of interest, while the effect on the other sub-system (representing the environment) is not taken into account and thus can be arbitrary. The equivalence relation produces a quotient space that is a homogeneous manifold of the original space of unitary operators. In section 3, a quotient metric is defined on this space, resulting in a generalized expression of the distance measure. This measure can be used to quantitatively compare unitary evolutions of the entire composite system and one of its components (the sub-system of interest), e.g., unitary operations of different dimensions. Particular forms of the general distance measure can be obtained using different matrix norms. In section 4, the distance measure is computed explicitly using the Hilbert-Schmidt norm, producing an analytical expression that is calculated directly from the unitary operator of the composite system. In addition, several properties of this specific measure are discussed. Section 5 develops the distance measure using the induced two-norm (i.e., the maximum singular value). In section 6, we relate the distance measure developed in section 4 to a few typical fidelity measures defined for a general quantum channel (acting on the subsystem of interest) with respect to a target unitary transformation. It is shown that the distance measure and an average channel fidelity both depend on the trace norm of the same matrix (as the matrix norm increases, distance decreases and fidelity increases), and that the distance measure sets the lower and upper bounds of this fidelity. Section 7 illustrates, using a numerical example, how the distance measure developed here can be directly incorporated into the optimal control of quantum operations in the presence of a decohering environment. In this application, the actual unitary evolution operator for the composite system (consisting of a QIP and its environment) is compared to the target unitary operator for the QIP alone, which is of a smaller dimension. This example demonstrates the utility of the distance measure in optimal control of unitary quantum gates for QC. Lastly, section 8 concludes the paper with a summary of the results and a brief discussion of future directions. For the continuity of the presentation, some mathematical details and most proofs are relegated to appendices.

Equivalence classes of unitary evolution operators
Consider a finite-dimensional, closed, bipartite quantum system with a Hamiltonian (possibly time-dependent) of the form where H s and H e represent the Hamiltonians for the system S (e.g., a QIP) and environment E, respectively, and H int represents the system-environment interaction. Let H s and H e denote the respective Hilbert spaces of the system and environment, where n s := dim{H s } and n e := dim{H e }. Thus, the Hilbert space of the composite system C is H c := H s ⊗ H e and n := dim{H c } = n s n e . Let {|i }, {|ν } and {|i ⊗ |ν } be orthonormal bases that span the Hilbert spaces H s , H e , and H c , respectively. For a given Hilbert space H, the set of admissible states, represented as density matrices on H, is denoted by D(H). As such, a density matrix ρ ∈ D(H) is a positive operator of trace one, i.e., ρ ≥ 0 and Tr(ρ) = 1. Elements of D(H) correspond to either pure [Tr (ρ 2 ) = 1] or mixed [Tr (ρ 2 ) < 1] states. Density matrices for pure states can also be expressed as |ψ ψ|, where |ψ represents a normalized vector in H (i.e., ψ|ψ = 1). The group of all unitary operators on H is denoted by U(H).
Let U(t) ∈ U(H c ) denote the unitary time-evolution operator of the composite system C, whose evolution is governed by the Schrödinger equation ( = 1): with the initial condition U(t = 0) = 1 1 c , the identity operator on H c . Given an initial density matrix ρ(t = 0) ∈ D(H c ), this state evolves in time as For any state ρ ∈ D(H c ), the state of the system S, with which system observables are calculated, is described by the reduced density matrix ρ s := Tr e (ρ), where Tr e denotes the partial trace over H e . Thus, from (3), ρ s evolves as If two composite unitary operators U, V ∈ U(H c ) are such that then they will produce identical evolutions of the reduced density matrix ρ s . In this situation, U and V are said to be system-or S-equivalent, a relationship expressed as U ∼ V . The condition described by (5) defines an equivalence relation [60] (in addition to being symmetric and reflexive, S-equivalence is also transitive, i.e., if U 1 ∼ U 2 and . The necessary and sufficient condition for S-equivalence is stated in the following theorem. Then Tr e UρU † = Tr e V ρV † for all density matrices ρ ∈ D(H c ) if and only if U = (1 1 s ⊗ Φ)V for some Φ ∈ U(H e ).

Proof. See Appendix A.
This theorem is related to a unitary invariance of Kraus maps [28,61], which is described further in section 6.
For any U ∈ U(H c ), let [U] denote the equivalence class of U, i.e., [U] = {(1 1 s ⊗Φ)U : Φ ∈ U(H e )}. As a consequence of Theorem 1, every equivalence class is isomorphic to the closed subgroup 1 is just a righttranslation of 1 1 s ⊗ U(H e ) by U. Therefore, if only the evolution of S is relevant, then just the space of S-equivalence classes, i.e., the quotient space Q := U(H c )/1 1 s ⊗ U(H e ) needs to be considered, rather than the space of all unitary operators U(H c ). While Q is not a Lie group like U(H c ), it is a smooth (right) homogeneous manifold of dimension (n 2 s −1)n 2 e [62]. Although not explored here, the fact that Q has the additional structure of a homogeneous manifold may be useful for further analysis (e.g., explorations of the landscape topology [57]) of the distance measure.

Properties of metrics on the quotient space of equivalent operators
A metric space consists of a pair of objects: a set Ω and a real-valued metric or distance measure ∆. The ordered pair (Ω, ∆) is a metric space if the following conditions are satisfied for any x, y, z ∈ Ω [60]: (i) Non-negativity: ∆(x, y) ≥ 0 (ii) Strict positivity: ∆(x, y) = 0 if and only if x = y (iii) Symmetry: ∆(x, y) = ∆(y, x) (iv) Triangle inequality: ∆(x, z) ≤ ∆(x, y) + ∆(y, z) In this work, Ω is the quotient space Q developed in section 2; elements of this space are the equivalence classes [U]. Let ∆ be any metric on U(H c ), then the corresponding quotient metric∆ on Q is This expression can be used to obtain the quotient metric for various choices of ∆, for example, when ∆ is the Hilbert-Schmidt norm distance, the induced two-norm distance, the geodesic distance with respect to some Riemannian metric, etc. [63,64,65]. The quotient metric (6) does not involve the partial trace over the environment, which is implicit in other distance (and fidelity) measures that use the operator-sum representation [28,38,39,40,41,42,43]. Moreover, the quotient metric is independent of any particular initial state, which is a very useful practical feature in applications to QC. In contrast to other measures of quantum gate fidelity, e.g., some of those in [ (2), without making any assumptions about the initial state of the composite system C. This property allows one to consistently quantify the distance between unitary quantum operations (e.g., the actual and ideal operation) for any initial state.
If ∆ is a left-invariant metric on U(H c ) [i.e., ∆(W U, W V ) = ∆(U, V ) for any U, V, W ∈ U(H c )], then (6) becomes In the context of a norm distance, (7) can also be expressed as where λ is a specified normalization factor and · is any left-invariant matrix norm on the space of n × n complex matrices, denoted as M n (C). In the following sections, we introduce some useful properties of unitarily invariant quotient metrics on the homogeneous space Q.

Closed-system target transformations
A very typical situation in QC occurs when the target unitary transformation is specified for an ideal closed system (i.e., for S alone, excluding coupling to the environment). Let U denote the actual evolution operator for the composite system C and V denote the target quantum operation. If the target is defined for the closed system, then V is decoupled: V = V s ⊗V e , where V s ∈ U(H s ) is the specified target unitary transformation for S and V e ∈ U(H e ) is arbitrary. Because V e is an arbitrary operation on E, it can be incorporated into Φ 2 in (6): Similarly, V e can be incorporated into Φ in (7) and (8). Therefore, for the closed-system target V s , expressions (6), (7), and (8) of the quotient metric are reformulated as and∆ respectively. From a practical point of view, these results mean that we can use the distance measure∆([U], [V s ⊗ 1 1 e ]) to quantitatively compare the actual evolution operator U ∈ U(H c ) of the composite system C (of dimension n) and the target transformation V s ∈ U(H s ) specified for the sub-system S (of a smaller dimension n s ).

Chaining of unitary operations
Consider a physical process composed of several components, such as the application of a sequence of n unitary operations, U n . . . U 2 U 1 , acting on the composite system, compared to the corresponding sequence of target unitary operations, V n . . .
In this context, a metric or distance measure is said to possess the chaining criterion [42] if Thus, the total error of the process is bounded from above by the sum of the individual errors ∆(U i , V i ). This property is useful for analyzing the overall fidelity of a quantum algorithm, consisting of, e.g., a sequence of one-and two-qubit operations [28,42].
, then the chaining criterion (10) holds for any Proof. See Appendix B.
From this result, the chaining property holds for V i ∈ U(H s )⊗U(H e ), i.e., the set of all decoupled or factorizable unitary operators in U(H c ). This condition is satisfied by any V i that preserves the isolation of the system S from the environment E, a ubiquitous objective in QC.

Convexity
Performing the minimization in (6) over Φ 1 , Φ 2 ∈ U(H e ) to compute∆([U], [V ]) may be difficult and expensive in general. However, when the distance measure is determined by a left-invariant norm (7), the minimization can be recast as a convex optimization problem [66]. Relaxing the condition on Φ from Φ † Φ = 1 1 e to Φ † Φ ≤ 1 1 e produces such a problem since (a) any norm is a convex function, (b) the argument in the norm is affine in the optimization variable Φ, and (c) the set of matrices that satisfies Φ † Φ ≤ 1 1 e is a convex set in Φ. To show this, note that the set of matrices that satisfies Φ † Φ ≤ 1 1 e is equal to the set that satisfies Φ 2 ≤ 1, where · 2 is the induced two-norm described in section 5. Thus, which follows from the triangle inequality. Expressing (7) [or (8)] as a convex optimization problem is desirable, provided the solution is on the boundary of Φ † Φ ≤ 1 1 e (i.e., Φ ∈ U(H e )), because if a local minimum exists in a convex set, it is also a global minimum [66].

Stability
Another important metric property is stability [42]. A metric is said to be stable if for any unitary operator Ξ of any given dimension. Stability means that operations on an ancillary system that is not coupled to the original composite system do not affect the value of ∆, and hence∆ [42]. We do not prove stability for the general form of the distance measure in (6) or (8), but demonstrate it for the Hilbert-Schmidt norm distance in the following section.

Computing the distance measure with the Hilbert-Schmidt norm
In this section, the distance measure presented in section 3 is evaluated with the Hilbert-Schmidt norm (also referred to as the Frobenius norm), which is defined as [64] The general form of the Hilbert-Schmidt norm distance is, according to (8), Using (12) in (13) and λ n = (2n) −1/2 , the minimization over Φ can be carried out analytically and, as shown below, we obtain: where and · Tr in (14) is the trace norm [64]: Note that in (15), Tr s (·) denotes the partial trace over the system space H s .
From this proof it follows that and the minimum occurs on the boundary of the set Φ † Φ ≤ 1 1 e , i.e., Φ = W X † ∈ U(H e ), where X and W are the unitary matrices from the SVD of Γ. For the case where the target unitary transformation V s ∈ U(H s ) is specified for a closed system, results of section 3.1 can be used to obtain:

Stability of the Hilbert-Schmidt norm
Consider the stability [42] of the Hilbert-Schmidt norm, as expressed in (11): where Ξ is any unitary operator and n ξ = dim{Ξ}. For this norm, a tensor product of operators factors into the corresponding product of the norms of those operators: Therefore, with the appropriate normalization factor,∆ HS is stable.

Unitary operators that are exact tensor products
Suppose that U and V , the actual and target operators, respectively, are exact tensor products, i.e., where U s , V s ∈ U(H s ) and U e , V e ∈ U(H e ). Such a situation would occur if, e.g., there is no system-environment interaction (H int = 0) or the system and environment are decoupled at a final time t = t f . Then, from (15), and The distance measure now becomes which is, as one would expect, completely independent of U e and V e . Indeed, as discussed in section 3.1, U e and V e can be incorporated into Φ in the quotient metric in (8) and thus simply replaced by 1 1 e . Therefore, the matrix Γ in (26) can be replaced by Γ = Tr U s V † s 1 1 e [immediately leading to (27)], and the distance measure in (28) can be expressed as∆ The distance measure in (28) is related to other distance and fidelity measures used in previous works for optimal control of unitary operations [45,46,47] and analysis of the unitary control landscape [55,56,57] in closed quantum systems. For control landscapes, the analysis of critical points of∆ HS [U s ⊗ 1 1 e ], [V s ⊗ 1 1 e ] with respect to the control field is especially important.
Note that the distance in (28) is zero if and only if U s and V s differ only by a global phase, i.e., U s = exp(iφ)V s for any real φ. Therefore, this distance can be considered as a phase-independent generalization of a frequently used distance [57] that is zero if and only if U s = V s .

Computing the distance measure with the maximum singular value
Suppose a (possibly entangled) normalized pure state |ψ of the composite system C is acted upon by a unitary operator U. The output of this action, U|ψ , can be compared to the output of the target action, V |ψ (modulo 1 1 s ⊗ Φ). The output state error ε is The maximum (over all normalized pure states) norm of the error is where · 2 is the induced two-norm of a matrix [64], i.e., the maximum singular value of the matrix argument. ‡ Now consider the distance measure based on the induced two-norm:∆ where is not presented in this work, we establish the following bounds: where Φ is the solution to the following optimization problem: Here, Φ † Φ ≤ 1 1 e indicates that Φ † Φ is a positive Hermitian matrix whose eigenvalues are at most 1. The optimization in (34) is convex for the same reasons as those discussed in section 3.3. However, there is no guarantee that the resulting optimizer Φ is unitary. Since Φ in (34) is less constrained than in (32), it follows that the lower bound in (33) applies. The operator Φ is obtained from the SVD of Φ: Thus, Φ is a unitary approximation to Φ, and since it is not necessarily the optimal solution to (32), the upper bound in (33) follows. The lower and upper bounds in (33) will be close to each other if the singular values of Φ are close to unity, i.e., if Φ is close to a unitary matrix. For any matrix M ∈ M n (C), the induced two-norm is bounded from above by the Hilbert-Schmidt norm [64]: M 2 ≤ M HS . Comparing the distance measure with these norms yields a similar relationship.
6. Relating the distance measure to quantum channel fidelity Quantum operations, for example, a free or controlled time evolution (possibly in the presence of decoherence) or a transmission of information (possibly via a noisy connection), are generally described by quantum channels [28,67]. In this section, we consider a common situation in QC, where the target quantum channel is a unitary transformation specified for a closed system (i.e., for S alone). We denote this target unitary transformation as V s ∈ U(H s ) (cf. sections 3.1 and 4.2), and the Hilbert- corresponding to the closed-system target is given by (22). We demonstrate that the distance measure∆ HS ([U], [V s ⊗ 1 1 e ]) and a typical measure of quantum channel fidelity both depend on the matrix norm of Γ = Tr s U(V † s ⊗ 1 1 e ) from (22). There are several ways to define the fidelity of a quantum channel with respect to the target unitary transformation [28,37,38,39,40,41,42,43]. For example, the Uhlmann state fidelity, defined as [37,38] where ρ 1 , ρ 2 ∈ D(H), can be used to measure the effect of quantum channels on states. The Kolmogorov distance between two density matrices is [40] D k (ρ 1 , ρ 2 ) : which bounds the Uhlmann state fidelity [40]: In this section, we develop a direct measure of fidelity for quantum channels based on F u in (37), and establish bounds analogous to those in (39) with the distance measurẽ ∆ HS . Let K denote a completely positive and trace-preserving quantum channel [28], mapping the state ρ s toρ s , where ρ s ,ρ s ∈ D(H s ), with the following operator-sum representation (also known as the Kraus map [61]): such that The target quantum channel is the unitary transformation V s that maps ρ s to V s ρ s V † s . We can compare the actual and target quantum channels, K and V s , respectively, using the Uhlmann fidelity of (37): When the input state ρ s is pure, it can be expressed as ρ s = |ψ s ψ s |; then (41) yields To evaluate the proximity of the quantum channel K to the target transformation V s , it is convenient to use a measure that is independent of the input state. One such measure is the minimum pure-state fidelity F p (K, V s ) [28], which is obtained by minimizing the form (42) of the Uhlmann fidelity over the set of all pure input states: Calculating F p (K, V s ) is not easy in general because the minimization in (43) is not convex. However, this problem can be related to a convex optimization, producing the following lower bound: where Both fidelities are contained in the interval [0, 1] and equal to one if and only if K [ρ s ] = V s ρ s V † s for all density matrices ρ s ∈ D(H s ), i.e., if K i = α i V s for all i and i |α i | 2 = 1. For a given K, F(K, V s ) is found via a convex optimization over all states ρ s ∈ D(H s ), and hence, it can be efficiently obtained numerically. It is shown in [28] that F (K, V s ) and F p (K, V s ) have the same pure-state minimum, but since the set of all density matrices is convex, while the set of all pure states is not, finding F(K, V s ) is an easier optimization problem.
If, instead of minimizing over all possible density matrices, ρ s in F (K, V s ) is simply the so-called maximally-mixed system state ρ m,s := 1 1 s /n s , this results in another variant of quantum channel fidelity, F m,s (K, V s ) [28,41,67]: This fidelity also evaluates the proximity of the quantum channel K to the target transformation V s [28], but without state optimization. Interestingly, ρ m,s has the unique property of being the density matrix with the "shortest" maximum distance, under the Hilbert-Schmidt norm, to any other density matrix: where min This result suggests that ρ m,s is "centrally located" within the space of density matrices in the Hilbert-Schmidt geometry.
Proof. See Appendix D.
Relating U (the composite-system evolution operator) to K (the quantum channel for the system S) requires the specification of an initial state of the composite system C. For simplicity, assume that this initial state is an uncorrelated tensor-product state: where, as before, ρ ∈ D(H c ), ρ ≥ 0, and Tr (ρ) = 1. The reduced dynamics of the system S can be represented by the mapping in (40), where the Kraus operators K νν ′ are with the unitary operator U expanded as There exist infinitely many different sets of Kraus operators, {K j }, that represent the same map K (i.e., they evolve the system state ρ s in exactly the same way) [61]. This is related to the equivalence relation defined in section 2, namely that U and (1 1 s ⊗ Φ)U produce the same system evolution and hence, the same Kraus map. Moreover, any Kraus map for a k-level system can be represented by a set of at most k 2 Kraus operators.
The mapping from U and ρ to K described above illustrates the dependence of the quantum channel K (and hence, of the corresponding fidelities) on the initial state of the environment. Note that the exact treatment of the dynamics requires the propagation of the evolution operator for the composite system C, which is also required for computing ∆([U], [V s ⊗ 1 1 e ]). Although approximations may simplify the calculation of K, they may eliminate certain physical processes, e.g., the Markovian approximation limits the memory of the environment, preventing possible coherence revivals. However, even when no approximations are made, measures of fidelity for a quantum channel K require (for the mapping from U to K) the specification of the environment's initial state and thus are less general than the distance measure∆([U], [V s ⊗ 1 1 e ]).
With (48), the fidelity F m,s (K, V s ) in (45) becomes where ρ e ∈ D(H e ) is the initial state of the environment, ρ e = ne ν=1 ζ ν |ν ν|. Also, we see that both the distance measure∆ HS [U], [V s ⊗ 1 1 e ] and quantum channel fidelity F m,s (K, V s ) depend on the matrix Γ defined in (22). Specifically, increasing the norm of Γ will increase fidelity and decrease distance. As a concluding example, suppose that ρ e is the maximally mixed environment state, i.e., ρ m,e := 1 1 e /n e . In this case, the quantum channel fidelity F m,s (K, V s ) becomes further emphasizing the dependence of fidelity on the norm of Γ. We show that the inequality relation between the distance and fidelity of quantum states presented in (39) [40] also applies to the distance and fidelity of quantum operations given by∆ HS ([U], [V s ⊗ 1 1 e ]) and F m,c (K, V s ), respectively. Specifically, we obtain the following lower and upper bounds of F m,c (K, V s ): Proof. See Appendix E.

Model open system
In this section, we illustrate the use of the distance measure∆ HS ([U], [V s ⊗ 1 1 e ]) in the optimal control of one-and two-qubit gates relevant for QC. Specifically, this measure is used in numerical calculations to evaluate the distance between quantum operations generated in the framework of optimal control theory [25,27] for a system coupled to a decohering environment [32,33], and a target unitary transformation. We use a model of interacting two-level particles, which are divided into a QIP, composed of q qubits, and an environment, composed of e two-level particles. The qubits are directly coupled to a time-dependent external control field, while the environment is not directly controlled and is thereby managed only through its interaction with the qubits. The Hamiltonian for the composite system C, abbreviated as H = H 0 + H c(t) + H int , § has the explicit form Here, S i = (S ix , S iy , S iz ) is the spin operator for the ith particle (S i = 1 2 σ i , in terms of the Pauli matrices), H 0 is the sum over the free Hamiltonians ω i S iz for all q + e particles (ω i is the transition angular frequency for the ith particle), H c(t) specifies the coupling between the q qubits and the time-dependent control field C(t) (µ i are the corresponding dipole moments), and H int represents the Heisenberg exchange interaction between the particles (γ ij is the coupling parameter for the ith and jth particles). Hamiltonians of the form in (53) are often referred to as effective or spin Hamiltonians [68].
The evolution of the composite system C is calculated in an exact quantummechanical manner, by propagating the Schrödinger equation (2) for the Hamiltonian in (53), without either approximating the dynamics by a master equation or using a perturbative analysis based on a weak coupling assumption. This calculation produces the final-time evolution operator U t f ∈ U(H c ) (an n × n unitary matrix), which is compared to the target gate operation V s ∈ U(H s ) (an n s × n s unitary matrix) viã ∆ HS [U t f ], [V s ⊗ 1 1 e ] . Note that n s = 2 q , n e = 2 e , and n = 2 (q+e) .
For our examples, we consider two different composite systems. In the first example, one qubit is coupled to a two-particle environment (q = 1 and e = 2), which can be modeled by a linear chain of particles with the qubit q 1 at the center, equally coupled to both environment particles e 2 and e 3 : where γ 12 = γ 13 = γ. Assuming only nearest-neighbor coupling in this configuration, we set γ 23 = 0. In the second example, two qubits are equally coupled to a one-particle environment (q = 2 and e = 1). This is modeled as a triangular cluster: where the two qubits are denoted as q 1 and q 2 , the environment particle as e 3 , and γ 13 = γ 23 = γ. Other system-environment configurations and corresponding optimal control results, using∆ HS [U t f ], [V s ⊗ 1 1 e ] , are presented in [32,33]. Parameters of the composite system are selected to ensure complex dynamics and strong decoherence: values of γ/ω are up to 0.02 and frequencies ω i are close, but not equal, to enhance the system-environment interaction (see [32] for more details). In addition to setting = 1, we introduce a natural system of units by setting µ i = 1 for all i and the qubit frequency ω 1 = 1, implying that one period of free evolution is 2π.

Optimal control algorithm
The ultimate control goal is to decouple the system S from the environment E at a time t = t f and simultaneously produce the target unitary operation V s ∈ U(H s ) for S. Target quantum gates for the one-and two-qubit systems are the Hadamard gate H g and controlled-not gate CNOT, respectively (both of these gates are elements of a For one-qubit coupled to a two-particle environment, the frequencies of the environment particles are: ω 2 ≈ 0.99841, ω 3 ≈ 1.00159. For two qubits coupled to a one-particle environment, the frequencies of q 2 and e 3 are: ω 2 ≈ 1.09159 and ω 3 ≈ 0.99841, respectively. universal set of logical operations for QC [28]): A hybrid optimization method incorporating genetic and gradient algorithms [69] is employed to minimize the distance measure∆ HS [U t f ], [V s ⊗ 1 1 e ] with respect to the control field C(t). After an initial optimization with a genetic algorithm, we remove the constraints imposed by the parameterized form of the control field to provide the potential for more flexible and effective control. An optimal control field is then found by minimizing the objective functional J [Vs] t f , given by using a gradient algorithm (see [46,32] for details of the gradient-based optimization).
Here, K t f denotes a particular closed subspace of L 2 ([0, t f ]; R) (see Appendix F for details), and for the time-dependent Hamiltonian in (53), U t f : K t f → U(H c ) denotes the map, defined implicitly through the Schrödinger equation (2), that takes a control field C(t) ∈ K t f to the unitary time-evolution operator U t f ∈ U(H c ). Thus, K t f is a Hilbert space of admissible controls, on which U(t; C) exists for all t ∈ [0, t f ] and all C ∈ K t f [70]. As such, J [Vs] t f : K t f → R is the "dynamical" version of the distance measure∆ HS , with an additional cost on the control field fluence, where α > 0 is the weight parameter for this cost. The gradient of J [Vs] t f is derived in Appendix F.

Results
Because 0 ≤∆ HS ≤ 1 in general, it is convenient to define gate fidelities based on the respective lower and upper bounds of F m,c (K, V s ) in (52): and Both fidelities are independent of the initial state and are evaluated directly from the evolution operator U t f of the composite system. These fidelities, computed for the onequbit Hadamard gate, optimally controlled in the presence of a two-particle environment, are presented in figure 7.3 for various values of the qubit-environment coupling parameter γ. For comparison, a fidelity based on the upper bound of the induced two-norm distance [as defined in (33)] is also presented: where Φ is defined in (33)- (35). This fidelity was cast as a semidefinite program [66] and calculated from the final-time evolution operator U t f using the SDPT3 solver [71] and the YALMIP toolbox [72] in MATLAB. Since the evolution operators U t f produced via optimal control in this example are very close to the target equivalence class, the upper and lower bounds on the induced two-norm distance are nearly indistinguishable, although this is not true in general. ¶  Figure 1. Gate fidelities F u HS (circles, also shown at a different scale in the inset), F l HS (squares), and F 2 (triangles) versus the coupling parameter γ, for the optimally controlled one-qubit Hadamard gate H g . The qubit is equally coupled to a two-particle environment (q = 1, e = 2). Values of γ range from 0 to 0.02 in increments of 0.001.
For the one-qubit system with no coupling to the environment (γ = 0), the optimal control field produces the Hadamard gate with the following values of the distance and fidelities:∆ HS ≈ 10 −6 , F u HS ≈ 1 − 10 −12 , F l HS ≈ 1 − 2 × 10 −6 . For the maximum coupling to the environment (γ = 0.02), we obtain for the optimally controlled Hadamard gate: ∆ HS ≈ 0.0035, F u HS ≈ 1 − 10 −5 , F l HS ≈ 0.993. For the two-qubit system with no coupling to the environment (γ = 0), the optimal control field produces the CNOT gate with the following values of the distance and fidelities:∆ HS ≈ 10 −4 , F u HS ≈ 1 − 10 −8 ,

Conclusions
We presented the novel and useful distance measure∆([U], [V ]) for the quantitative comparison of unitary quantum operations acting on a composite quantum system, where the effect on only one sub-system (e.g., a QIP) is important, while the effect on the rest of the system (e.g., an environment) can be arbitrary. In practically important situations where the target operation is specified only for the sub-system of interest, the corresponding measure∆([U], [V s ⊗ 1 1 e ]) can evaluate the distance between the evolution of the entire composite system and the target transformation (i.e., effectively compare unitary operations of different dimensions). This capability is especially desirable for measuring the distance between the actual controlled quantum process in a realistic open system and the target unitary transformation in its ideal closed counterpart. The measure developed in this paper does not require the specification of the initial state of any component of the system, is straightforward to calculate with the Hilbert-Schmidt norm, and can be used to define relevant state-independent fidelity measures. A fidelity measure independent of the initial state is extremely valuable for optimal control of quantum gates, which is a crucially important task in realistic QC.
The quotient metric developed here is also applicable to other proposals for design and control of quantum operations. For example, it can be used for evaluating the fidelity of quantum gates in situations where multilevel encoding (MLE) of quantum logical states is employed (i.e., where each logical basis state of a qubit is encoded by multiple physical levels of a quantum system) [73]. Target unitary operations for a QIP equipped with MLE have a tensor-product structure similar to that in (25), and the logical equivalence can exist between different physical operations (i.e., different physical processes can result in the same quantum logical operation on the QIP). However, the environment is not explicitly included in the MLE formalism.
Future research arising from the present work will involve the analysis of quantum control landscapes [55,56,57,74,75,76,77,78] for objective functionals based on various forms of the distance measure∆([U], [V ]), in particular, on the Hilbert-Schmidt norm distance∆ HS [U t f (C)], [V s ⊗ 1 1 e ] . It would be interesting to investigate the structure of these control landscapes and systematically search for robust control solutions that incorporate requirements on realistic physical resources. This search can be performed using a method called diffeomorphic modulation under observable-response-preserving homotopy (D-MORPH) [74,75,76,77]. This method provides an accurate numerical tool for finding optimal controls. In particular, D-MORPH applied to closed quantum systems is able to identify optimal controls generating a target unitary transformation up to machine precision [77]. Extending the applicability of this approach to open quantum systems is an important goal, currently under development. Implementing efficient numerical algorithms to calculate unitary time-evolution operators for larger composite systems is essential for practical optimal control simulations. Recent work has shown that such unitary maps can be efficiently constructed from appropriately designed state-to-state maps [79], utilizing the favorable state-control landscape structure [50,55]. The possibility of expanding the method developed in [79] to the optimal control of open quantum systems is being explored.

Acknowledgments
This work was supported by the NSF and ARO. JD acknowledges support from the Program in Plasma Science and Technology at Princeton. Sandia is a multipurpose laboratory operated by Sandia Corporation, a Lockheed-Martin Company, for the United States Department of Energy under contract DE-AC04-94AL85000.

Appendix A. Equivalence of unitary operations
The theorem from section 2 is repeated here for convenience. As such, for all A ∈ M n (C) and B ∈ M ns (C), Since (A.4b) is true for all A ∈ M n (C) and B ∈ M ns (C), then Finally, because (A.4d) is true for all B ∈ M ns (C), it holds for all W ∈ U(H s ): i.e., UV † commutes with W ⊗1 1 e , for all W . As such, UV † is an element of the centralizer of U(H s ) ⊗1 1 e [i.e., the subgroup of U(H c ) that commutes with U(H s ) ⊗1 1 e , also formally defined in Appendix C], denoted as C U(Hc) (U(H s )⊗1 1 e ) [80,81]. In Appendix C, we show that the centralizer of U(H s ) ⊗ 1 1 e is 1 1 s ⊗ U(H e ). Thus, So, we conclude that U = (1 1 s ⊗ Φ)V for some Φ ∈ U(H e ).

Appendix B. Chaining of unitary operations
After defining and establishing some mathematical objects and terms necessary for our work, we show that the chaining property from (10) holds for a unitarily bi-invariant quotient metric on the homogeneous space Q. Proofs of these lemmas are provided in Appendix C. The theorem from section 3 is repeated here for convenience.
Proof. We determine the structure of the normalizer of U(H s ) ⊗ 1 1 e in U(H c ); the structure of the normalizer of 1 1 s ⊗ U(H e ) follows from the symmetry of the tensor product. First, we define a fixed non-degenerate diagonal unitary matrix Λ ∈ U(H s ). Note that if U ∈ N U(Hc) [U(H s ) ⊗ 1 1 e ], then in particular, U(Λ ⊗ 1 1 e )U † ∈ U(H s ) ⊗ 1 1 e . For simplicity, let U(Λ ⊗ 1 1 e )U † = V ⊗ 1 1 e , where V ∈ U(H s ). Because U is unitary, V ⊗ 1 1 e and Λ ⊗ 1 1 e have the same eigenvalues (they are related by a similarity transformation), hence V and Λ must have the same eigenvalues, so there exists an Ω ∈ U(H s ) such that ΩV Ω † = Λ. Therefore, demonstrating that (Ω ⊗ 1 1 e )U is an element of the stabilizer subgroup of Λ ⊗ 1 1 e with respect to the group action of conjugation. Hence, i.e., (Ω⊗1 1 e )U is block diagonal with n s blocks, each of which are n e ×n e unitary matrices. So we have shown that any U in the normalizer can be written as U = (Ω ⊗ 1 1 e )V for some Ω ∈ U(H s ) and V ∈ U(H e ) ⊕ · · · ⊕ U(H e ). We can write where each V i ∈ U(H e ) for all i.
In order for U to be in the normalizer subgroup, it must be true that for each W ∈ U(H s ), there exists an X ∈ U(H s ) such that U(W ⊗ 1 1 e ) = (X ⊗ 1 1 e )U. If U = (Ω † ⊗ 1 1 e )V , we must have V (W ⊗ 1 1 e ) = (ΩXΩ † ⊗ 1 1 e )V . This condition implies that w ij V i = (ΩXΩ) ij V j for all 1 ≤ i, j ≤ n s . Because W is arbitrary, for each i consider the case where w i1 = 1 (and w j1 = 0 for j = i), implying that V i is a scalar times V 1 . Proof. We consider the centralizer of U(H s ) ⊗ 1 1 e in U(H c ), since the centralizer of 1 1 e ⊗ U(H e ) follows from the symmetry of the tensor product. Because the centralizer must be a subset of the normalizer subgroup, each U ∈ C U(Hc) [U(H s ) ⊗ 1 1 e ] must be of the form U = Ψ ⊗ Φ where Ψ ∈ U(H s ) and Φ ∈ U(H e ). So, Proof. We first show that the bounds on F m,c (K, V s ) follow from Γ 2 = max i σ i ≤ n s , where σ i is the ith singular value of Γ. Then we show that Γ 2 ≤ n s holds.
The upper bound holds if and only if Γ 2 HS ≤ n s Γ Tr , or equivalently, i σ 2 i ≤ n s i σ i . Assuming that max i σ i ≤ n s , it immediately follows that i σ 2 i ≤ n s i σ i , which establishes the upper bound.
With some algebraic rearrangement, the lower bound becomes Γ Tr + (1/n s ) Γ 2 HS ≤ 2 √ n e Γ HS . If Γ 2 ≤ n s , which implies that Γ 2 HS ≤ n s Γ Tr and Γ Tr + 1/n s Γ 2 HS ≤ 2 Γ Tr , the lower bound holds if Γ Tr ≤ √ n e Γ HS . This is a known inequality for any matrix and thus establishing the lower bound. To prove this inequality, let σ and τ be two k-dimensional vectors (where k ≤ n e ) with entries σ i , which are the singular values of Γ, and τ i = 1 for all i, respectively. It follows from the Cauchy-Schwarz inequality that Γ Tr = where, for a vector, · 2 is the Euclidean norm (also referred to as the ℓ 2 norm): To show that σ i ≤ n s , consider where dim{|ψ } = n e and ψ|ψ = 1. Applying the Cauchy-Schwarz inequality [64] to the argument of (E.3b) yields Because the two-norm is bounded from above by the Hilbert-Schmidt norm [64], Since Γ|ψ 2 ≤ n s is true for all normalized |ψ , it follows that Γ 2 ≤ n s .
Appendix F. Optimal control objective functional: J In section 7.2 we use the objective functional J [Vs] t f in (57), which corresponds to a special situation (although ubiquitous in QC), where the target unitary transformation V s ∈ U(H s ) is specified for a closed system (i.e., for the system S). As discussed in section 3.1, in this situation the target unitary operator V ∈ U(H c ) should be replaced by the tensor product V s ⊗ 1 1 e in the quotient metric, leading to the Hilbert-Schmidt (22). However, in this appendix, we consider a more general case: an arbitrary target unitary operator V ∈ U(H c ), not necessarily the tensor-product one. The corresponding objective functional J where the Hilbert-Schmidt norm distance∆ HS ([U], [V ]) is defined by (14) and (15).
We now turn to the problem of differentiating Z. Differentiating a square root in a commutative setting is straight-forward; we used this fact to differentiate y. But for matrices, non-commutivity may cause trouble. So, we begin by rewriting the definition of Z as Z 2 = Γ † Γ, and differentiating both sides: Define ν : M ne (C) → C n 2 e to be the linear operator that stacks the columns of a square matrix to create a vector. If we let M ne (C) and C n 2 e both be real Hilbert spaces with respective inner products A, B = Re Tr A † B and x, y = Re x † y , then ν is a linear isometry [60] between these two spaces: for all A, B ∈ M ne (C). Hence ν * = ν −1 is the "matrix-ization" operator that returns a square matrix. From the discussion of matrix equations and the Kronecker product in [82], we can rewrite (F.7) as By construction, Z will be Hermitian and positive semi-definite; the transpose Z T will also be Hermitian and will have the same eigenvalue decomposition as Z. Because of this, we know that Z T ⊗ 1 1 + 1 1 ⊗ Z will also be Hermitian and positive semi-definite (the eigenvalues of the Kronecker sum are just the set of all pairwise sums of the eigenvalues of Z). If we assume that Z is positive definite, then Z T ⊗ 1 1 + 1 1 ⊗ Z will also be positive definite and this linear system will have a unique solution: Then, considering M ne (C) to be a real Hilbert space with the real Hilbert-Schmidt inner product, L Γ is a linear operator, and we can find its adjoint: for a given B ∈ M ne (C) and all A ∈ M ne (C). Hence, L * Γ (B) = Γ B + B † . Then, Using grad y(Z) = −1 1/[2n y(Z)] derived previously yields 1 1) is just the matrix solution to the problem ZA + AZ = 1 1, and therefore is A = 1 2 Z −1 , since we are assuming Z is not just positive semi-definite, but positive definite. Then, (F.14) For the differential of Γ V , we can extend Γ V toΓ V : M n (C) → M ne (C), by letting Γ V (A) = Tr s A V † . Then,Γ V is a linear map, so the differential ofΓ V is just itself, i.e., d AΓ (δA) =Γ V (δA). For any δU where the last step involves projecting ( Combining these components, we find that grad ∆ [V ] Since V ∈ U(H c ) and ΩW † ∈ U(H e ), we have R ∈ U(H c ). Note that R is the element of the equivalence class [V ] that is closest to U under the Hilbert-Schmidt distance, i.e., R = (1 1 s ⊗Φ)V , wherê Φ := arg min Φ U − (1 1 s ⊗ Φ)V HS .
where K t f is the set of (equivalence classes of) functions f ∈ L 2 ([0, t f ]; R) such that f Kt f < ∞. Bilinearity, symmetry, and non-negativity of the inner product ·, · Kt f are clear from the definition. When η(t) ≡ 1, K t f is L 2 ([0, t f ]; R) with the standard inner product. Other choices of η(t) change the standard geometry, moving undesirablyshaped functions far away from the origin, or out to infinity, where they are less likely to be the targets of an optimization on K t f . This point is discussed in more detail throughout this section. For the optimizations performed in this work, η(t) = sin(πt/t f ).
To make this approach (and geometric interpretation) rigorous, we need to verify that K t f is indeed a Hilbert space under the inner product ·, · Kt f in (F.17). Suppose f is a measurable function such that f Kt f < ∞. Because η is positive almost everywhere and bounded above, 1/η is positive everywhere and bounded below by some β > 0. Then, Hence, f L 2 < ∞, so that f ∈ L 2 ([0, t f ]; R), where · L 2 denotes the L 2 norm on [0, t f ]. If f (t) = 0 on a set of non-zero measure, then f 2 (t) > 0 on a set of non-zero measure [analogously for η(t) and f 2 (t)/η(t)]. Hence, f Kt f > 0, so we have non-degeneracy, and K t f is thus an inner product space. Suppose that {f k } is a Cauchy sequence in K t f [60]. Then g k := f k / √ η is a Cauchy sequence in L 2 , i.e., g k − g ℓ L 2 = f k − f ℓ Kt f → 0. Since L 2 ([0, t f ]; R) is complete, this implies that g k → g ∈ L 2 ([0, t f ]; R). Let g := f / √ η, thus, and so that f ∈ K t f and f k → f in the topology induced by ·, · Kt f . Hence, K t f with ·, · Kt f is a complete inner product space, i.e., a Hilbert space. We have not simply effected a change in geometry, but we also have restricted the domain to a linear subspace of L 2 ([0, t f ]; R). If C ∈ L 2 ([0, t f ]; R)/K t f , then J [V ] t f = ∞, so that C is not a viable solution. This new geometry puts desirable functions near the origin and undesirable functions out near infinity, which makes this optimization different from the unshaped version. Now, consider the mapping U t f : K t f → U(H c ) introduced in section 7.2. The differential of the final-time evolution operator U t f with respect to the control field depends on evolution operators at all times in [0, t f ]. It is shown in [77] that where µ is the dipole moment operator [e.g., µ = i µ i S ix in (53)]. With the usual Hilbert-Schmidt inner product as the Riemannian metric on U(H c ), we can find the adjoint of this differential: for any A ∈ T Ut f (C) U(H c ) and all δC ∈ T C K t f ≃ K t f , With J [V ] t f (C) in (F.1), using previous arguments regarding the chain rule on gradients, we obtain grad J HS [U t f (C)] Im Tr R † − U † (t f ; C)RU † (t f ; C) U t f (C)U † (t; C)µU(t; C) HS [U t f (C)] Im Tr R † U t f (C) − U † (t f ; C)R U † (t; C)µU(t; C) + αC(t). (F.23c) Observe that grad∆ HS is continuous on U(H c ), and therefore bounded. It is shown in [77] that d C U t f * is uniformly bounded for all C ∈ K t f . In fact, d C U t f * ∞ ≤ µ HS η 1 2 L 1 , where · L 1 denotes the L 1 norm. + Therefore, there exists a κ > 0 such that HS [U t f (C)] ≤ κ (F. 24) for all C ∈ K t f . Then, since HS [U t f (C)] Im Tr R † U t f (C)−U † (t f ; C)R U † (t; C)µU(t; C) (F. 25) at a local extremum of J [V ] t f , all local extrema of J [V ] t f must lie within the hypersphere C ≤ κ/α. From this perspective, the role of the shape function can be interpreted as moving undesirably-shaped controls outside of this hypersphere, to the region where they can no longer act as local extrema of J [V ] t f . Note that both the space K t f and the control objective J [V ] t f depend on the shape function η(t). When a shape function is used in an iterative optimization routine via (F.23), this results in the minimization of a different (though conceptually related) objective on a different space than when η(t) ≡ 1.