A Calculating the concurrence and average codeword fidelity

Assessing quantum error correction: fidelity and entanglement measures with application to photonic codes

Abstract

By interpreting the well-known, qualitative criteria for the existence of quantum error correction (QEC) codes by Knill and Laflamme from a quantitative perspective, we propose a figure of merit for assessing a QEC scheme based on the average fidelity between codewords. This enables us to quantify the performance of a protocol as a whole, including errors beyond the correctable set. Various examples are calculated for photonic qubit codes dealing with the experimentally relevant case of photon loss, demonstrating the advantages of the new measure. In the context of continuous-variable QEC, our codeword-overlap measure can be used to reproduce, in a different way with no need for calculating entanglement measures, a previous result concerning the impossibility of improving transmission of Gaussian states through Gaussian channels via Gaussian operations alone.

pacs:
03.67.Pp, 03.67.Mn, 42.50.Dv
1

I Introduction

Operating a device or scheme in the microscopic domain places formidable demands on the purity and stability of the diverse systems involved, augmented by fundamental limitations of Quantum Mechanics Wootters and Zurek (1982). In this context, ingenious mechanisms to avoid the undesirable effects of decoherence play a fundamental role in many areas of Quantum Information Processing (QIP), most notably, enabling large-scale, fault-tolerant quantum computation Shor (1996) and the communication of quantum bits across large distances Jiang et al. (2009). Such mechanisms typically rely on two different solutions, namely, those provided by Quantum Error Correction (QEC) Gottesman (1997) and teleportation Bennett et al. (1993) combined with Entanglement Distillation or Entanglement Purification Protocols (EPPs) Dür and Briegel (2007).

As these techniques mature over a multitude of implementations, with many advanced protocols already finding applications in real-world conditions, the necessity to define suitable measures to compare and rank different schemes becomes of uttermost importance. In particular, the need arises to find quantities which can be easily computed for the widening range of experimentally accessible states currently used in QIP. Two main measures, in different variants, currently share widespread acceptance: the entanglement degree is traditionally seen as the golden measure when defining the ’quantumness’ of a channel, and is the benchmarking criterion of choice when evaluating EPPs and quantum memory devices Killoran and Lütkenhaus (2011). Conversely, in the realm of QEC, fidelity measures, in particular, the worst-case fidelity Knill and Laflamme (1997) or entanglement fidelity Schumacher (1996), have historically been employed. The connection between these approaches has been investigated in different regimes Bennett et al. (1996); Dür and Briegel (2007), but it is not always a straightforward one: Naively, one could expect codes which improve such fidelities to lead to higher safeguarded entanglement, which is indeed true in certain cases; nevertheless, there are examples Sainz and Björk (2008); Leung et al. (1997); Yönaç and Eberly () where a code will not safeguard any entanglement, up to and including causing entanglement sudden death (ESD) Yu and Eberly (2009), while still improving input-output or entanglement fidelities under certain conditions.

In this contribution, we propose a new measure based on the average fidelity between codewords of a given alphabet, emphasizing that it satisfies certain desirable features. We present initially a motivating argument starting from well-known criteria for the existence of QEC codes, and proceed with examples comparing the entanglement (as measured, in the case of qubits, by the concurrence Wootters (1998)) to our average codeword fidelity for a variety of photonic schemes, with particular attention given to codes designed to protect a logical qubit against amplitude damping Chuang et al. (1997). In the spirit of Scott (2005), we go beyond the analysis traditionally restricted to the correctable error set and establish a comparison method for general schemes. However, here we impose no limitations to a code’s distance or a priori assumptions on the operating regime Aschauer (2004) (correction or detection modes Ashikhmin et al. (2000)). Finally, in the context of continuous-variable QEC with the logical states being infinite-dimensional, we employ our new measure to re-obtain a known result Niset et al. (2009) concerning the impossibility of performing QEC for Gaussian signals and channels when restricted to a Gaussian toolbox.

Ii Error Correction Conditions

Consider a completely positive and trace-preserving map corresponding to a - possibly noisy - transmission/evolution channel. Its action on an arbitrary state is given by

(1)

dubbed the Kraus operator-sum representation Kraus (1983). Based on this channel decomposition, the Knill-Laflamme (K-L) criteria Knill and Laflamme (1997); Bény et al. (2009) establish that an error correction map satisfying exists provided it holds that

(2)

where are the codewords from a given input alphabet, and the define how different errors skew the codespace; in a simplified interpretation, it requires that different codewords remain orthogonal after the action of the channel, and that different errors must effect the same deformation across the input alphabet. Exact satisfiability of the above can only be achieved in certain scenarios Jacobsen and Mintert (); at the same time, allowing for small deviations in the orthogonality and deformability requirements - or, alternatively, for to be close, but not necessarily equal, to the identity Bény and Oreshkov (2011); Barnum and Knill (2002) - enables one to obtain more efficient codes Leung et al. (1997); Bény and Oreshkov (2010). The discrepancies may be employed to bound the entanglement fidelity obtained with the use of the code Ouyang ().

Before proceeding, a few notes are in order. First, in achieving the codewords, an encoding step is implicitly assumed, and, for notation purposes, it is condensed together with the transmission map into a single channel 2; in the case of no encoding/direct transmission, one can simply regard the encoding as the identity map, . Furthermore, we note corresponds to the more general case of a continuous alphabet; in the case of qubits (or other discrete-variable codewords), this should correspond to a Kroenecker delta, .

Motivated by the idea of employing a primarily qualitative criteria as a potentially quantitative measure Eisert et al. (2007), we will explore taking into account violations from the exact satisfiability of Eq. (2) (instead of neglecting such violations up to a certain order in the channel parameters Leung et al. (1997)). Deviations from Eq. (2) can be broken down in two qualitatively different types: first, violations of , which lead different codewords to overlap, and thus reduce the distinguishability between the input alphabet; second, departures from , which in the non-violated case is strictly independent of the codewords, but in the violated case may affect different codewords in unequal manner (and hence may deform a superposition of codewords). Obviously this latter deformation can only take place when the prior effect is also present, but the converse is not necessary 3. We’ll dub codes (i.e., encoding together with transmission channels) in which the entire alphabet is affected uniformly as “non-deformable”, whereas those with codeword-dependent skewness will be called “deformable”.

Non-deformable codes will not preclude the distinguishability to decrease, neither prevent different pairs from suffering varying deformations: the label only guarantees, for any two orthogonal states, the overlap between the original and the resulting states to be the same.

In the case of experimentally relevant amplitude damping channels, direct transmission of the and states (taken here as the occupation numbers of a bosonic mode like in so-called single-rail encoding) yields a deformable code: While the vacuum state is unaffected, the single-excitation is taken to . That the conjugate basis would be uniformly affected does not alter the classification of the code; in fact, for every deformable code there exists at least one superposition in which the deformations are equal. However, considering the dual-rail encoding, and - and assuming, of course, equal dampening in both rails (modes) - one finds again a non-deformable encoding, as any superposition of the codewords will result in an equal, global reduction of the length of the logical state vector.

With the above considerations in mind, one could conceive employing the amount by which the criteria in Eq. (2) have been violated as a measure to rank different channels. We aim at a measure which, instead of classifying codes by the number and kind of errors it is capable of handling, should deliver information precisely about the operators the scheme is not capable of correcting, quantifying just how much it causes the input alphabet to skew and overlap. To this purpose, we construct the codeword overlap of a map by considering the output fidelities obtained from a pair of orthogonal input states, and then averaging this quantity over the entire input alphabet:

(3)

Here, and correspond to the outputs originating from a pair of orthogonal input states and , with . The above loosely corresponds to an integration of Eq. (2), with two important distinctions: first, since the performance of a code should be basis-independent, we cover the surface of the Bloch sphere, taking each pair of diametrically opposed states as possible codewords; second, instead of acting with the Kraus operators individually, we consider the full channel’s effect on the codewords, which enables it to be employed even in channels were a decomposition in form of Eq. (1) is not known.

When considering encodings for spaces larger than qubits (e.g., the qudit codes proposed in Chuang et al. (1997)), one should per – doneform the integration considering opposing states in the surface of the corresponding Bloch hypersphere Kimura (2003).4 This, however, precludes a straightforward generalization for continuous-variable (CV) encodings; nevertheless, one may consider only a truncated set, i.e., a qudit encoding where .

Iii Photon-loss qubit codes

Here we consider the ubiquitous binary logical basis, that is, with the information encoded in orthogonal states and . The transmission of such states via optical fibers corresponds generally to a lossy process, with the fiber absorbing or “losing” photons along its length. This corresponds to a Gaussian channel of particular relevance, dubbed an amplitude damping channel. It is characterized by a loss parameter, , and described, in the Kraus representation of Eq. (1), by an infinite sum () of operators of the form

(4)

Different encodings have been designed to protect qubits against the errors caused by these operators, and are presented below to illustrate the usage of the new measure. The first code considered is the aforementioned dual-rail encoding, which provides detection capabilities only:

(5)

Whenever both modes are found to be in the vacuum state, the information has to be transmitted anew (error detection mode) or, after the decoding step, the output is replaced by the mixed qubit (error correction mode, which will be considered here).

The ubiquitous three-qubit repetition code,

(6)

is capable of correcting any single bit-flip error, and can also be employed against amplitude damping errors, assuming photon loss to be a particular case of bit-flip, with a highly asymmetrical behaviour in which only one of the logical states is affected.

Codes can also be constructed by exploring higher occupations of the bosonic modes. For instance, in Chuang et al. (1997), the authors develop the following encoding, capable of correcting the loss of up to one quanta to the environment:

(7)

Allowing for codes which do not exactly satisfy Eq. (2) enables one to achieve more economical encodings. One such was proposed by Leung et al. Leung et al. (1997),

(8)

which, assuming the damping constant be kept low, is capable of correcting the loss of one excitation to .

Finally, the usage of infinite-dimensional carriers is one that offers numerous advantages in the realm of QIP Lloyd and Braunstein (1999); Ralph et al. (2003). One may thus consider the encoding of qubits on coherent states, which are innately non-orthogonal:

(9)

Here, the encoding can be seen as a channel which irreversibly reduces the distinguishability; in this case, a state is no longer orthogonal to the state found on the diametrically opposing point of the Bloch sphere, with the exception of those lying in the equator. Error correction codes have also been developed in this regime, such as the protocol in Glancy et al. (2004), which effects, up to a normalization,

(10)

capable of correcting amplitude-damping induced phase-flip errors. We note, however, that not only the transmissivity of the channel contributes to this scheme’s performance: also the size of the superposition, which regulates the amount of overlap in the input alphabet, affects the transmission characteristics (see e.g. Wickert et al. (2010); Wickert and van Loock ()).

We proceed by calculating the average codeword overlap for each of the above encodings and comparing it to a different figure of merit, namely, the amount of entanglement preserved after employing the protocol at hand to transmit one half of a two-qubit maximally entangled state (further details are provided in Appendix A). The measures are computed as a function of the channel loss parameter , in the case of the discrete-variable encodings, or for a fixed channel transmissivity, as a function of the coherent-state superposition size .

Figure 1: (Color online) Codeword overlap (top) and concurrence (bottom), as a function of the damping parameter , for different codes: dual-rail, Eq. (5) (blue), three-qubit repetition, Eq. (6) (red), bosonic, Eq. (7) (green, dashed), and four-qubit, Eq. (8) (black, dotted) Wickert and van Loock ().

The results are presented in Figs. 1 and 2. In the former, we observe that the overlaps are zero when the channel approaches perfect transmission: as expected, the orthogonal input codewords remain orthogonal; equally, the entanglement remains maximum. As the losses increase, the overlaps grow; at the same time, the entanglement diminishes. Alone, this fact is highly unsurprising; however, we remark that also the ordering established through one measure is reflected on the other. That is to say, the code which offers the best performance, in terms of codeword fidelities, in a given regime, also returns the highest safeguarded entanglement; as the parameters vary, the relative ordering changes as well, and this is observed in both figures of merit. However, the exact point in which a change of ordering occurs is not strictly always the same: between certain encodings, the channel parameters in which a crossing occurs may differ by small amounts. This is particularly noticeable when examining the three-qubit repetition codes, which is highly deformable and suggests that variations may be related to the codeword-dependent skewness.

All of the above suggests a strong link between the overlapping properties of the output alphabet, and the amount of entanglement capable of being safeguarded by means of a given scheme. Nevertheless, we note that no a priori reason exists to suggest that the crossing points should be precisely the same: after all, we are dealing with measures of apparently different character.

A further observation is in order: while certain encodings lead to entanglement sudden death Yu and Eberly (2009); Yönaç and Eberly (); Sainz and Björk (2008), the equivalent catastrophic breakdown in terms of overlaps (average codeword fidelity equalling unity) does not happen in any encoding until the channel becomes fully lossy. This would suggest that the new measure is capable of portraying certain characteristics which would be otherwise lost in an analysis solely based on the entanglement.

In Fig. 2, we observe the behavior of different coherent-state encodings as a function of the superposition size . Again, a good agreement is found between the ordering obtained through concurrence and codeword overlaps. Notable is the difference in the case of direct transmission: while it is possible to obtain a maximally entangled state in the limit of , the alphabet as a whole becomes indistinguishable and thus impractical for encoding purposes - a feature reflected by the codeword overlap measure.

Iv Gaussian Error Correction No-Go

Optical modes of the electromagnetic field, whose quadratures satisfy the canonical commutation relations, provide a natural testbed for a wide range of quantum information concepts Braunstein and van Loock (2005). Here, logical information is encoded by means of a truly continuous logical alphabet; for instance, the codewords defined by the position eigenstates . In this scenario, the so-called Gaussian operations - defined as those that map Gaussian states into Gaussian states - are of great relevance due to the ease in which they can be implemented with current experimental resources.

Nevertheless, the capabilities of the Gaussian set are not without restrictions. Given the fragility of the quantum resources in face of ubiquitous decoherence mechanisms, a significant limitation is that such operations are incapable of distilling higher entanglement from less entangled Gaussian states Giedke and Cirac (2002); Eisert et al. (2002); Fiurasek (2002), or, in close relation, unable to protect Gaussian states from the widespread class of Gaussian errors Niset et al. (2009).

Interestingly, Gaussian transformations alone suffice to suppress and correct non-Gaussian errors acting on arbitrary states, but in particular, the Gaussian transformations also suffice when the non-Gaussian errors act upon Gaussian input states Braunstein (1998); Aoki et al. (2009); Niset et al. (2008); van Loock (2010); equally worth noting is the fact that a Gaussian error channel, when acting upon specific non-Gaussian input states, can exhibit stochastic, non-Gaussian behaviour Cochrane et al. (1999), however, in this case Gaussian encoding and decoding procedures alone appear to be incapable of correcting such errors, and non-Gaussian operations should be accounted for Glancy et al. (2004).

In this section, we’ll employ the codeword overlap measure in order to explore what kind of statements it allows us to make in the context of continuous-variable QEC, in particular, in relation to the aforementioned No-Go theorem for all-Gaussian QEC Niset et al. (2009). Most importantly, such an approach enables us to obtain fundamental insights in a rather distinct way, without the need for calculating an entanglement measure (such as the logarithmic negativity employed in Ref. Niset et al. (2009)). We note that the quantity as developed in Eq. (3) is based on averaging the fidelity between the channel-output states which originate from two orthogonal input states. However, here, in order to include the possibility of non-orthogonal input states as it is typically the case for a Gaussian alphabet, we’ll consider two general states: if the output overlap between two arbitrary states cannot be reduced through QEC, then, in particular, it also holds that the overlap between two orthogonal states (after their channel transmission) will not decrease, and integrating over all possible pairs of states will furthermore not result in a lower quantity, thus establishing the desired result.

The fidelity between two states and is given, in the characteristic function formalism, by

(11)

For Gaussian states with zero mean, the characteristic function is given by , and we can re-write the above expression as

(12)

which evaluates to Scutaru (1998)

(13)

with and . Now, the action of a Gaussian channel on the level of the covariance matrices is given by (see Appendix B for details). Taking this transformation in acount, the resulting fidelity is

(14)

where , and   .

Now, to establish a relationship between and , we must evaluate the resulting effect from and in the above (for detailed arguments see Appendix C). We are faced with three relevant cases: (i) , (ii) and (iii) . The first case is trivially evaluated: when , this corresponds to a Gaussian unitary, which, as expected, yields exactly the original fidelity, i.e., . For , representing the addition of classical (thermal) noise, one observes the difference between the square roots in Eq. (14) to diminish, and thus the fidelity to increase. The second case also finds a straightforward solution based on the same argument. The third case, however, contemplates channels which do not necessarily induce a spreading of the Gaussian state, and requires a more careful analysis. In this case, the action of the map results in a “contraction” towards a common state. This is clearly exemplified by the prototypical amplitude damping channel, using two displaced thermal states as inputs: as the loss parameter increases, the states are gradually attracted towards the vacuum state; however, the increased purity (and correspondingly reduced values of ) plays no role in diminishing the overlaps.

We note furthermore that displacements (i.e., shifts in the first-order moments) bear no effect in the above, simply rescaling and by a fixed amount.

One can then conclude that, except when corresponds to a symplectic operation, either the additional noise will cause a spreading of the Gaussian state, or the states will be contracted towards a common state. In any case, the fidelity to any other state subject to the same action is bound to increase. When the decoding operation is equally symplectic, one can at best re-obtain the original state (through ), assuming, of course, that the encoding operation already had the best choice of unitary operations.

In the above discussion, eventually we considered input states of a Gaussian nature, thus reproducing the known No-Go result for all-Gaussian QEC Niset et al. (2009) in terms of our fidelity-based codeword criterion and independently of entanglement measures. The treatment of Gaussian codeword pairs above is analogous to our earlier treatment for the qubit codes, and the argumentation follows through depending on the assumption of a Gaussian input alphabet (see Appendix C).

V Conclusions and Outlook

We have defined a quantitative measure based indirectly on the amount by which the well-known quantum error correction criteria by Knill and Laflamme are violated, proposing the use of averaged codeword fidelities as a figure of merit to evaluate different quantum protocols. By quantifying how distinguishable originally orthogonal inputs emerge from an error channel, the measure finds a natural interpretation as a translation, into the quantum regime, of the classical coding theory notion of confusability of an alphabet Shannon (1956); ?.

While initially harder to compute, by requiring the evaluation of the fidelity between two generally mixed states, the codeword overlap measure does not require the optimization (minimization) necessary to obtain the worst-case fidelity. At the same time, it accurately depicts the alphabet’s distinguishability behaviour which fails to be portrayed by means of the entanglement fidelity or conventional entanglement measures. We emphasize that properly describing this distinguishability, both in an ideal and in a noisy or lossy quantum channel, becomes particularly important when the ideal (quantum) codewords are already non-orthogonal, as it is often the case when the quantum information carriers are continuous-variable oscillator states.

The employment of the codeword overlap reflects qualitatively the behaviour found when quantifying the performance by means of other figures of merit, in particular here the concurrence. In other words, whenever the variation of a certain channel parameter causes one scheme to improve (reduce) the average codeword fidelity in comparison to another scheme, one also observes that the first scheme will result in an improved figure in the safeguarded entanglement. This matching was also found to be quantitatively exact for certain choices of codes, however, the precise reasons for such behaviour are hitherto unknown.

We have also employed the new measure to reaffirm the impossibility of improving the transmission of Gaussian states, subject to Gaussian noisy channels, through Gaussian operations alone. In this case, the No-Go result was found independently of an entanglement measure, solely based upon the overlap of Gaussian codeword pairs.

Finally, since the measure is, in principle, accessible and computable in those instances where entanglement is found hard to quantify (i.e., infinite-dimensional non-Gaussian states), we expect these results to shed light in other aspects of (photonic) error correction in particular and quantum information in general.


Acknowledgements

The authors thank Carlo Cafaro for comments to the manuscript and acknowledge discussions with Dominik Hörndlein in the early stages of this project. Portions of this work were carried out while R.W. was visiting the Institute for Quantum Computing in Waterloo, Canada. He is grateful for the hospitality and inspiring discussions with the Optical Quantum Communication Theory group. Financial assistance from the “Collaborative Training in Quantum Information Processing” program is gratefully acknowledged. This work was supported by the German Research Foundation (Deutsche Forschungsgemeinschaft - DFG) via its Emmy Noether Program, and by the Federal Ministry of Education and Research (Bundesministerium für Bildung und Forschung - BMBF) by means of the HIPERCOM project.

Appendix A Calculating the concurrence and average codeword fidelity

In obtaining the codeword overlap curves depicted in Figs. (1) and (2), the following procedure is used:

For each encoding, an input qubit is prepared in the state ; concomitantly, a second state is prepared, , ensuring that . Each of those states is then subject to the transmission channel characterized by the operators in Eq. (4). Followed by each code’s respective decoding procedure, the following outputs are found:

Direct transmission results in

(15)

and

(16)
To the dual-rail encoding corresponds
(17)

and

(18)

The 3-qubit code produces

(19)

and

(20)

For the bosonic encoding, one finds

(21)

and

(22)

Finally, for the “approximate” encoding, the outputs are

(23)

and

(24)

With the above, Eq. (3) is then computed by means of a numeric integration procedure over and . At each value of , approximately 1000 states are employed to produce the average, although for less deformable encodings a smaller sample already resulted in an adequate agreement with the asymptotic behaviour.

For evaluating the entanglement-safeguarding capabilities of a scheme, the maximally entangled state is employed, transmitting the encoded mode through the lossy channel, afterwards followed by the decoding procedures. We note that the decoding operations reduce the encoded state back to a qubit subspace, therefore allowing the entanglement to be computed on a Hilbert space.

For the entanglement analysis developed in the text, we consider Wooters’ concurrence, which is obtained through

(25)

Here, are the eigenvalues, in decreasing order, of , where , and is the Pauli operator in the -th mode.

In the case of coherent-state encodings evaluated in Fig. (2), the input state for both direct transmission and the different encodings is

(26)

with , , and the normalization constant , required due to the non-orthogonal nature of the coherent-state alphabet. When considering the error correction protocol Glancy et al. (2004), the deterministic operation of the scheme is considered; in other words, the transformation in Eq. (10) is only obtained for large superposition sizes, with smaller incurring an erroneous component (see ref. Wickert and van Loock () for details). This induces in a double-tradeoff between the superposition size and the figure of merit being considered: while on the one hand, larger “cat states” are desired - not only due to their inherenty larger distinguishability, but also for the operation of the non-Gaussian Hadamard gates found in the protocol - on the other hand, this effects an increased channel-induced phase-flip probability.

For computing the concurrence in the later case, two-mode maximally entangled states are employed,

(27)

Again, the first mode is kept while the second is sent through the error-correcting scheme. Finally, for the above calculations, it helps to express the density matrices in terms of an orthogonal basis , such that

(28)

Appendix B Gaussian Formalism

b.1 Gaussian States

Here we briefly review the Gaussian formalism, adopting the convention from Giedke and Cirac (2002).

Given the Weyl operators

(29)

where and , with the commutator relations , a Gaussian state is defined as having a Gaussian characteristic function . An equivalent definition can be given in terms of the state’s Wigner function, which can be obtained from the characteristic function by a Fourier transform, and is also Gaussian-shaped. One defines the first and second order moments d and , respectively the displacement vector and the covariance matrix (CM), by and . In most cases, d can be set to zero without loss of generality. The CM satisfies , where we define the symplectic matrix

(30)

The displacement vector and covariance matrix completely determine the state , whose density operator can be written as

(31)

Of special relevance is the maximally entangled state (MES), corresponding to an infinitely squeezed two-mode squeezed state (TMSS), with CM

(32)

where and are both matrices, and

(33)

b.2 Gaussian Operations

A Gaussian channel is defined as a map taking Gaussian states into Gaussian states, cf. . Following the Choi-Jamiolkowski isomorphism between completely positive maps and positive operators Jamiolkowski (1972), to every Gaussian map there corresponds an operator ,

(34)

this equation allowing us to re-interpret the transmission of an arbitrary state through as a teleportation using as the entangled resource state, i.e.,

(35)

One should note that, since maps Gaussian states into Gaussian states, and in Eq. (34) can be taken as the limit of a Gaussian state, must itself correspond to a Gaussian operator which, similarly to (31), can also be written as

(36)

with appropriately-defined CM , displacement vector and a normalization constant . Now, by employing Eq. (35) and replacing with the operator in Eq. (36), one can obtain the action of on a general state, ie, obtain and in from and 5.

We now consider the set of operations which can be implemented by augmenting our system with additional (Gaussian) ancillary states, performing Gaussian unitary operations over the whole combined system and discarding (tracing over) the ancillas, thus obtaining the class of Gaussian completely positive trace-preserving (CPTP) maps. The action of such a map on a state with CM is given by

(37)

with real and real and symmetric. We must also have

(38)

lest the complete-positivity requirement be violated. The Gaussian operator corresponding to this operation has the CM

(39)

The solutions to Eq. (38) with (adding no extra noise) and (preserving the sum of areas) are dubbed symplectic transformations. In the quantum-optical context, these are exemplified by unitaries such as squeezers, phase shifters, or lossless beam-splitters. One can easily verify those to be the channels with minimal entanglement degradation Niset et al. (2009), or equally, those preserving the newly-developed codeword overlap measure.

Finally, we note that the identity map, , is obtained in Eq. (37) by taking and (being thus a symplectic operation), and reduces the expression (39) to the CM of the maximally entangled () TMSS, Eq. (32).

Appendix C Fidelity between Gaussian states

The effect of a Gaussian channel on the level of the covariance matrices is given by . In order to facilitate the treatment of such expression when evaluating fidelities, we note that the above Gaussian channel can be parametrized by means of a singular value decomposition. This gives rise to an equivalent channel characterised by the matrices

(40)

Since , and are all symplectic, the overlaps between the original and transformed channel remain unaltered. Now, (and equally for and ); furthermore, without loss of generality we can choose as proportional to the identity, i.e., . Doing so greatly simplifies the expression for the fidelity after the Gaussian operations, since one can then basically employ the original determinants, up to a scaling factor.

Now, to establish a relationship between and , we must evaluate the resulting effect from and in the above. We are faced with three relevant cases: (i) , (ii) and (iii) .

The first case, , with corresponds to a Gaussian unitary and is trivially evaluated, yielding, as expected, exactly the original fidelity

For , representing the addition of classical (thermal) noise, and equivalently for the second case, , with help of the parametrization in Eq. (40), one trivially observes the difference between the square roots in Eq. (14) to diminish, and thus the fidelity to increase. The later holds for quantum-limited maps Ivan et al. (2011) where bounds Eq. (38); and evidently for those cases where a second, (classical) noise channel follows.

The third and final case, however, involves a more elaborate analysis. Using the expression for the symplectic transformation Eq. (40) in Eq. (14), expressing the relevant quantities in terms of the parameter governing and , and employing the physicality constraints for Gaussian channels (see Eq. (38) in Appendix B), one finds, after long but otherwise straightforward calculations, that

(41)

has an empty solution set; and thus, the fidelity is indeed bound to increase.

Finally, in order to fully appreciate that the treatment with codeword pairs of Gaussian states developed in section IV is analogous to our earlier treatment for the qubit codes in section III, and also that the argument follows through depending on the assumption of a Gaussian input alphabet, notice the following. A pair of continuous-variable codewords may be written as and , similar to our and states for qubits, but with the general Bloch-sphere parameters (App. A) this time replaced by two general wave functions and ; the states and are also no longer restricted to be orthogonal. Now assuming that the logical states that span the continuous codespace are the result of an arbitrary, unitary Gaussian encoding operation acting upon a one-mode basis state together with an arbitrary Gaussian multi-mode ancilla state , , we obtain for the two input states,

(42)

with . Under the assumption of two Gaussian wave functions and , it is guaranteed that the resulting state above is again a Gaussian state. However, for two arbitrary wave functions and , the resulting states can be non-Gaussian, and the averaging for obtaining our overlap measure would have to include non-Gaussian codewords as well (corresponding to the more general scenario of arbitrary signal states subject to Gaussian encoding/decoding operations and Gaussian error channels). In this latter case, the above analysis for the Gaussian overlaps would no longer suffice. Therefore, we must assume that and represent any pair of Gaussian wave functions, and the above arguments follow through. Note that this conclusion is robust against a change of the basis of the original signal state, (with being the photon number basis), in which case

(43)

and where is generally a non-Gaussian state, but is a Gaussian state, provided that is a Gaussian state too.

Footnotes

  1. preprint: PRE/005
  2. Explicitly, this means that the initial signal Hilbert space is extended, typically by adding a sufficient set of ancilla states and applying a global encoding unitary on the signal-ancillae system. The total system is then subject to a global channel transmission, which is usually composed of the original channel acting individually and independently on the signal and ancilla subsystems. In the optical setting, enlarging the Hilbert space may mean either adding extra modes or allowing for higher photon numbers with the same number of modes. In the latter case, there are no additional channels that must act on auxiliary modes.
  3. More precisely, when taking each channel Kraus operator separately like in Eq. (2), of course each Kraus effect can affect different codewords differently, even though their overlap remains unaffected. An example is the amplitude damping channel acting on a single-rail qubit basis, for which we have , , but also (see later, Eq. (4)). In other words, the length of vector is reduced for any non-zero and that of vector remains unity, while they would perfectly maintain their orthogonality. However, note that by taking into account a second Kraus effect, which together with the first Kraus effect forms a trace-preserving qubit channel, the deformation is indeed accompanied by a reduction of the codeword distinguishability: . Our codeword overlap measure, as defined in Eq. (3) for the whole trace-preserving channel, therefore captures both deformation and non-orthogonality at the same time (see below).
  4. The form above is of course not exactly convenient when considering such encodings of higher dimensions. Already in the case of a qutrit () this is easily seen: an arbitrary logical state has the general form , and a possible codeword is , which has infinitely many states orthogonal to it (for instance, any state of the form with ). Thus, in order to calculate the measure, for every state, one has to consider the average fidelity to each of the possible orthogonal states.
  5. The interested reader should follow sections II and III in ref. Giedke and Cirac (2002) for a complete discussion of this procedure.

References

  1. W. K. Wootters and W. H. Zurek, Nature 299, 802 (1982).
  2. P. W. Shor, in Proceedings of the 37th Annual Symposium on Foundations of Computer Science (1996) pp. 56 –65.
  3. L. Jiang, J. M. Taylor, K. Nemoto, W. J. Munro, R. Van Meter,  and M. D. Lukin, Phys. Rev. A 79, 032325 (2009).
  4. D. Gottesman, Reliable Quantum Information Processing, Ph.D. thesis, California Institute of Technology (1997).
  5. C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres,  and W. K. Wootters, Phys. Rev. Lett. 70, 1895 (1993).
  6. W. Dür and H. J. Briegel, Rep. Prog. Phys. 70, 1381 (2007).
  7. N. Killoran and N. Lütkenhaus, Phys. Rev. A 83, 052320 (2011).
  8. E. Knill and R. Laflamme, Phys. Rev. A 55, 900 (1997).
  9. B. Schumacher, Phys. Rev. A 54, 2614 (1996).
  10. C. H. Bennett, D. P. DiVincenzo, J. A. Smolin,  and W. K. Wootters, Phys. Rev. A 54, 3824 (1996).
  11. I. Sainz and G. Björk, Phys. Rev. A 77, 052307 (2008).
  12. D. W. Leung, M. A. Nielsen, I. L. Chuang,  and Y. Yamamoto, Phys. Rev. A 56, 2567 (1997).
  13. M. Yönaç and J. H. Eberly, arXiv:1211.5654 .
  14. T. Yu and J. H. Eberly, Science 323, 598 (2009).
  15. W. K. Wootters, Phys. Rev. Lett. 80, 2245 (1998).
  16. I. L. Chuang, D. W. Leung,  and Y. Yamamoto, Phys. Rev. A 56, 1114 (1997).
  17. A. Scott, Quant. Inf. Proc. 4, 399 (2005).
  18. H. Aschauer, Quantum communication in noisy environments, Ph.D. thesis, Ludwig-Maximilians-Universität München (2004).
  19. A. Ashikhmin, A. Barg, E. Knill,  and S. Litsyn, IEEE Trans. Inform. Theory 46, 778 (2000).
  20. J. Niset, J. Fiurasek,  and N. J. Cerf, Physical Review Letters 102, 120501 (2009).
  21. K. Kraus, States, Effects, and Operations (Springer, 1983).
  22. C. Bény, A. Kempf,  and D. W. Kribs, J. Math. Phys. 50, 062108 (2009).
  23. S. H. Jacobsen and F. Mintert, arXiv:1302.6450 .
  24. C. Bény and O. Oreshkov, Phys. Rev. A 84, 022333 (2011).
  25. H. Barnum and E. Knill, J. Math. Phys 43, 2097 (2002).
  26. C. Bény and O. Oreshkov, Phys. Rev. Lett. 104, 120501 (2010).
  27. Y. Ouyang, arXiv:1302.3247 .
  28. J. Eisert, B. Fernando,  and K. Audenaert, New J. Phys 9, 46 (2007).
  29. G. Kimura, Phys. Lett. A 314, 339 (2003).
  30. S. Lloyd and S. L. Braunstein, Phys. Rev. Lett. 82, 1784 (1999).
  31. T. C. Ralph, A. Gilchrist, G. J. Milburn, W. J. Munro,  and S. Glancy, Phys. Rev. A 68, 042319 (2003).
  32. S. Glancy, H. M. Vasconcelos,  and T. C. Ralph, Phys. Rev. A 70, 022317 (2004).
  33. R. Wickert, N. K. Bernardes,  and P. van Loock, Phys. Rev. A 81, 062344 (2010).
  34. R. Wickert and P. van Loock, arxiv:1303.0273 .
  35. S. L. Braunstein and P. van Loock, Rev. Mod. Phys. 77, 513 (2005).
  36. G. Giedke and J. I. Cirac, Phys. Rev. A 66, 032316 (2002).
  37. J. Eisert, S. Scheel,  and M. B. Plenio, Phys. Rev. Lett. 89, 137903 (2002).
  38. J. Fiurasek, Phys. Rev. Lett. 89, 137904 (2002).
  39. S. L. Braunstein, Nature 394, 47 (1998).
  40. T. Aoki, G. Takahashi, T. Kajiya, J. Yoshikawa, S. L. Braunstein, P. van Loock,  and A. Furusawa, Nature Phys. 5, 541 (2009).
  41. J. Niset, U. L. Andersen,  and N. J. Cerf, Phys. Rev. Lett. 101, 130503 (2008).
  42. P. van Loock, J. Mod. Opt. 57, 1965 (2010).
  43. P. T. Cochrane, G. J. Milburn,  and W. J. Munro, Phys. Rev. A 59, 2631 (1999).
  44. H. Scutaru, J. Phys. A: Math. Gen. 31, 3659 (1998).
  45. C. Shannon, Information Theory, IEEE Transactions on 2, 8 (1956).
  46. L. Lovasz, Information Theory, IEEE Transactions on 25, 1 (1979).
  47. A. Jamiolkowski, Rep. Math. Phys 3, 275 (1972).
  48. J. S. Ivan, K. K. Sabapathy,  and R. Simon, Phys. Rev. A 84, 042311 (2011).
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minumum 40 characters
Add comment
Cancel
Loading ...
103315
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description