Locally optimal symplectic control of multimode Gaussian states
Uther Shackerley-Bennett, Alberto Carlini, Vittorio Giovannetti and, Alessio Serafini

TL;DR
This paper develops locally optimal quantum control strategies using Gaussian unitaries to accelerate the relaxation of multimode Gaussian states in lossy channels, highlighting the role of squeezing in optimizing entropy and temperature dynamics.
Contribution
It derives conditions for optimal control of Gaussian states in lossy channels, providing explicit relaxation times and emphasizing the importance of squeezing in the process.
Findings
Squeezing enhances the rate of entropy change during relaxation.
Exact relaxation times are computed for optimal heating and cooling.
Control strategies are tailored to the parameters governing entropy and temperature.
Abstract
The relaxation of a system to a steady state is a central point of interest in many attempts to advance control over the quantum world. In this paper, we consider control through instantaneous Gaussian unitary operations on the ubiquitous lossy channel, and find locally optimal conditions for the cooling and heating of a multimode Gaussian state subject to losses and possibly thermal noise. This is done by isolating the parameters that encode entropy and temperature and by deriving an equation for their evolution. This equation is in such a form that it grants clear insight into how relaxation may be helped by instantaneous quantum control. It is thus shown that squeezing is a crucial element in optimising the rate of change of entropic properties under these channels. Exact relaxation times for heating and cooling are derived, up to an arbitrarily small distance from the fixed point of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Locally optimal symplectic control of multimode Gaussian states
Uther Shackerley-Bennett1, Alberto Carlini2,3,4, Vittorio Giovannetti4,5, Alessio Serafini1
1Department of Physics & Astronomy, University College London, London WC1E 6BT, UK
2Dipartimento di Scienze ed Innovazione Tecnologica, Università del Piemonte Orientale, 15121 Alessandria, Italy
3INFN, Sezione di Torino, Gruppo Collegato di Alessandria, Italy
4NEST, Istituto di Nanoscienze-CNR, Pisa, Italy
5Scuola Normale Superiore, 56127 Pisa, Italy
Abstract
The relaxation of a system to a steady state is a central point of interest in many attempts to advance control over the quantum world. In this paper, we consider control through instantaneous Gaussian unitary operations on the ubiquitous lossy channel, and find locally optimal conditions for the cooling and heating of a multimode Gaussian state subject to losses and possibly thermal noise. This is done by isolating the parameters that encode entropy and temperature and by deriving an equation for their evolution. This equation is in such a form that it grants clear insight into how relaxation may be helped by instantaneous quantum control. It is thus shown that squeezing is a crucial element in optimising the rate of change of entropic properties under these channels. Exact relaxation times for heating and cooling are derived, up to an arbitrarily small distance from the fixed point of the lossy channel with locally optimal strategies. Keywords: Gaussian states, coherent control, open quantum systems
1 Introduction
As quantum technologies advance, it has become increasingly important to understand the dynamics of a system interacting with its environment. It is hoped that increased insight into such setups will provide a more realistic notion of how to control and exploit quantum behaviours. As well as considering the impact of the environment, one would also like to allow for an external controller who may influence the evolution of the state of the system. This beckons the introduction of open-loop quantum control theory, which is a mathematical framework exploring how time-varying Hamiltonians drive dynamics in the absence of feedback. Exploring these together in a particular scenario is the topic of this study.
Quantum control theory of closed systems is a highly active area of research [1, 2, 3, 4, 5] with its roots in the older field of mathematical control theory [6, 7, 8, 9]. Its introduction to open systems has taken place in different contexts, including multilevel discrete systems [10], systems with closed ‘feedback’ control [11], dissipating qubits [12] and in a drive to understand ‘quantum speed limits’ [13]. The current paper explores open system control theory for continuous variable quantum mechanics, and specifically for the class of Gaussian states. These are ubiquitous in physics and serve as a good model for electromagnetic radiation [14, 15, 16], optomechanical systems [17], trapped ions [18] and mesoscopic massive systems seeking the ‘gravitational quantum regime’ [19, 20]. They are fundamental in the study of continuous variable quantum information due to the ease with which they can be described, and also the natural way in which noise may be introduced into the dynamical equations. The evolution of Gaussian states in dissipative quantum channels has been explored before and it is this literature that we build upon [21, 22].
If one models the environment as an infinite thermal bath coupled to the system through a beam-splitter Hamiltonian, then the channel is known as lossy [23]. Lossy evolutions can be described as either ‘heating’ or ‘cooling’, depending on whether the environment has a higher or lower entropy than the initial state of the system. Here we consider the case of non-interacting bosonic modes, each coupled with a bosonic thermal environment with the same temperature, undergoing such a lossy evolution. We then ask for the locally optimal, open-loop control strategy to minimise the relaxation time to the steady state. In other words, we wish to maximise the rate of change of the entropy toward the fixed point of the dynamics. Control is considered in the idealised regime where only instantaneous transformations which act impulsively on the system are allowed, in particular we restrict the analysis to (possibly non-local) unitaries that are Gaussian preserving. The restriction to finite, instantaneous controls (corresponding to control Hamiltonians proportional to delta functions in time) is not a completely wild abstraction since experimental set-ups certainly exist where a unitary manipulation will typically take nanoseconds, or tens of nanoseconds, while the decoherence rates are in the order of , so that the former may fairly be regarded as instantaneous with respect to the time-scales on which the noise acts. In what follows, we also disregard the possibility of any feedback on the quantum system. Let us anticipate that, in the absence of specific constraints, the non-compact nature of the symplectic group allows for an arbitrarily high amount of squeezing to occur in these control operations. To make the analysis more realistic and reduce infinities, this will be capped.
A central result of this study is showing that squeezing is the main parameter of interest in the analysis of heating and cooling dynamics. A highly squeezed state is locally optimal for minimising the relaxation time in a heating channel. Interestingly, squeezing can also be used to drive the state away from the fixed point of a cooling channel. Conversely, undoing the squeezing is shown to be locally optimal for cooling strategies, which is a point of experimental interest. The minimum time it takes to reach the fixed point of the channel within an arbitrarily small distance is derived in both cases. The analysis rests on the derivation of a compact equation for the evolution of entropic quantities – Eq. (24) – whose variations might also be applicable to the evolution of entanglement of Gaussian states under lossy channels, as discussed in the conclusion.
2 Gaussian states
We begin with an outline of Gaussian states, referring to the introductions given in Refs. [14, 24].
Let be a vector of canonical operators such that , where is the Kronecker delta function. From this we find that where
[TABLE]
Quadratic Hamiltonians are defined as those that can be written as where is a , real, symmetric matrix and is a vector of real numbers. The set of Gaussian states can be defined as the ground and thermal states of positive definite quadratic Hamiltonians:
[TABLE]
where is the inverse temperature of the state (we set Boltzmann’s constant ). Such states are referred to as Gaussian due to their Wigner representation which takes a Gaussian form. The Wigner representation immediately suggests that such states should be totally specified by their first and second moments, defined respectively as
[TABLE]
[TABLE]
is the covariance matrix of the Gaussian state and denotes the anticommutator.
Evolution under quadratic Hamiltonians transforms Gaussian states into Gaussian states. The second moment encodes all entropic and entanglement properties and so we restrict our attention, here and in the rest of the paper, to ignore the first moments. In this case it is possible to consider in both the state and the quadratic Hamiltonian transformation. Once this is done the transformations generated by the remaining Hamiltonians, and their combinations, form the symplectic group . This is the set of matrices such that
[TABLE]
Covariance matrices transform under a finite dimensional representation of the symplectic group by conjugation,
[TABLE]
3 Open Diffusive dynamics
The details of Markovian evolution for Gaussian states are presented in Refs. [14, 22] where, following a standard approach in quantum optics, the weak coupling to an infinite bath is replaced with the coupling to a finite number of continuously refreshed environmental modes. This coupling is provided by the Hamiltonian,
[TABLE]
The evolution of the Gaussian state has a representation in terms of the associated covariance matrix which takes the form
[TABLE]
where
[TABLE]
with denoting the bath covariance matrix.
Lossy channels occur by setting the coupling Hamiltonian to induce a swapping of field excitations between the system and the bath. We focus on the case of non-interacting bosonic modes, each coupled with a bosonic thermal environment via an individual exchange Hamiltonian of the form:
[TABLE]
where denotes the annihilation operator of the system and the annihilation operator of the bath mode. This is equivalent to setting which in turn sets and . We set the state of the bath as where and is the average photon number in each bath mode. We assume that the thermal baths have the same , i.e. the same temperature. Rescaling the time parameter by , the relaxation rate of the lossy channel, we arrive at
[TABLE]
which represents the free, lossy evolution of the Gaussian state with solution
[TABLE]
Eq. (11) will be used extensively in the rest of the paper as we explore the evolution of some important parameters of .
4 Symplectic invariants
An -mode covariance matrix has free parameters that compose its information content. of these parameters have the special status of being invariant under symplectic transformations and so play a unique role in describing the state. These symplectic invariants are important in that they encode the entropy of the state, relating to its temperature and mode frequency [25, 26]. We will explore two different ways of representing these invariants allowing the derivation of a new equation from Eq. (11) that isolates their evolution. This analysis will clear the route to an understanding of entropy evolution and will provide a platform on which to introduce control.
There is no unique way to define the symplectic invariants but the collection most commonly considered is the set of symplectic eigenvalues, expressible through Williamson’s theorem [24, 27]. This states that any -dimensional, real, symmetric, positive-definite matrix, for instance , may be decomposed as
[TABLE]
where
[TABLE]
and is the identity matrix, and . The elements of are unique up to reordering. Furthermore the uncertainty principle on ensures that [24]. The parameters are the symplectic eigenvalues which can also be calculated as moduli of the eigenvalues of .
Any function of symplectic invariants is also a symplectic invariant. Consider the th elementary symmetric function of the eigenvalues of some matrix , defined as [28]
[TABLE]
where the sum runs over all the possible -subsets of the first natural integers. More explicitly,
[TABLE]
where , denotes the power set and we put . As an example, for a matrix with eigenvalues ,
[TABLE]
Following Ref. [29] this allows for the definition of a new set of symplectic invariants of , given by and related to the symplectic eigenvalues via
[TABLE]
The elementary symmetric functions of odd order vanish in this case because of the alternating signs of the eigenvalues of . Both the set of symplectic eigenvalues and this new set contain the entropic information of the state.
To further our analysis of these new invariants we recall some basic linear algebra [28]. Consider an matrix and delete the same rows and columns. The remaining submatrix is known as a principal submatrix of . The determinant of a principal submatrix is known as a principal minor. Given the characteristic polynomial of , where , we have that
[TABLE]
Noting that we see that the study of principal minors and characteristic polynomial coefficients gives a new way to express and understand the symplectic invariants of a covariance matrix. In fact there is a way to recursively generate using Fadeev-Le Verrier recursion.
Theorem 1** (Fadeev-Le Verrier recursion [30, 31, 32]).**
Let be an real matrix. Let its characteristic polynomial be written with . It is possible to calculate the coefficients of the polynomial via the recursive formula,
[TABLE]
This recursive generation of will be the guide to stripping Eq. (11) to only consider the evolution of the invariants. Before stating this evolution equation it is necessary to spend a little more time on notation, defining
[TABLE]
where
[TABLE]
This new object acts as a sort of reduced where we remove the terms involving the th symplectic eigenvalue. Again we define . To illustrate this new function consider some covariance matrix with symplectic eigenvalues . Here, we would have
[TABLE]
Using Fadeev-Le Verrier recursion to express the characteristic polynomial coefficients and their link to symplectic eigenvalues we are able to derive an evolution equation for these invariants under the open diffusive dynamical equation, Eq. (11).
Theorem 2**.**
For evolving under , the evolution of the symplectic invariants, defined by , obeys
[TABLE]
where by the Williamson decomposition and
[TABLE]
**Proof ** See A.
Eq. (24) directly reveals the evolution of the invariants under Eq. (11), meaning that we are able to focus on the parameters that interest us and ignoring the remaining ones.
Open loop control refers to the enactment of predetermined operations without feedback on a quantum state, which would typically be unitary. The importance of the symplectic group is that it is the Gaussian analogue of the unitary group, in that the elements do not alter the entropic, or Gaussian, properties of the state. We consider symplectic control acting instantaneously at a given time in the evolution, allowing the alteration of on the right hand side of Eq. (24). Notice that this represents an impulsive action altering the state by a finite amount at a certain time and not a term generated by a Hamiltonian proportional to a step function in time (the in Eq. (24) is a time-dependent property of the evolving state). This is with the aim of optimising the rate of the change of , where the argument of is assumed to be unless otherwise stated.
Note that is defined via the Williamson decomposition of and so both terms on the right hand side of Eq. (24) could be affected by its alteration. The first term, however, is a symplectic invariant and so no amount of manipulation will alter its value. However, the second term does vary with and so if, at a given point in the evolution, we alter it then this term will change. Maximising or minimising the value of the trace term is therefore the route towards locally optimising the rate of change of . In Sec. 5 we find that this optimisation will allow for the study of decoupled dynamics where each mode evolves independently. This drastically simplifies the analysis and allows for the optimal relaxation times for heating and cooling. We will show that squeezing is the key parameter that alters this term in Eq. (24).
Notice also that all possible initial Gaussian states are allowed in our treatment, since all physical covariance matrices admit a Williamson decomposition in terms of some symplectic .
5 Heating and cooling
Eq. (24) shows that varying to alter the trace term is the required action to optimise the rate of change of . First we derive the symplectic matrix that will maximise or minimise this term and then we turn our attention to the dynamics that this optimisation invokes. This latter analysis will provide locally optimal heating and cooling times for the evolution of the channel under symplectic control.
5.1 Trace optimisation
To explore the optimisation of the trace term in Eq. (24) we first require an understanding of the singular value decomposition of symplectic matrices. Any symplectic matrix may be decomposed as where and . The elements of correspond to ‘passive’ elements in the lab such as phase shifters and beam splitters. The component encodes the squeezing element of the transformation. Any symplectic that is singular value decomposed such that is referred to as ‘active’. Using this decomposition will allow us to deconstruct and understand the trace term of Eq. (24).
For generality and brevity of notation we will consider a trace term of the form where , with positive, and . Note that the elements of are unbounded and closely related to the energy required to enact the operation. Therefore the full optimisation will be done over the set , defined as the restriction of the symplectic group to elements with maximum singular value for each mode. This encapsulates the reasonable assumption that the energy that may be employed in each mode, rather than the sum of the energies, is bounded.
Proposition 1**.**
The supremum of the trace term over the set is given by
[TABLE]
where , is the maximum local squeezing allowed on mode , ordered such that , and . The infimum is given by .
**Proof ** The singular value decomposition provides
[TABLE]
It is possible to change to a basis in which the symplectic form becomes , where denotes the zero matrix and the identity matrix. This is a commonly used basis in Gaussian state theory and is enacted with
[TABLE]
acting by similarity on the components of the trace term [16]. After enacting this we will then consider a further similarity transformation with
[TABLE]
This transforms symplectics into a basis which highlights the isomorphism between and , as will become clear. Acting on each matrix in the trace by and then we find that the transformation of gives
[TABLE]
where . transforms as
[TABLE]
where and transforms as
[TABLE]
where is some general unitary matrix. Note that here denote the complex and not the Hermitian conjugate. Altogether
[TABLE]
where is a vector of the diagonal elements of and is a vector of the diagonal elements of . making it a general unistochastic matrix, which is a subset of the bistochastic matrices [33]. Bistochastic matrices are those that have have non-negative entries and whose rows and columns sum to 1. It will suffice to show that, for the supremum case (at fixed),
[TABLE]
and for the infimum case that
[TABLE]
because all permutations matrices are unistochastic [33]. Note that refers to rewriting the elements of the vector in descending order and the reverse for . This is shown in Ref. [34] and the proof is reproduced in B. In the supremum case we further have to take the maximum over which is set at . Similarly, the infimum taken over is . These two situations provide the final result stated in Eq. (26).
Thus we see that the maximisation of the trace term is found by setting for the maximum squeezing value. The minimum is obtained by setting . Note that neither of these provide the unique maximum or minimum. We could just as well maximise by setting for some and maximum. Minimisation will occur for any . Proposition 1 shows that the instantaneous control must either squeeze or unsqueeze depending on the desired effect.
5.2 Two-mode example
Let us now apply our findings to the iconic case of an initial two-mode squeezed state, such as the output of a degenerate parametric down conversion process, or the state that would result by driving an optomechanical set-up on a blue sideband, characterised by the following covariance matrix [14, 16]:
[TABLE]
with . The parameter allows us to range from pure states (for ) to mixed states, with entropy growing for increasing . The parameter is sometimes referred to as the ‘two-mode squeezing parameter’ and, in a sense, quantifies the correlations between the two modes in this class of states. In practice, is determined by the strength of parametric interaction between the two modes and by the interaction time, if one assumes the state to be generated unitarily from the vacuum. In the following, we will assume the realistic value .
To fix ideas, let us consider in what follows a loss rate of , and a parameter equal to , corresponding to the thermal noise at room temperature experienced by a mode of visible radiation at (a noisier situation could be construed but, as we shall see, this typical optical circumstances will suffice to illustrate our methods). For simplicity, we will quantify the evolution of the entropy of the relaxing states through their purity which, for Gaussian states, turns out to be a function of the invariant alone (which is just the determinant of ): [14]. The steady-state purity with parameters set as above is .
The analytic optimisation expressed by Theorem 2 and Proposition 1 may now be applied to compare the uncontrolled lossy relaxation of the initial states given above with the relaxation of optimally adjusted states under instantaneous, symplectic control.
In the case of cooling, for (such that the purity of the initial state is ), the optimal strategy to speed up relaxation is to undo the two-mode squeezing operation and let the vacuum state evolve through the channel. This allows one to attain a purity of after , as opposed to the required by the uncontrolled evolution; similarly, a purity of is reached after , as opposed to the of the uncontrolled evolution (clearly, the asymptotic purity is never perfectly reached, so one must resort to thresholds).
Let us now turn our attention to heating by setting (perfectly pure initial state). Then, the fastest relaxation strategy would be to undo the two-mode squeezing of the initial state and apply maximum single-mode squeezing, as per Theorem 2 and Proposition 1. In order to avoid the introduction of arbitrary maximum squeezing parameters (that would, in a lab, be dictated by specific technical constraints), let us just contrast the uncontrolled evolution of the initial pure two-mode squeezed state with the evolution of an initial vacuum state, obtained by unitarily undoing the initial two-mode squeezing: This will provide us with a spectacular demonstration of the effect of squeezing on relaxation dynamics. In mathematical terms, the difference between the two cases is captured by the trace term in Eq. (24), for and , which corresponds to the evolution of the determinant of a two-mode covariance matrix. In the case of heating, relaxation is hastened by an increase in the trace term: hence, whilst an initial vacuum state takes about to relax (to the significant digits reported above), the initial two-mode squeezed state takes as little as ! It can be shown that an instantaneous symplectic applied at this point would then be capable of stabilising not only the purity, but the whole covariance matrix (and hence the state) to the steady-state values. Such a symplectic is the one that enacts the Williamson decomposition of the covariance matrix and can be efficiently evaluated with standard methods. To give a quantitative idea of the effect of such control on the fly, let us add that the determinant of the initial two-mode squeezed state would, without it, overshoot the asymptotic determinant after , reach a maximum (corresponding, in this instance, to a minimum purity of at ), and then readjust to the steady state after a total time of about .
5.3 Decoupling
Proposition 1, in conjunction with Eq. (24), allows us to understand the dynamics of when is controlled to be optimal at a given moment of time. In the optimal limit, either maximal or minimal, the value of must be either or . Using Williamson’s theorem, as stated earlier, Eq. (11) may be rewritten as
[TABLE]
If we enact a control to set or at a given time then this equation will decouple so that it suffices to consider single mode evolution, as explored in Ref. [21]. For the single mode case Eq. (24) becomes
[TABLE]
where refers to the symplectic eigenvalue of the decoupled mode , is its squeezing value obtained from the singular value decomposition and is defined in Proposition 1. Note that in the optimal maximal limit and in the minimal limit . We may talk about maximising or minimising the rate of change of by considering different limits of . Recalling that we see that Eq. (38) is equivalent to
[TABLE]
which has solution
[TABLE]
where is the initial value of the decoupled mode . The value of directly determines the entropy of the Gaussian state which for a single mode is defined as [35]
[TABLE]
monotonically increases with and so, for a single mode, is a good entropy measure, being equal to one for pure states and greater than one for mixed states. Gaussian states have an associated temperature encoded in , and each mode has an associated mode frequency . The value of depends on the product of these two parameters via [36]
[TABLE]
If we fix then monotonically increases with the temperature, thus we refer to rising as heating and lowering as cooling.
The fixed point of the evolution in Eq. (12) is at . The time to reach this point diverges, hence we must fix a distance within which we are satisfied that we have arrived close enough to the target. Take this to be
[TABLE]
The case means that the channel is heating. The optimal strategy in this case is to increase the squeezing of each of the decoupled modes as much as possible. In other words, we choose for all modes and the minimum amount of time for all to come within distance of the fixed point is
[TABLE]
Note that this time is in general finite and goes to zero for large values of (i.e., large). Furthermore it is possible to set and so we are able to reach exactly the fixed point in an infinitesimal amount of time for and a finite time for finite .
The case means that the channel is cooling. In this case we optimally set for all the decoupled modes. The minimum amount of time to come within distance of the fixed point of the dynamics is
[TABLE]
diverges for and so to reach the true fixed point still requires an infinite amount of time. However, in most cases it suffices to cause the state to come arbitrarily close to the thermal state of the bath. We see that in order to minimise the time to achieve this it is necessary to reduce the mode squeezing to zero, explicitly we wish to reduce the squeezing measure to zero. This ‘unsqueezing’ will need to be enacted to optimise cooling.
As it is shown in C, our analysis reproduces the results of Ref. [21] for the special case of an unsqueezed bath and a single mode system. Referring to equations from Ref. [21] with primes it is easy to show that coincides with (Eq. (67’)) and with (Eq. (63’)) provided that .
Furthermore we note that optimal control can prevent a cooling channel from ever decreasing the temperature of the state if it is sufficiently, periodically squeezed. This can be seen by noting that increases under Eq. (39) when even when , as seen in Fig. 1.
We would like to compare and with the free relaxation time of the state, in the absence of control. Computing this for a system of modes would require solving Eq. (12) with some analogue of Eq. (43), which is not easy to achieve analytically. Ref. [21], however, provides results for the relaxation of single-mode Gaussian states and so a comparison can be made in this regime. As shown in C, the free decoherence time for a single mode can be written as:
[TABLE]
where is the initial squeezing of the mode. For the case when a single mode is involved, therefore, we can draw exactly the same conclusions as in Ref. [21]. In particular, for vanishing tolerable errors, we get that the advantage of quantum control appears negligible if the channel is cooling while it allows for an exponential speed-up with respect to the uncontrolled dynamics for heating channels. This former statement is somehow reminiscent of the third law of thermodynamics according to which zero temperature is unattainable in finite time [37]. One can also study a measure of performance of the control procedure for the worst case scenario of possible initial conditions and obtain the same results discussed in Ref. [21].
Therefore we see that squeezing and heating are intrinsically related. Squeezing itself does not affect the temperature of the state but under a lossy channel it is the key factor in increasing or decreasing its rate of change, here shown for any number of modes.
6 Conclusion and Discussion
The number of degrees of freedom for an -mode Gaussian state scales polynomially in . Therefore when we consider the evolution of such a state it is important that we isolate the parameters that are most relevant. The information encoded in the symplectically invariant parameters allows one to extract the key property of entropy. In this paper we derived an equation for the evolution of such invariants and calculated the locally optimal rates for heating and cooling under a lossy channel. We have shown that among the time-optimal control schemes, one involves decoupling the dynamics into single modes. From here optimal cooling and heating come about by respectively unsqueezing and squeezing the decoupled modes. As a result of the decoupling, one can extend the single-mode analysis of [21] to any number of degrees of freedom, which represents our main result. We have demonstrated that on the one hand heating can be accomplished arbitrarily well via optimal symplectic control in an arbitrarily short time if enough squeezing is allowed while, on the other hand, controlled cooling cannot be achieved equally well and fast as heating.
This analysis rested on the derivation of Eq. (24) but the techniques required can also provide insight into a property that is not a symplectic invariant: entanglement. The positivity of the partial transpose is necessary for the separability of a bipartite mode state, and sufficient if either or is equal to [38, 14]. Separability is equivalent to the condition that obeys the uncertainty relation
[TABLE]
where , where the Pauli matrix . This condition is equivalent to the smallest symplectic eigenvalue of being greater than or equal to 1 which in turn gives the separability condition [38]
[TABLE]
acts by similarity and is symmetric meaning that remains positive definite, implying that it also has a Williamson decomposition: . Furthermore it obeys since is time invariant. This allows us to mimic the full analysis of A providing
[TABLE]
where and has the same definition as before except for the symplectic eigenvalues of . This provides us with an evolution equation for an entanglement measure of the mode system, directly from the analysis employed to derive Eq. (24). The difference here, however is that is not a symplectic invariant and so further analysis will require more sophistication.
This paper brought together techniques from linear algebra to explore the evolution of multimode Gaussian states evolving under lossy channels. As exemplified by the calculation concerning entanglement, sketched above, such techniques may be extended to provide wider analytical insight. We restricted ourselves to the specific question of finding locally optimal cooling, or heating, for states undergoing lossy channel evolution. This has been answered and shown to be intrinsically related to squeezing. We showed that the study of locally optimal trajectories can be explored using decoupled dynamics and so the single mode case provides the lower bound on the relaxation time.
Acknowledgments
AS acknowledges financial support from EPSRC through the grant EP/K026267/1.
Appendix A Evolution of symplectic invariants
A.1 Recursive formulas
Reiterating Eq. (11) the evolution of our system obeys
[TABLE]
Using this and the Taylor expansion in we obtain
[TABLE]
where and .
Lemma 1**.**
The Taylor expansion of the following trace term to first order is
[TABLE]
**Proof ** Expanding to first order in we obtain a single term of the form and terms of the form where . The cyclicity of the trace allows us to reorder these elements to obtain . Now it remains to show that to first order this expression is zero for odd.
It suffices to show that
[TABLE]
To prove Eq. (53) we use the invariance of the trace under cyclic permutations and transposes giving
[TABLE]
where we used . Eq. (54) is found using a similar argument. Putting these together we prove the proposition.
Recall the recursive definition for the coefficients of the characteristic function given in Sec. 4:
[TABLE]
Recalling that we change notation to start considering these symmetric functions. Using the recursive formula and Lemma 1 we see that
[TABLE]
Lemma 2**.**
Taylor expanding we arrive at
[TABLE]
**Proof ** From Eq. (56) we can explicitly show that
[TABLE]
where we define for brevity in the proceeding proof and where we have also used Lemma 1. From here we will proceed with an inductive proof. We assume that Eq. (57) holds for some and then show that if this is true then it holds for .
Using Eq. (56) we may write the expansion out for and then use Lemma 1 and the definition of to arrive at
[TABLE]
Substituting Eq. (57) into Eq. (59) we extract the first two terms that look like they would fulfill the proof plus a final one that we would hence like to show is zero:
[TABLE]
Dropping we proceed to examine the final piece, referring to it as , and rewriting it as
[TABLE]
Note that we have relabelled as to shorten the expression but it will not alter the analysis. The at the front reminds us that everything should be expanded to zeroeth order inside the sum. To prove the lemma it is necessary to show that .
Expanding to introduce another sum we arrive at
[TABLE]
From here note that for a general sum with elements we have
[TABLE]
where and . The first equality of Eq. (63) can be seen with observation. The second involves a redefinition of the sums where we split them into two halves and then redefine the labels such that one is descending whilst the other ascends. When such a summation redefinition is applied to Eq. (62) it will be clear that .
Thus we prove that if is given in Eq. (57) then this also holds for . From Eq. (58) we see that it is true for and so, inductively it is true for all . To write it in the form stated one must replace with .
Lemma 3**.**
Taylor expanding using we find that
[TABLE]
**Proof ** Expanding out the recursive formula and again defining we get a product of sums of the form
[TABLE]
By only keeping terms that are less than second order in we get a smaller sum
[TABLE]
consists of the remaining terms which come in pairs. Take for instance the first pair which is generated by choosing the coefficient in the first line of Eq. (65), with everything else at zeroeth order, and secondly the coefficient in the second line, with everything else at zeroeth order. The pairs will each cancel to become zero. The final piece comes without a partner but has coefficient , and so does not contribute. Therefore and the lemma is proven.
Lemma 4**.**
Using the previous two Taylor expansions we may write the rate of change of as
[TABLE]
**Proof ** The first Taylor expansion came from Lemma 2 stating that
[TABLE]
Using Lemma 3 and the same reasoning as in Eq. (51) we rewrite the above as
[TABLE]
Dividing through by we prove the proposition, recalling that .
A.2 Telescoping the series
Eq. (67) provides a differential equation describing the rate of change of . We now work towards a simplification of this equation using Williamson’s theorem [27, 24] and noticing that the series ‘telescopes’ to provide a simpler form.
Given Williamson decomposition, , as described earlier, and the symplectic property: , we may rewrite the trace term that appears in the sum of Eq. (67):
[TABLE]
where we used , as well as cyclic properties of the trace. Thus Eq. (67) becomes
[TABLE]
Using definitions given in Sec. 4 we may now prove the theorem stated in the main body:
Theorem** (2).**
For evolving under , the evolution of the symplectic invariants, defined by , obeys
[TABLE]
where
[TABLE]
**Proof ** Beginning with the final term of Eq. (68) and dropping the factor we may take the sum inside the trace to give
[TABLE]
which allows us to consider the internal sum before tracing. Recalling that the diagonal elements of occur in pairs we only need to consider symplectic eigenvalues denoted , . The th term of the sum in Eq. (71) takes the form
[TABLE]
and the th takes the form
[TABLE]
Recall that is a sort of reduced symplectic invariant which is similar to but where we remove all terms involving the th symplectic eigenvalue. By splitting up Eq. (71) to consider each individually and also by spltting each th term we see that telescoping is going to occur. This is the situation when the latter piece of the th term cancels the former term of the th term. Noting that this cancellation is going to occur between Eq. (72) and Eq. (73) we should be left with the very first and last pieces of the entire series. The first piece is equal to zero and so we are just left with the final term
[TABLE]
and therefore the expressions of Eq. (71) are equal to where
[TABLE]
Appendix B Bistochastic limits
Here, we prove an optimisation result regarding bistochastic matrices. We begin with the reiteration of the notation that, for some vector , denotes a new vector of elements of written in descending order. is similar but for ascending order.
Lemma 5**.**
Let and be two real vectors of length . The supremum of the following inner product is given by
[TABLE]
and the infimum by
[TABLE]
**Proof ** Taken from Ref. [34]. We begin with a consideration of the supremum and then turn our attention to the infimum. The permutation matrices form a subset of the bistochastic matrices and so we may alter to make and descending. Then we fix to some specific bistochastic matrix to define
[TABLE]
where and are the elements of and respectively. Consider . Let be the smallest index such that . Note that for , and therefore if and , or if and . Since , then for some , . Likewise, for some , . These imply that .
The inequalities above mean that we can choose such that the matrix is bistochastic where
[TABLE]
and in all other cases. Now define
[TABLE]
Recalling that and , so that and ,
[TABLE]
which means that the term is not decreased. may be chosen to reduce an off-diagonal term in to zero without affecting the bistochasticity of and without decreasing the value of . As this process is iterated may be brought to identity without decreasing , achieving its maximum value.
The argument for the infimum is completely analogous except we begin by considering
[TABLE]
where are the elements of . The analysis is similar except that we will be considering , and so transforming into does not increase the value of . Thus we find again but for the situation where the vectors are oppositely ordered.
Appendix C The case of a single mode
Here we compare and with , and derived in Ref. [21] for the case of a single mode coupled to an unsqueezed bath. For clarity, equations quoted from Ref. [21] will be primed. Both papers begin with Eq. (8) which allows us to identify
[TABLE]
with symbols from Ref. [21] on the left and ours on the right. Eqs. (38’)-(39’) show the fixed point of the dynamics to be
[TABLE]
Using Eq. (33’) and noting that we identify
[TABLE]
and maximal squeezing in , while for the initial conditions we identify
[TABLE]
where is the initial squeezing value. Ref. [21] uses the fidelity Eqs. (50’)-(51’) for the tolerable error while we use Eq. (43). To avoid confusion, we rename the allowed error in Eq. (50’). In particular, we can rewrite Eqs. (50’) and (66’) for the heating and cooling cases, respectively, as . With all of the above taken into account, it is then very easy to verify that Eq. (67’) and Eq. (63’) coincide with our optimal times for decoupled modes, i.e. that
[TABLE]
provided that . Finally, the free decoherence time Eq. (54’) is translated as Eq. (46).
References
- [1]
Wu J W, Li C W, Zhang J and Tarn T J 2007 ArXiv e-prints (Preprint 0708.3147)
- [2]
Wu R, Chakrabarti R and Rabitz H 2008 Phys. Rev. A 77(5) 052303 URL http://link.aps.org/doi/10.1103/PhysRevA.77.052303
- [3]
Genoni M G, Serafini A, Kim M S and Burgarth D 2012 Phys. Rev. Lett. 108(15) 150501 URL http://link.aps.org/doi/10.1103/PhysRevLett.108.150501
- [4]
Shackerley-Bennett U, Pitchford A, Genoni M G, Serafini A and Burgarth D K 2017 J. Phys. A 50 155203
- [5]
D’Alessandro D 2007 Introduction to Quantum Control and Dynamics (Chapman and Hall/CRC)
- [6]
Jurdjevic V 1996 Geometric Control Theory: (Cambridge: Cambridge University Press) ISBN 9780511530036 URL https://www.cambridge.org/core/books/geometric-control-theory/1A9B7398F632D1A153E6F6B7AA18EE14
- [7]
Jurdjevic V and Sussmann H J 1972 J. Differ. Equations 12 313 – 329 ISSN 0022-0396 URL http://www.sciencedirect.com/science/article/pii/0022039672900356
- [8]
Sachkov Y L 2000 J. Math. Sci. 100 2355–2427 ISSN 1573-8795 URL http://dx.doi.org/10.1007/s10958-000-0002-8
- [9]
Elliott D 2009 Bilinear Control Systems: Matrices in Action 1st ed (Springer Publishing Company, Incorporated) ISBN 1402096127, 9781402096129
- [10]
Jirari H and Pötz W 2005 Phys. Rev. A 72(1) 013409 URL http://link.aps.org/doi/10.1103/PhysRevA.72.013409
- [11]
Lloyd S and Viola L 2001 Phys. Rev. A 65(1) 010101 URL http://link.aps.org/doi/10.1103/PhysRevA.65.010101
- [12]
Mukherjee V, Carlini A, Mari A, Caneva T, Montangero S, Calarco T, Fazio R and Giovannetti V 2013 Phys. Rev. A 88(6) 062326 URL http://link.aps.org/doi/10.1103/PhysRevA.88.062326
- [13]
del Campo A, Egusquiza I L, Plenio M B and Huelga S F 2013 Phys. Rev. Lett. 110 050403
- [14]
Serafini A 2017 Quantum Continuous Variables: A Primer of Theoretical Methods (CRC Press)
- [15]
Weedbrook C, Pirandola S, García-Patrón R, Cerf N J, Ralph T C, Shapiro J H and Lloyd S 2012 Rev. Mod. Phys. 84(2) 621–669 URL http://link.aps.org/doi/10.1103/RevModPhys.84.621
- [16]
Ferraro A, Olivares S and Paris M 2005 Gaussian States in Quantum Information Napoli Series on Physics and Astrophysics (Bibliopolis) ISBN 88-7088-483-X
- [17]
Aspelmeyer M, Kippenberg T J and Marquardt F 2014 Cavity Optomechanics (Springer Berlin Heidelberg)
- [18]
Leibfried D, Blatt R, Monroe C and Wineland D 2003 Rev. Mod. Phys. 75(1) 281–324 URL http://link.aps.org/doi/10.1103/RevModPhys.75.281
- [19]
Pino H, Prat-Camps J, Sinha K, Venkatesh B P and Romero-Isart O 2016 ArXiv e-prints (Preprint 1603.01553)
- [20]
Romero-Isart O, Pflanzer A C, Blaser F, Kaltenbaek R, Kiesel N, Aspelmeyer M and Cirac J I 2011 Phys. Rev. Lett. 107(2) 020405 URL http://link.aps.org/doi/10.1103/PhysRevLett.107.020405
- [21]
Carlini A, Mari A and Giovannetti V 2014 Phys. Rev. A 90 052324
- [22]
Genoni M G, Lami L and Serafini A 2016 Contemp. Phys. 57 331–349 URL http://dx.doi.org/10.1080/00107514.2015.1125624
- [23]
Eisert J and Wolf M M 2007 Gaussian quantum channels Quantum Information with Continuous Variables of Atoms and Light ed Cerf N J, Leuchs G and Polzik E S (London: Imperial College Press) chap 2, pp 23–42
- [24]
Olivares S 2012 Eur. Phys. J. Spec. Top. 203 3–24
- [25]
Serafini A 2006 Phys. Rev. Lett. 96(11) 110402 URL http://link.aps.org/doi/10.1103/PhysRevLett.96.110402
- [26]
Serafini A, Illuminati F and De Siena S 2004 J. Phys. B. 37 L21–L28
- [27]
Williamson J 1936 Amer. J. Math. 58 141–163 URL https://www.jstor.org/stable/2371062?seq=1#page_scan_tab_contents
- [28]
Meyer C D (ed) 2000 Matrix Analysis and Applied Linear Algebra (Philadelphia, PA, USA: Society for Industrial and Applied Mathematics) ISBN 0-89871-454-0
- [29]
Serafini A 2007 J. Opt. Soc. Am. B 24 347–354
- [30]
Helmberg G, Wagner P and Veltkamp G 1993 Linear Algebra Appl. 185 219 – 233 ISSN 0024-3795 URL http://www.sciencedirect.com/science/article/pii/0024379593902149
- [31]
DK Fadeev, WN Fadeeva 1963 Computational methods of Linear Algebra (Freeman, San Francisco)
- [32]
S-H Hou 1998 SIAM Review 40 706–709 URL http://www.worldscientific.com/doi/abs/10.1137/S003614459732076X
- [33]
Bengtsson I, Ericsson Å, Kuś M, Tadej W and Życzkowski K 2005 Commun. Math. Phys. 259 307–324
- [34]
Coope I D and Renaud P F 2009 J. Inequal. Pure Appl. Math 10 URL http://www.emis.de/journals/JIPAM/article1148.html?sid=1148
- [35]
Holevo A S, Sohma M and Hirota O 1999 Phys. Rev. A 59(3) 1820–1828 URL http://link.aps.org/doi/10.1103/PhysRevA.59.1820
- [36]
Adesso G, Ragy S and Lee A R 2014 Open Syst. Inf. Dyn. 21 1440001 URL http://www.worldscientific.com/doi/abs/10.1142/S1230161214400010
- [37]
Masanes L and Oppenheim J 2017 Nat. Commun. 8 14538 (Preprint 1412.3828)
- [38]
Lami L, Serafini A and Adesso G 2016 ArXiv e-prints (Preprint 1612.05215)
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Wu J W, Li C W, Zhang J and Tarn T J 2007 Ar Xiv e-prints ( Preprint 0708.3147 )
- 2[2] Wu R, Chakrabarti R and Rabitz H 2008 Phys. Rev. A 77 (5) 052303 URL http://link.aps.org/doi/10.1103/Phys Rev A.77.052303
- 3[3] Genoni M G, Serafini A, Kim M S and Burgarth D 2012 Phys. Rev. Lett. 108 (15) 150501 URL http://link.aps.org/doi/10.1103/Phys Rev Lett.108.150501
- 4[4] Shackerley-Bennett U, Pitchford A, Genoni M G, Serafini A and Burgarth D K 2017 J. Phys. A 50 155203
- 5[5] D’Alessandro D 2007 Introduction to Quantum Control and Dynamics (Chapman and Hall/CRC)
- 6[6] Jurdjevic V 1996 Geometric Control Theory: (Cambridge: Cambridge University Press) ISBN 9780511530036 URL https://www.cambridge.org/core/books/geometric-control-theory/1A 9B 7398 F 632D 1A 153E 6F 6B 7AA 18EE 14
- 7[7] Jurdjevic V and Sussmann H J 1972 J. Differ. Equations 12 313 – 329 ISSN 0022-0396 URL http://www.sciencedirect.com/science/article/pii/0022039672900356
- 8[8] Sachkov Y L 2000 J. Math. Sci. 100 2355–2427 ISSN 1573-8795 URL http://dx.doi.org/10.1007/s 10958-000-0002-8 · doi ↗
