Abstract:
A method and system for handling information in a noisy environment in the form of at least one information carrying mode is disclosed. A plurality of encoded modes are generated by linear transformation of the information carrying mode, said encoded modes being provided on respective independent channels. The encoded modes are linearly combined to generate at least one decoded mode. A set of receiver channels is provided for receiving the decoded mode wherein one of said set of receiver channels is designated as a useful channel, and a useful signal is supplied as the decoded mode if it is received on the useful channel an discarded if it is received on the other receiver channels of the set, wherein the useful signal represents said information substantially uncorrupted by noise. The technique is applicable to quantum, classical or mesoscopic environments. The invention also provides a method and system for generating correlated states using a similar filtration technique. The invention is particularly useful when applied to data communications or data storage.

Description:
FIELD OF THE INVENTION  
         [0001]    The present invention relates to a method and system for handling information in a noisy environment, and also to a method and system for generating correlated particle states in a noisy environment.  
         BACKGROUND TO THE INVENTION  
         [0002]    The last five years has seen the emergence of the new field of quantum information processing. The behaviour of individual microscopic particles—atoms, electrons and photons etc., which is described by the theory of quantum mechanics, is completely different from the behaviour of macroscopic objects made of large numbers of such particles. The key realisation which led to the emergence of the field is that quantum mechanics allows the processing of information in fundamentally new ways. This offers the possibility of immense advantages over current information processing technologies which are all essentially based on classical mechanics.  
           [0003]    Specific tasks for which it has been proven that quantum information processing offers advantages over classical information processing include:  
           [0004]    Communication. In certain circumstances quantum communication is more powerful than classical communication. For instance the amount of quantum communication required to perform certain computational tasks can be significantly smaller than the amount of classical communication. (This aspect is known as communication complexity.) Quantum communication also allows novel, and in principle unbreakable, cryptographic schemes.  
           [0005]    Computation. A computer that runs according to the rules of quantum mechanics can perform certain computations faster than a classical computer. In particular there has been described a quantum algorithm for factorising integers which is exponentially faster than any known classical algorithm.  
           [0006]    Just as in classical information processing, errors occur in quantum information processing, and these have to be corrected. However quantum errors are fundamentally different in character from classical errors, and the correction of quantum errors requires new techniques.  
           [0007]    When quantum communication was first proposed it was felt that interactions of the system with the environment, and the consequent loss of information into the environment, would produce errors in communication which would be un-correctable even in principle (i.e. it was felt that quantum error-correction would be ruled out by the laws of quantum mechanics). However it was shown in 1995-96, using two different approaches, that quantum error correction was in fact possible.  
           [0008]    On the one hand it was shown in C H Bennett, et al, Phys Rev Lett 76 (1996) 722, that entanglement could be protected against decoherence with the environment. The basic idea of this scheme known as entanglement purification, is that from several impure entangled states one can obtain, using only local operations and classical communication, a smaller number of states with higher entanglement. These entangled states can then be used in communication protocols, for example teleportation.  
           [0009]    On the other hand it was shown by P W Shor, Method for reducing decoherence in a quantum computer memory, U.S. Pat. No. 5,768,297; P W Shor, Phys Rev A, 52 (1995) R2493 and A M Steane, Phys Rev Lett, 77 (1996) 793, that a quantum memory could be protected against interactions with the environment. The basic idea in this case is to encode each logical quantum bit (qubit) in an entangled superposition of several qubits. The encoded state is chosen in such a way that if a small number of errors affect the individual qubits in the superposition, the errors do not destroy the encoded qubit.  
           [0010]    The connections between these two results were studied in C H Bennett, D P DiVincenzo, J A Smolin, W K Wootters, Phys Rev, A54 (1996) 3824-3851, by exploiting the fact that a memory can be viewed as a communication scheme in which the communication takes place in time rather than in space. In particular it was shown in C H Bennett, D P DiVincenzo, J A Smolin, W K Wootters, Phys Rev, A54 (1996) 3824-3851, that a protocol for purification of entanglement that uses only one way classical communication can be mapped into a protocol for the protection of a quantum memory against decoherence. Shor-Steane codes can also be used for error correction for communication by first encoding the qubits using Shor-Steane codes, sending the qubits through the noisy channel and then decoding.  
           [0011]    These results subsequently led to the proof that one could in principle realise fault tolerant quantum computation as described in P W Shor, Proc 37th Symposium on the Foundations of Computer Science (Los Alamitos, Calif.; IEEE Comp Sci Press, (1996) p 15.  
           [0012]    In all the above work the authors were not concerned with technological feasibility, but rather with proving a point of principle. These protocols are relevant for multi-particle quantum systems and for errors which act locally on the individual particles. The primary difficulty with all these protocols is that in order to be implemented they require controlled interactions between many particles. This is technically impossible at present and is likely to remain so in the foreseeable future.  
           [0013]    Braunstein in Nature 394 (1998), 47 and Lloyd and Slotine in Phys Rev Letters 80 (1998), 4088, have proposed methods for implementing Shor-Steane error correction protocols without multi-particle interactions. Their methods are based on the use of continuous quantum variables for quantum logic (to be opposed to the discrete variables, for instance qubits, used in earlier work). The quadratures of the electromagnetic field provide a convenient realisation of such variables. It was shown in Phys Rev. Letters 90 (1998) 4084, that quantum error correction codes could be generalised to continuous quantum variables. These methods apply to a particular physical system, namely light, and require the use of a special type of quantum states: squeezed states of light. Highly squeezed states, which are needed for the Braunstein and Lloyd and Slotine protocols are technologically difficult to prepare and maintain. Furthermore these protocols use active detection of errors and active error correction.  
           [0014]    Bouwmeester in quant-ph/006108 has an alternative communication protocol. His method relies on distributing a standard entangled state (a singlet) between two parties. The protocol is limited to correcting classical-type commuting errors (such as spin-flips) when the state propagates through a noisy channel. It does not correct the arbitrary interactions with the environment which occur in the framework used by Bouwmeester. Furthermore the Bouwmeester protocol avoids multi-particle interactions at the expense of using sources which emit very special states (of GHZ-type). Even in the simplest case of correction of a single spin-flip on one party of a singlet propagating through a noisy channel, such sources are at the current limit of technology. Correction of more spin-flip errors requires sources which are beyond the limits of current technology.  
           [0015]    It is an aim of the present invention to provide a method and system for handling information which will remove errors introduced by noise. The aim is to provide a method and system which is widely applicable not only to quantum information but also to classical wave signals.  
           [0016]    According to one aspect of the present invention there is provided a method of handling information in a noisy environment in the form of at least one information carrying mode, comprising the steps of generating a plurality of encoded modes by linear transformation of the information carrying mode, said encoded modes being provided on respective independent channels; linearly combining the encoded modes to generate at least one decoded mode; providing a set of receiver channels for receiving the decoded mode wherein one of said set of receiver channels is designated as a useful channel; and supplying as a useful signal the decoded mode if it is received on the useful channel and discarding the decoded mode if it is received on the other receiver channels of the set, wherein the useful signal represents said information substantially uncorrupted by noise.  
           [0017]    According to another aspect of the invention there is provided a system for handling information in a noisy environment in the form of at least one information carrying mode, the system comprising: means for generating a plurality of encoded modes by linear transformation of the information carrying mode, said encoded modes being provided on respective independent channels; means for linearly combining the encoded modes to generate at least one decoded mode; a set of receiver channels for receiving the at least one decoded mode wherein one of said set of receiver channels is designated as a useful channel; and means for supplying as a useful signal the decoded mode if it is received on the useful channel and discarding the decoded mode if it is received on the other receiver channels of the set, wherein the useful signal represents said information substantially uncorrupted by noise.  
           [0018]    The word “mode” used herein applies equally well to systems described by classical or quantum mechanics. In the quantum case it is used, according to its standard meaning in the second quantized description of quantum systems, to denote a set of states, including states with zero, one, two or more particles. In quantum mechanics, one can get super-positions of such states. Thus a first information carrying mode can provide a set of states of no particles in mode 1, one particle in mode 1, etc. In quantum mechanics, a mode can be populated by less than one particle in the sense that the state of the mode can be a superposition of the state with no particles and the state of one particle, for example. In the case of classical wave systems, the word “mode” refers to a basic solution of the appropriate wave equation.  
           [0019]    In describing our inventions, we make use of two standard ways of treating quantum systems: the first and second quantization languages. The language of second quantization is more general and can be used in all situations for systems containing any number of particles. Hence all the quantum protocols in this document could have been described in the second quantized language (using the notions of quantum modes, creation and annihilation operators etc.). The first quantization language is, however, more convenient and simpler for systems containing a fixed number of particles. In this document both languages are used, according to which one seems simplest in the given situation.  
           [0020]    A key element of our protocols is that the encoding and decoding operations are realised by “linear” transformations. In the case of quantum systems, by linear we mean that the effective interaction implementing the encoding and decoding, as it applies to the space of states we are interested in, is linear; i.e. its effect on the creation operators associated to the quantum modes (in the second quantized language) is such that they undergo linear transformations (for other states, outside the space of states in which we are interested, the true interaction may be non-linear, but this is irrelevant for our protocols). In particular this means that all our single particle and entanglement distribution protocols are linear, by definition. In the context of classical waves, the equivalent notion is that the classical modes undergo linear transformation.  
           [0021]    Where an information carrying mode is populated by at least one particle, the encoded modes can be thought of as a plurality of states of the particle which, once generated, can be linearly combined to reconstitute the at least one particle. When one particle is reconstituted, it is detectable at only one of the receiver channels, which may or may not be the useful channel. In that scenario, the useful signal is constituted by particles which are detected on the useful channel, while particles detected on the other receiver channels are discarded.  
           [0022]    The term “useful channel” is used to denote those of the receiver channels at which any particle which arrives is in a good, substantially noise free state. As explained later, the underlying theory indicates that particles which arrive on the useful channel will constitute a useful, substantially noise free signal. Some particles will not arrive at the useful channel. The probability of particles appearing in the useful channel is linked to the noise level. Thus, by using the technique of the present invention it is possible to utilise the signal which appears at the useful channel on the basis that it is substantially noise free. Conversely, particles/signals appearing on the other channels are completely ignored or “discarded”. That is, those particles are not used in the output signal or used to modify it.  
           [0023]    By the phrase “substantially uncorrupted by noise”, it is meant that the signal contains substantially the same information as in its original state. The invention is particularly suitable for the removal of noise in cases where the noise on each channel is independent of that on any other channel.  
           [0024]    It is indicated above that the useful signal “represents” the original information substantially uncorrupted by noise. That is, the information can be recovered in a form substantially identical to its original form, but with reduced amplitude/power (representing the fact that a part of the original signal has been discarded). However it is also possible for the signal which is received to be a modified version of the original information, by virtue of the fact that the channels have been subject to a linear or logical manipulation between the encoding and decoding.  
           [0025]    It will be appreciated that the invention is applicable to communication and/or storage as discussed in more detail in the following.  
           [0026]    The invention has several important facets.  
           [0027]    No multi-particle interactions are needed to provide a substantially noise free particle or signal. This is particularly important since at the present time controlled inter-particle interaction is technologically unfeasible.  
           [0028]    Moreover, the encoding and combining steps can be carried out by passive transformations. It had earlier not been thought possible to eliminate noise using only passive transformations.  
           [0029]    According to another aspect of the present invention there is provided a communication system for transmitting information in a noisy environment comprising: an input for receiving a physical information signal in the form of a wave; a splitter for splitting the signal into a plurality of transmission components; a plurality of transmission paths, each carrying a respective transmission component; a combiner for combining the transmission components and generating a set of output signals on respective output channels, wherein one of said output channels is designated as a useful channel; a detector for detecting the output signal on the useful channel, wherein the output signals on the other output channels are discarded and wherein the output signal on the useful channel contains said information substantially uncorrupted by noise.  
           [0030]    A further aspect provides an optical communications system for transmitting information in a noisy environment, comprising: an input for receiving an optical information signal; a splitter for splitting the optical information signal into a plurality of optical beams; a combiner for combining the optical beams and for generating a set of separated optical output signals, one of said signals being designated as a useful signal; and a detector located to pick up the useful output signal, wherein the other output signal are discarded.  
           [0031]    The invention can also be used to generate particle states correlated to a predetermined degree. According to this aspect there is provided a method of generating particle states correlated to a predetermined degree at separated locations in a noisy environment, the method comprising: generating a first set of transmission sub-states of a first particle and a second set of transmission sub-states of a second particle, the transmission sub-states representing a greater degree of correlations than the predetermined degree; transmitting the first set of transmission sub-states on respective ones of a first plurality of independent transmission channels; transmitting the second set of transmission sub-states on respective ones of a second plurality of independent transmission channels; combining the first set of transmission sub-states to generate receiver states of the first particle on respective ones of a first set of output channels; combining the second set of transmission sub-states to generate receiver states of the second particle on respective ones of a second set of output channels; determining whether or not to use or discard the states of the first and second particles depending on the output channels in which they arrive, wherein the states of the first and second particles which are determined to be used are available on corresponding channels of the first and second sets and are correlated to said predetermined degree.  
           [0032]    Another aspect provides a system for generating particle states correlated to a predetermined degree at separated locations in a noisy environment, the system comprising: a source configured to generate a first set of transmission substates of a first particle and a second set of transmission sub-states of a second particle, the transmission substates representing a greater degree of correlation than the predetermined degree; a first plurality of transmission paths arranged between the source and a first decoder for conveying respectively the first set of transmission sub-states; a second plurality of transmission paths arranged between the source and a second decoder for conveying respectively the second set of transmission sub-states; wherein the first decoder is operable to combine the transmission sub-states to generate receiver states of the first particle on respective ones of a first set of output channels; wherein the second decoder is operable to combine the transmission substates to generate receiver states of the second particle on respective ones of a second set of output channels; and means for determining whether or not to use or discard the states of the first and second particles depending on the output channels in which they arrive, wherein the states of the first and second particles which are determined to be used are available on corresponding channels of the first and second sets and are correlated to said predetermined degree.  
           [0033]    By way of explanation, consider the case where first and second receivers are located to receive signals from the first and second decoders respectively. The correlated states will appear on corresponding channels. That is, if the first receiver uses channels  1  and  3  then the second receiver should use  1  and  3 . If the first receiver uses channels  2  and  4  then the second receiver should use  2  and  4 . However, the receivers do not need to positively detect at this point which channels the particles appeared in. Indeed, doing the detection at this point in such a way that the state is not disturbed may in fact be difficult technologically. Therefore, the determining means may operate to determine if the particles are in channels  1  and  3 , for example, without disturbing them if they are there, by measuring if any particle appears in any of the channels  2  or  4  on either side. If they do not appear in channels  2  or  4 , they are in channels  1  and  3  and the protocol can continue. If they do appear in channels  2  or  4 , the protocol is aborted (because the state has been disturbed by the measurement).  
           [0034]    The second possibility is for a positive detecting step to occur a long way down the line. Thus in practice it could be anticipated that the receivers may well use all four channels on each side blindly (in a four channel system), that is performing operations as if there were a particle on the channel but without knowing (or needing to know) whether there actually is a particle in the channel or not. At the very end of the processing, users can detect where the particles are and use the results only if they came through coincident channels with correlated particles (i.e.  1  and  3  in both cases, or  2  and  4  in both cases).  
           [0035]    It will be appreciated that throughout the specification “particles” are discussed. When a single particle is mentioned it is clear that it is not possible to guarantee that in practice the source produces exactly one particle because a source might not be perfect. Moreover, when linear transformations are referred to, it cannot be guaranteed in the real world that each piece of hardware performs a perfect linear transformation. However, the fact that the mathematical perfections do not find themselves realised in the real world does not detract from the fundamental usefulness of the systems and method discussed herein.  
           [0036]    It will be appreciated that correlation between states can be provided with a number of factors, including correlation in time and/or polarisation. Both of these parameters can be used to generate more correlated states for the same number of originating particles.  
           [0037]    We note that there is a correspondence between protocols for correcting errors during communication and protocols for distribution of entanglement. Therefore our protocols for error filtration during communication can be mapped in a straightforward way into protocols for filtering errors in distribution of entangled states (and vice versa).  
           [0038]    The following description shows how to realise error filtration for quantum communication. The difference between error correction and error filtration is the following. In error correction the aim is actively to correct the errors that occur during transmission so that the decoded signal is as close as possible to the emitted signal. In error filtration that part of the signal which is affected by noise is discarded with high probability. What remains is a signal of reduced intensity but with less noise. This produces a signal of better quality than if no error filtration was carried out.  
           [0039]    The error filtration protocols discussed in the following have a number of key advantages:  
           [0040]    1. they are performed without controlled multi-particle interactions;  
           [0041]    2. they do not require any special physical system for their implementation;  
           [0042]    3. they do not require any special input quantum or classical state;  
           [0043]    4. they can be applied to both bosons (e.g. photons) and fermions (e.g. electrons, or holes in semiconductors), and can be used for communication of single particle quantum states, multi-particle quantum states (e.g. coherent states, squeezed states, number states), entangled quantum states and also classical wave signals  
           [0044]    5. they do not require active detection or active correction of errors.  
           [0045]    For a better understanding of the present invention and to show how the same may be carried into effect, reference will now be made by way of example to the accompanying drawings.  
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0046]    [0046]FIG. 1—General set-up for one-way communication;  
         [0047]    [0047]FIG. 2—General set-up for distribution of entangled states;  
         [0048]    [0048]FIG. 3—Simple protocol for one-way communication;  
         [0049]    [0049]FIG. 4—General protocol for distribution of entangled states;  
         [0050]    [0050]FIG. 5—Example of the implementation of the simple error filtration protocols in optical fibres;  
         [0051]    [0051]FIG. 6—Example of the implementation of the simple error filtration protocols optically in free space;  
         [0052]    [0052]FIG. 7—Example of the implementation of the simple error filtration protocols using time bins in optical fibres;  
         [0053]    [0053]FIG. 8—Example of the implementation of the simple error filtration protocols using time bins in free space;  
         [0054]    [0054]FIG. 9—Example of the implementation of the protocol for distribution of entangled states in multiple optical fibres; and  
         [0055]    [0055]FIG. 10—Example of the implementation of the protocol for distribution of entangled states in time bins in optical fibres.  
         [0056]    [0056]FIG. 11—Example of the implementation of the simple error filtration protocols in the mesoscopic domain;  
         [0057]    [0057]FIG. 12—Example of source of entangled states in time bins;  
         [0058]    [0058]FIG. 13—Example of source of entangled states in optical fibres. 
     
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0059]    Before discussing specific embodiments it is to be noted that the concept underlying the invention is to provide general methods of error filtration for quantum communication of wide applicability. The ideas described for quantum communication lead to protocols for error filtration for classical wave signals. We also describe how to implement the general algorithms in specific physical situations for quantum optics and mesoscopic quantum devices.  
         [0060]    The following description has two parts.  
         [0061]    General algorithms: We propose a family of general algorithms for implementing error filtration for communication of both quantum and classical information. These algorithms are technically feasible and applicable to a wide range of technologies which can be used for classical and quantum communication.  
         [0062]    Specific applications: We describe how to implement the general algorithms in specific physical situations in quantum optics and mesoscopic quantum devices.  
         [0063]    In general terms, the following embodiments are concerned with the correction of errors which occur during the communication of quantum and classical wave signals. The techniques apply in a variety of situations. These include when the aim is for a source to send single particle or multi-particle quantum signals or classical wave signals to a receiver. They also apply when one wishes to send a quantum signal from a source to multiple receivers and thus may be used for the distribution of quantum entanglement. The techniques have applications in the rapidly developing new areas of quantum communication, quantum computation and quantum cryptography, as well as in classical wave communication.  
         [0064]    A range of general algorithms for error correction and examples of implementations of the general algorithms which are appropriate for a variety of physical realisations including (but not restricted to) quantum optics and mesoscopic quantum systems are described.  
         [0065]    We describe specific protocols for error filtration for both quantum and classical wave signals: protocols for the case where the signal is affected by phase noise during transmission; protocols which apply when the signal has internal degrees of freedom; protocols which apply when the noise is non-linear; and protocols for reducing amplitude noise. We show how to implement error filtration in series (i.e. several times along the same transmission line) and that this increases the quality of the transmitted signal. We also show how to implement error filtration when transmitting entanglement to two or more parties. We give specific examples of the implementation of a number of the general protocols in quantum optics in free space and in fibres, using either spatially separated transmission channels, or in different time bins propagating along the same path. We also explain that there are analogous implementations to the optical one in other physical situations including mesoscopic quantum systems.  
         [0066]    The following embodiments of the invention have a number of distinctive elements which are further explained below:  
         [0067]    1. They rely on the idea which we call multiplexing. There are many manifestations of this idea including transmission channel multiplexing (where the number of transmission channels is greater than the number of source channels) and source multiplexing (where we send a signal through more source channels than the number of channels arriving at the receiver); the multiplexing may also be done in parallel and/or series.  
         [0068]    2. The systems we consider means that we can arrange the physical implementations so that the noise in different transmission channels is essentially independent. It is the particular forms of the noise which allows our protocols to work.  
         [0069]    3. We call our protocols error filtration since, unlike usual error correction for quantum signals, we do not try to correct errors which have occurred. Rather we identify cases in which errors have occurred and discard them thus obtaining a filtered signal.  
         [0070]    Thus many of our implementations only use passive linear elements, since as we shall show, multiplexing can be implemented with only passive linear elements. In particular, and unlike most previous protocols, we do not measure the signal to identify the error and then perform active transformations on the system determined by the measurement results in order to correct the error. Some of our implementations use active elements—switches—however these elements realise “passive” linear transformations on the modes, i.e. they are not used to perform non-linear transformations or transformations conditional on the results of measurements on the signal.  
         [0071]    In what follows we shall show how multiplexing can be used to implement error filtration for quantum and classical wave communication. However the basic idea of this invention, namely that multiplexing induces error filtration, can also be used in other aspects of quantum or classical wave information processing. For instance we noted above a simple change in vocabulary maps one-way communication protocols to protocols for protection of memories. Since our protocols only use one-way communication, they can be adapted to the protection of quantum memories or memories that use classical wave signals (for example, in the case of optical implementations of our ideas, the memories could be storage coils). As a further generalisation, we note that multiplexing could be used to filter out errors that occur in the logical elements of a quantum or classical wave computer. Indeed in all the communication protocols we consider, we suppose that the communication channel, in the absence of noise, does not modify the signal (i.e. it performs the identity transformation). However the error filtering properties of multiplexing are unaffected if the communication channel realises a non-trivial linear transformation U on the modes. This transformation U can be viewed as an element of a quantum or classical wave computer. In conclusion the use of multiplexing for error filtration of wide applicability and should be useful in many aspects of quantum and classical wave information processing.  
         [0072]    [0072]FIG. 1 is a schematic diagram of a communications system utilising an embodiment of the present invention. A source generates at least one information carrying mode, in the form of quantum signals. The information carrying mode is supplied along a path  1 . 08  as a set of source states to an encoder  1 . 04 . The encoder acts to encode the signals from the source  1 . 01  in a manner to be described later. The signals are then transmitted across a plurality of transmission channels denoted generally by reference numeral  1 . 03 . Each of these channels is subject to independent noise. The signals from the plurality of transmission channels are received at a decoder  1 . 05  where they are linearly combined according to a procedure to be described later. The result of the linear combination regenerates the information carrying mode into one of a plurality of output channels designated generally as  1 . 09 . These channels are denoted useful channels and the signals on these useful channels are picked up at a receiver  1 . 02 . Another set of channels marked  1 . 07  are denoted as discard channels and the signals received on these channels are not utilised either in the received signal or from modifying the received signal. Reference numeral  1 . 06  denotes other input states which could in principle be supplied to the encoder but in fact according to the following described protocols are never activated. That is, the encoder  1 . 04  acts on the basis of a passive linear encoding not requiring controlled multi-particle interaction.  
         [0073]    [0073]FIG. 2 illustrates a schematic diagram for the distribution of entangled quantum states. Reference numeral  2 . 01  denotes a source of entangled states. The entangled states are to be received by a first receiver  2 . 02 . 1  and a second receiver  2 . 02 . 2  respectively. A set of noisy transmission channels exist for the transmission of the entangled states in the source  2 . 01  to the respective receivers  2 . 02 . 1  and  2 . 02 . 2 . Transmission channels are denoted respectively  2 . 03 . 1  and  2 . 03 . 2 .  
         [0074]    [0074]FIGS. 1 and 2 and the remaining FIGS.  3  to  13  are discussed in more detail in the sections which follow.  
         [0075]    2 Protocols for Error Filtration  
         [0076]    2.1 General Framework and Goals  
         [0077]    We have three main classes of protocols. Protocols for one way communication of quantum signals (sections 2.6,2.7, 2.8,2.9, 2.10, 2.11), protocols for one way communication of classical wave signals (sections 2.12,2.13, 2.14,2.15) and protocols for distribution of entangled quantum states (section 2.16). We briefly review these three classes of protocols:  
         [0078]    2.1.1 Protocols for One Way Communication of Quantum Signals  
         [0079]    The general framework within which we work is illustrated in FIG. 1. There is a source  1 . 01  of quantum signals, and the aim is transmit these signals to the receiver  1 . 02 . The signals must travel from the source to receiver through a noisy channel ( 1 . 03  in FIG. 1). Broadly speaking, in all cases the goals are to reduce the effect of the noise in the channel. We achieve these goals by specific encodings (using the encoder ( 1 . 04  in FIG. 1) of the signals from the source and decodings (using the decoder ( 1 . 05  in FIG. 1) of the signals after noisy transmission. In one family of protocols (section 2.10) the encoding/decoding procedure is repeated a number of times before signal reaches the final receiver.  
         [0080]    2.1.2 Protocols for Communication of Classical Wave Signals  
         [0081]    The general framework here is exactly the same as for the quantum communication protocols outlined above. Now however the signals are classical wave signals rather than quantum states.  
         [0082]    2.1.3 Protocols for Distribution of Entangled Quantum States  
         [0083]    The general framework here is illustrated in FIG. 2. There is a source  2 . 01  of entangled states of two bipartite systems. The first system is to be received by party A ( 2 . 02 . 1  in FIG. 2) and the second by party B ( 2 . 02 . 2  in FIG. 2). The signals must travel from the source to parties A and B through noisy channels ( 2 . 03 . 1  and  2 . 03 . 2  in FIG. 2). Depending on the circumstances, there might be a number of possible goals.  
         [0084]    One might wish to produce states at the receivers which are as close as possible to some standard entangled state. A widely used case is that of a maximally entangled state. We call this entanglement distribution.  
         [0085]    Alternatively the goal may be to produce states at the receiver which are as near as possible (in some suitable sense) to the states produced by the source.  
         [0086]    The main difference between the two goals is that in the first case we are in effect allowed to choose the source and the original state that the source emits to produce the maximal amount of the required standard entangled state at the receivers. In the second case we cannot choose the state emitted by the source as we want but we have to use the state we are given.  
         [0087]    Both the possibilities are illustrated below as examples of the general framework. As in the other cases, the goals are to reduce the effect of the noise in the channel; as before, these goals are achieved by specific encodings of the signals from the source and decodings of the signals after noisy transmission.  
         [0088]    We should point out the although we will mostly discuss the communication of two-party states, the ideas we describe can be extended in a straightforward way to be used to communicate multi-party entangled states.  
         [0089]    2.2 Description of the Noise  
         [0090]    The general framework is as follows. The source emits signals in a total of S tot  channels. These are encoded by the encoders into T tot  channels. The signals then flow through the noisy channels and are decoded by the decoders to R tot  receiver channels. Amongst the novel aspects of our inventions are the realisation that it is sufficient for error filtration to allow the encoding and decoding to change the dimension of the space of states: we say that the source channels are “multiplexed” to a larger number of transmission channels. This is key to the performance of the protocols.  
         [0091]    Perhaps the most important aspect of our inventions is that the implementations we consider means that the dominant type of noise has a very specific form: the noise on each transmission channel is independent of that on any other transmission channel. It is the particular form of the noise which allows are protocols to work.  
         [0092]    The simplest example we consider, and the one which we treat first (in section 2.6), is phase noise in a simple quantum channel. The space of transmission states is a T tot , dimensional Hilbert space and the orthonormal transmission basis states |j&gt; T (j=1 . . . T tot ) interact with the environment as  
           |j&gt;   T |0&gt; E   →|j&gt;   T (α|0&gt; E   +β|j&gt;   E ), |α| 2 +|β| 2 =1   (1)  
         [0093]    where the environment states |j&gt; E  are orthogonal for different j. This represents the  20  physical situation in which the environment starts in the initial state |0&gt; E  and the interaction causes the state of the environment to be disturbed. α and β describe the amount of disturbance; in general these parameters will depend on j. An alternative way of describing this noise is that the states |j&gt; T  acquire random phases:  
         | j&gt;   T   →e   iφ   |j&gt;   T  etc.   (2)  
         [0094]    where φ is a random phase with a distribution depending on the environment.  
         [0095]    We note that in the specific implementations discussed in part 3, the dominant errors are phase noise errors. For this reason we put particular emphasis on phase noise.  
         [0096]    However our protocols are by no means restricted to phase noise; more general forms of noise will be discussed below.  
         [0097]    It is also important to emphasise here that the dominant noise in the quantum systems we consider is quite different from that usually considered. The most commonly considered implementations of quantum information processing use qubits (i.e. two level systems) as the basic building blocks. Multi-party systems in this case have a Hilbert space which is the tensor product of copies of the qubit Hilbert space. The noise in this situation is usually considered to be local on the qubits (see for example C H Bennett et al, Phys Rev Lett 76 (1996) 722, P W Shor,  Method for reducing decoherence in a quantum computer memory,  U.S. Pat. No. 5,768,297, A M Steane, Phys Rev Lett, 77 (1996) 793). The interactions with the environment can cause bit-flip and phase errors on the individual qubits. The theory of quantum error correction codes has been developed to offer a method of protecting these systems against these errors. We note that the number of elementary errors in this case grows linearly with the number of qubits or in other words, it grows as the logarithm of the dimension of the Hilbert space. By contrast, in the case of all of the simpler quantum protocols that we consider (except the multi-excitation protocol of section 2.11), the space of transmission states is the direct sum of systems; it is not, in any physically natural way, the tensor product of systems of smaller dimension. Thus the errors we consider here are quite different from those considered in the multi-qubit framework, and the techniques developed for those systems are not relevant here. In particular the number of elementary errors that occur in our system grows linearly with the dimension of the Hilbert space.  
         [0098]    2.3 Overview of the Protocols  
         [0099]    We present below a number of different protocols for both quantum and classical communication. We start by considering the simplest protocol and generalise the ideas in a number of ways; we also show how to apply to a variety of different physical situations. While we describe the generalisations one by one, it will be clear that often they may be used together to enhance error filtration. For example the general protocol in section 2.8 can be combined with the series protocol 2.10 etc.  
         [0100]    1. Simple quantum protocol for filtration of phase noise (section 2.6). This protocol applies to single particle quantum states in which each channel is described by a one-dimensional Hilbert space. The noise we consider in this case is phase noise. We give a specific encoding/decoding scheme which reduces the effect of errors in the transmission channels.  
         [0101]    2. General quantum protocol for filtration of phase noise (section 2.7). We next show how to generalise the protocol in section 2.6 to a much larger class of encoding/decoding schemes than the one based on the Fourier transform in the previous section.  
         [0102]    3. General quantum protocol for filtration of phase noise with collective encoding (section 2.8). A further generalisation is to allow each transmission channel to carry signal from more than one source channel; this is described here.  
         [0103]    4. Quantum protocol for filtration of more general noise (section 2.9). We now extend the previous protocols to the case where each channel carries internal degrees of freedom. The noise has the effect of performing a random rotation of the internal degrees of freedom. We again present a specific encoding/decoding scheme here.  
         [0104]    5. Quantum series protocol (section 2.10). In the previous protocols there is a single encoding step and a single decoding step. Here we present a protocol which uses repeated encoding/decoding steps and has enhanced error reduction capabilities over protocols with only a single encoding/decoding step. While we only describe multiple use of the encoding/decoding idea for the example of single party quantum states in which each channel is described by a one-dimensional Hilbert space, any of the protocols we describe can be enhanced by repeating the encoding/decoding modules.  
         [0105]    6. Quantum multi-excitation protocol (section 2.11). In this section we show that the idea of multiplexing transmission channels is also applicable to systems in which there are many quanta of excitation in each channel.  
         [0106]    7. Protocols for error filtration for classical wave propagation (section 2.12). Next we turn to applications to classical wave propagation of the ideas we have developed in the previous quantum protocols. Firstly we consider classical waves whose modes are described by a single complex amplitude. The noise we consider first is that each transmission mode amplitude gets modified by a random phase. We consider a specific protocol, the exact analogue of the quantum protocol in section 2.6.  
         [0107]    8. Classical channels with internal degrees of freedom (section 2.13). We then extend the protocol to classical signals with internal degrees of freedom in which case the noise is causes each mode to be modified by the action of a random rotation.  
         [0108]    9. Non-linear classical noise (section 2.14). In the previous classical protocols (sections 2.12 and 2.13) we have assumed that the noise is linear. In other words we assume that the strength of the noise is independent of the intensity of the wave in any channel. We point out in this section that our protocols are still applicable even if this assumption is relaxed: the protocols are effective even if the noise is non-linear in the intensity of the signal.  
         [0109]    10. Classical and quantum amplitude noise (section 2.15). All the previous protocols have been described for cases where the noise which is unitary. For example in the case that the amplitude of the classical signal was a complex number (as in sections 2.12 and 2.14), the noise had the effect of multiplying the amplitude in each channel by a random number of modulus one. In this section we show that it was not essential that the noise preserve the intensity of each mode, even if the noise also reduces the amplitude of the signal, our protocols are effective. This is true both in the classical and quantum case.  
         [0110]    11. Protocols for communication of entangled states (section 2.16). Finally we return to considering quantum signals, but now the aim is to propagate an entangled state from the source to two receivers, A and B. We show how to build protocols to protect this propagation against noise.  
         [0111]    2.4 Framework for One-Way Communication Protocols  
         [0112]    The general framework within which we work is illustrated in FIG. 1. There is a source  1 . 01  of quantum signals, and the aim is transmit these signals to the receiver  1 . 02 . The signals must travel from the source to receiver through a noisy channel ( 1 . 03  in FIG. 1). The signal is encoded using the encoder ( 1 . 04  in FIG. 1) and decoded using the decoder ( 1 . 05  in FIG. 1). The states emitted by the source, the “source states” are labelled  1 . 08 . Unitarity means that the total number of states entering the encoder, must be equal to the total number of states leaving the encoder. Thus since we have in mind that the number of transmission states  1 . 03  will be larger than the number of source states  1 . 08  it must be the case that the encoder has, in principle, a number of other input states  1 . 06 . However these states will not be activated in our protocols; that is we never send signals through the states  1 . 06 . Indeed these channels need not exist physically; for example in an implementation using optical fibres, the number of fibres entering the encoder could be less than that leaving the decoder. Similarly, unitarity means that the total number of states entering the decoder, must, in principle, be equal to the total number of states leaving the decoder. We will arrange our protocols so that only some of the output states from the decoder are “useful”; these are labelled  1 . 09 . The remaining output states, labelled  1 . 07  will be discarded; as with the encoder, these fibres need not exist as physical objects. The protocols are such that there may be a signal in these discarded outputs  1 . 07 . However this arises only when noise has occurred during transmission. We describe our protocols as “error filtering” since they are designed so that part of the noise, which would otherwise go to the receiver, goes into these discarded channels.  
         [0113]    2.5 Basic Principle of the One-Way Communication Protocols  
         [0114]    The basic principle which explains how our one-way communication protocol works is as follows:  
         [0115]    The signal is emitted by the source in a number of useful source channels  1 . 08 . The encoder  1 . 04  encodes these states in a superposition of a larger number of transmission states  1 . 03 . At the decoder  1 . 05  the transmission states are interfered. The decoder is such that when no noise occurs during the transmission, the transmission states interfere constructively and end up in a number of useful receiver states  1 . 09  which are fewer in number than the total number of output states from the decoder, and which are in one-to-one correspondence with the useful source states. On the other hand, when noise occurs, the states in the different transmission channels can no longer interfere, because each of them is correlated with a different state of the environment which preserves, in principle, the information about the channel in which the noise occurred. Then the unitarity of quantum evolutions implies that when the noise occurs the states end up spread into other output channels in addition to the useful ones.  
         [0116]    Consequently, while the entire unperturbed state ends up in the useful receiver channels, only part of the noise ends up in the useful receiver channels, while the rest of the noise ends up in the other receiver channels  1 . 07  and it is discarded.  
         [0117]    2.6 Simple Quantum Protocol for Filtration of Phase-Noise  
         [0118]    In this section we consider a simple example of the general framework given in FIG. 1. The signals we consider are quantum states of a single particle. Each channel contains one state (i.e. there are no internal degrees of freedom). The noise is phase noise (described in section 2.2, see also below). Also the encoding and decoding process is particularly simple in that each source channel is separately encoded and decoded.  
         [0119]    The protocol is illustrated in FIG. 3. There is a source  3 . 01  of quantum signals. These signals are the quantum states of a single particle. The signal can therefore be written as  
            ψ   〉     =       ∑     l   =   1       S   tot              c   l               l   〉     S                               
 
         [0120]    where c l  is the amplitude that the particle is in source channel l and |l&gt; S  denotes the state of the particle if it is in source channel l (denoted  3 . 08 . 1 ,  3 . 08 . 2  etc. in FIG. 3). S tot  is the total number of source channels. The aim is transmit this signal to the receiver  3 . 02 . The signals travel from the source to receiver through a noisy channel ( 3 . 03  in FIG. 3). Each source channel  3 . 08 . 1 ,  3 . 08 . 2  etc. is encoded using a separate encoder ( 3 . 04 . 1 ,  3 . 04 . 2  etc. in FIG. 3) and decoded using a separate decoder ( 3 . 05 . 1 ,  3 . 05 . 2  etc. in FIG. 3).  3 . 06 . 1 ,  3 . 06 . 2  etc. are the unused input states for each encoder. The “useful” states going to the receiver are labelled  3 . 09 . 1 ,  3 . 09 . 2  etc.; the remaining output states, labelled  3 . 07 . 1 ,  3 . 07 . 2  etc. will be discarded.  
         [0121]    The noise we consider in this case is phase noise; that is any transmission state |j&gt; T  interacts with the environment as  
           |j&gt;   T |0&gt; E   →|j&gt;   T (α|0&gt; E   +β|j&gt;   E ), |α| 2 +|β| 2 =1   (3)  
         [0122]    where the environment states |j&gt; E  are orthogonal for different j.  
         [0123]    Since, as mentioned above, in this protocol we encode and decode each source channel separately, we can focus on a particular one, |1&gt; S , say.  
         [0124]    Consider first what happens if we transmit without error filtration. In other words we start with the system in the source state |1&gt; S  and encode it as a transmission state |1&gt; T  (i.e. the encoding is essentially trivial). The system plus environment transforms as  
         |1&gt; S |0&gt; E →|1&gt; T |0&gt; E →|1&gt; T (α|0&gt; E +β|1&gt; E ).   (4)  
         [0125]    We now perform the trivial decoding  
         |1&gt; T =|1&gt; R ,   (5)  
         [0126]    so that the final state at the receiver is  
         |1&gt; R (α|0&gt; E +β|1&gt; E ).   (6)  
         [0127]    Thus the amplitude for an error to have occurred is β.  
         [0128]    So let us now consider how multiplexing can allow us to filter the state to have a smaller error amplitude. We again start with the state of the source |1&gt; S  but now encode into T transmission channels:  
                    1   〉     S     ↦       1     T              ∑     j   =   1     T                 j   〉     T     .                 (   7   )                               
 
         [0129]    This state can be thought of as the effect of a Fourier transform on this input state. Thus the state of the system plus environment becomes  
               1     T              ∑     j   =   1     T                 j   〉     T                 0   〉     E     .                 (   8   )                               
 
         [0130]    The noise now occurs, causing the state to change to  
               1     T              ∑     j   =   1     T                 j   〉     T            (       α             0   〉     E       +     β             j   〉     E         )     .                 (   9   )                               
 
         [0131]    We now decode by performing the inverse Fourier transform:  
                    j   〉     T     ↦       1     T              ∑     k   =   1     T                 2                                  π                     j        (     k   -   1     )       /   T                     k   〉     R     .                   (   10   )                               
 
         [0132]    Thus the state becomes  
                       1   T            ∑     j   =   1     T            ∑     k   =   1     T                 2                                  π                     j        (     k   -   1     )       /   T                   k   〉     R          (       α             0   〉     E       +     β             j   〉     E         )             =                     1   〉     R          (       α             0   〉     E       +       β     T                   1   ~     〉     E         )       +                              β   T            ∑     j   =   1     T            ∑     k   =   2     T                 2                                  π                     j        (     k   -   1     )       /   T                   k   〉     R               j   〉     E             ,                   (   11   )             where                                  1   ~     〉     E     =       1     T              ∑     j   =   1     T               j   〉     E                 (   12   )                               
 
         [0133]    is a normalised state of the environment, and where we used the fact that for every k=2, . . . T  
                 ∑     j   =   1     T               2                                  π                     j        (     k   -   1     )       /   T           =   0.           (   13   )                               
 
         [0134]    We see that this state has a component in the receiver channel |1&gt; R , which we regard as the “useful” signal and components in all the other receiver channels, |k&gt; R , k=2, . . . T which we will discard.  
         [0135]    The state which appears in the |1&gt; R  receiver channel is  
                    1   〉     R            (       α             0   〉     E       +       β     T                   1   ~     〉     E         )     .             (   14   )                               
 
         [0136]    We thus see that the effect of the encoding/decoding is to reduce the noise amplitude in the useful channel by a factor of {square root}{square root over (T)} (i.e. from β to β/{square root}{square root over (T)}). Thus we have achieved the aim of error filtration.  
         [0137]    We note that the probability that the state appears in the useful channel is the magnitude squared of the state in (14), i.e.  
                    α        2     +              β        2     T     .             (   15   )                               
 
         [0138]    On the other hand, there is a probability of  
       1   -     (            α        2     +            β        2     T       )                           
 
         [0139]    that the state appears at one of the “non-useful” receivers channels, |k&gt; R , k=2, . . . T. These channels are non-useful because the state ending here is always correlated with noise in the environment. Indeed, we see in (11) that the component containing the receiver channels |k&gt; R , k=2, . . . T is  
                 β   T            ∑     j   =   1     T                       ∑     k   =   2     T                            2                       π                     j        (     k   -   1     )       /   T                   k   〉     R               j   〉     E             ,           (   16   )                               
 
         [0140]    and has no overlap with the unperturbed state of the environment |0&gt; E .  
         [0141]    We also point out that the protocol has the property that if there is no noise, the encoding/decoding steps are arranged so that there is constructive interference, and all the source signal arrives in the useful receiver channel.  
         [0142]    We note that the state |1&gt; S  alone does not carry a true quantum signal; quantum signals are carried by superpositions of states. Thus one needs a state in a Hilbert space of at least dimension two to carry a quantum signal.  
         [0143]    As an example the effect of the filtration can be seen by considering the interference between two (orthogonal) input source states |1&gt; S  and |T+1&gt; S , say (i.e. S tot =2). With this two dimensional Hilbert space of source states we are now able to propagate a true quantum signal. We will have T tot =2T transmission states. Let us consider the input superposition  
                 1     2            (            1   〉     S     +                             Φ                   T   +   1     〉     S         )       ,           (   17   )                               
 
         [0144]    and see how the visibility of the interference pattern is affected by the noise. The interference may be seen by projecting the state at the receiver along the direction  
               1     2              (            1   〉     R     +            T   +   1     〉     R       )     .             (   18   )                               
 
         [0145]    If there is no noise and the encoding and decoding are trivial, i.e.  
         |1&gt; S →|1&gt; T →|1&gt; R  and | T+ 1&gt; S   →|T+ 1× T   →|T+ 1&gt; R ,   (19)  
         [0146]    then the amplitude of the projection along (18) is  
                 1   2          (     1   +                           Φ         )       ,           (   20   )                               
 
         [0147]    thus the intensity is  
                        1   2          (     1   +                           Φ         )            2     =       1   2            (     1   +     cos                 Φ       )     .               (   21   )                               
 
         [0148]    Thus the visibility is 1.  
         [0149]    Consider what happens if there is noise in the transmission channels and no error filtration (i.e. the encoding/decoding is trivial):  
         |1&gt; T |0&gt; E →|1&gt; T (α|0&gt; E β|1&gt; E );  
         | T+ 1&gt; T |0&gt; E   →|T+ 1&gt; T (α|0&gt; E   +β|T+ 1&gt; E ).   (22)  
         [0150]    The intensity of the projection along (18) at the receiver is  
                 1   2          (     1   +            α   2             cos                 Φ       )       ;           (   23   )                               
 
         [0151]    i.e. the visibility has been reduced to |α 2 |.  
         [0152]    If on the other hand each input channel is separately multiplexed to T transmission channels (i.e. there is a total of T tot =2T transmission channels) one finds that the intensity of the projection along (18) at the receiver is  
               1   2          (            α   2          +            β        2     /   T       )          (     1   +       (       T             α        2           T             α        2       +          β        2         )        cos                 Φ       )             (   24   )                               
 
         [0153]    Thus the visibility of interference increases monotonically with the number of transmission channels and tends to  1  as the amount of multiplexing T tends to infinity.  
         [0154]    It is also important to emphasise here that while we have treated the case that the noise in each transmission channel had the same distribution, this was not essential. Rather than the noise model  
         | j&gt;   T |0&gt; E   →|j&gt;   T (α|0&gt; E   +β|j&gt;   E )   (25)  
         [0155]    it could have been the case that the noise parameters α and α depended on the channel j. i.e.  
         | j&gt;   T |0&gt; E   →|j&gt;   T (α j |0&gt; E +β j   |j&gt;   E )   (26)  
         [0156]    While the detailed calculations will change in this case, as long as the noise in different channels is independent, the protocol will still have the effect of reducing the noise appearing in the receiver channel. While all the protocols we discuss below also consider identically distributed noise, the same remark applies: exactly how much the noise is reduced depends on the details of the distribution of noise, however the idea of muliplexing along the lines above will still be effective in error filtration whether the distribution is the same for all channels or not.  
         [0157]    2.7 General Quantum Protocol for Filtration of Phase-Noise  
         [0158]    We now present a more general class of protocols for correcting phase noise; these generalise the protocol in section 2.6. The generalization consists in allowing more general encoding and decoding operations than the Fourier transform used in section 2.6. This more general is also illustrated by FIG. 3.  
         [0159]    Since here, as in section 2.6, we encode and decode each source channel separately, we can focus on a particular one, |1&gt; S , say.  
         [0160]    We start with the state of the source |1&gt; S  but now encode the source state into T transmission channels:  
         |1&gt; S   →U   e |1&gt; S ,   (27)  
         [0161]    where the encoding transformation U e  is a unitary map from the source Hilbert space (which includes both the source state |1&gt; S  denoted  3 . 08 . 1  in FIG. 3 and the other input states  3 . 06 . 1 ) to the transmission Hilbert space (denoted  3 . 03  in FIG. 3). i.e. U e   t U e =(id)s and U e U e   t =(id) T , where id is the identity operator in the given Hilbert space. We can write the above state in terms of an orthonormal basis of transmission states |j&gt; T ,  
                 U   e               1   〉     S       =       ∑     j   =   1     T                         〈     j             U   e             1     〉     S           T                                j   〉     T     .                 (   28   )                               
 
         [0162]    This unitary transformation is a generalisation of the Fourier transform (7).  
         [0163]    Following encoding, the state of the system plus environment becomes  
               ∑     j   =   1     T                         〈     j             U   e             1     〉     S           T                              j   〉     T                 0   〉     E     .               (   29   )                               
 
         [0164]    The noise (3) now occurs, causing the state to change to  
               ∑     j   =   1     T                         〈     j             U   e             1     〉     S           T                              j   〉     T          (       α             0   〉     E       +     β                        j   〉     E         )               (   30   )                               
 
         [0165]    We now decode by performing a second decoding unitary transformation (the generalisation of the inverse Fourier transform (10)):  
         | j&gt;   T   →U   d   |j&gt;   T .   (31)  
         [0166]    Unitarity means that U d   t U d =(id) T  and U d U d   t =(id) R . Thus the state becomes  
                     ∑     j   =   1     T                  T          〈   j               U   e               1   〉     S                 U   d               j   〉     T            (       α             0   〉     E       +     β             j   〉     E         )     .                   (   32   )                               
 
         [0167]    Up to this point the encoding and decoding procedure is very general. We will now restrict ourselves by demanding that if there is no noise, the state should be transmitted exactly into the receiver channel |1&gt; R . Thus we specify  
           U   d   U   e |1&gt; S =|1&gt; R .   (33)  
         [0168]    Thus the state of the system and environment becomes  
                        1   〉     R          (       α             0   〉     E       +     β                     ∑     j   =   1     T                  T          〈   j               U   e               1   〉     S                R          〈   1               U   d               j   〉     T               j   〉     E             )       +     β                     ∑     j   =   1     T            ∑     k   =   2     R            c   kj               k   〉     R               j   〉     E               ,           (   34   )                               
 
         [0169]    where  
           c   kj = T   &lt;j|U   e |1&gt; S    R   &lt;k|U   d   |j&gt;   T    (35)  
         [0170]    Again, we see that this state has a component in the receiver channel |1&gt; R , which we regard as the “useful” signal and components in all the other receiver channels which we will discard.  
         [0171]    The state in the useful receiver channel is  
                    1   〉     R            (             α             0   〉     E       +     β                     ∑     j   =   1     T                  T          〈   j               U   e               1   〉     S                           R          〈   1               U   d               j   〉     T               j   〉     E             )     .             (   36   )                               
 
         [0172]    The probability that the particle ends in the useful channel is the magnitude squared of the state (36), i.e.  
                    α        2     +            β        2                       ∑     j   =   1     T                         T          〈   j               U   e               1   〉     S                           R          〈   1               U   d               j   〉     T            2                 (   37   )                               
 
         [0173]    On the other hand, there is a probability of  
             1   -     (            α        2     +            β        2                       ∑     j   =   1     T                         T          〈   j               U   e               1   〉     S                           R          〈   1               U   d               j   〉     T            2           )             (   38   )                               
 
         [0174]    that the particle appears at one of the “non-useful” receivers channels, |k&gt; R , k=2 . . . T. These channels are non-useful because the particle ending here is always correlated with noise in the environment. Indeed, we see in (34) that the component containing the receiver channels |k&gt; R , k=2, . . . , T is  
               β                     ∑     j   =   1     T            ∑     k   =   2     T            c   kj               k   〉     R               j   〉     E             ,           (   39   )                               
 
         [0175]    which has no overlap with the unperturbed state of the environment |0&gt; E .  
         [0176]    The probability of noise in the useful receiver channel is  
                    β        2                       ∑     j   =   1     T                           T          〈   j               U   e               1   〉     S                           R          〈   1               U   d               j   〉     T            2     .               (   40   )                               
 
         [0177]    Now Schwartz&#39;s inequality shows that this magnitude is greater than  
                          β        2     T                   ∑     j   =   1     T                  T          〈   j               U   e               1   〉     S                           R          〈   1               U   d               j   〉     T              2       =            β        2     T       ,           (   41   )                               
 
         [0178]    with equality when  
                                    T          〈   j               U   e               1   〉     S                           R          〈   1               U   d               j   〉     T            =     1   T       ,           independent                 of                   j   .                   (   42   )                               
 
         [0179]    Thus for any encoding and decoding scheme satisfying the conditions (33) and (42), we find that the noise amplitude is reduced by a factor of  
         1     T       .                         
 
         [0180]    One example of encoding/decoding schemes satisfying these conditions is the Fourier transform in the previous section. A second example is the Hadamard transform; in the case of four transmission channels encoding each source channel, the encoding is  
                                                    1     〉     S     ↦         1   2            (        1     〉     T       +          2     〉     T     +        3     〉     T     +        4     〉     T     )                                                2     〉     S     ↦         1   2            (        1     〉     T       +          2     〉     T     -        3     〉     T     -        4     〉     T     )                                                3     〉     S     ↦         1   2            (        1     〉     T       -          2     〉     T     +        3     〉     T     -        4     〉     T     )                                                  4     〉     S     ↦         1   2            (        1     〉     T       -          2     〉     T     -        3     〉     T     +        4     〉     T     )     ;                 (   43   )                               
 
         [0181]    the decoding step is  
                                                    1     〉     T     ↦         1   2            (        1     〉     R       +          2     〉     R     +        3     〉     R     +        4     〉     R     )                                                2     〉     T     ↦         1   2            (        1     〉     R       +          2     〉     R     -        3     〉     R     -        4     〉     R     )                                                3     〉     T     ↦         1   2            (        1     〉     R       -          2     〉     R     +        3     〉     R     -        4     〉     R     )                                                  4     〉     T     ↦         1   2            (        1     〉     R       -          2     〉     R     -        3     〉     R     +        4     〉     R     )     .                 (   44   )                               
 
         [0182]    2.8 General Quantum Protocol for Filtration of Phase Noise with Collective Encoding  
         [0183]    In earlier sections, a given source channel is encoded into a sub-set of the transmission channels, but the signal carried in a given transmission channel came from a single source channel. It is possible to generalise these ideas by allowing each transmission channel to carry signals from more than source channel. This will be of use, for example, when the number of source channels does not divide the number of transmission channels (eg 2 source channels and 3 transmission channels).  
         [0184]    Thus the general situation is that we have S tot  source channels which we encode collectively into T tot  transmission channels and then decode the transmission channels collectively into R tot  receiver channels; we are particularly interested in the case that S tot =R tot . It is clear that the previous protocols, in which a given source channel is encoded into T transmission channels, and each source channel is encoded into a different set of transmission channels, is included in this general framework. But other possibilities are possible.  
         [0185]    Here we will simply illustrate the idea with an example. We consider again the case of phase noise: errors in the transmission channels of the form  
           |k&gt;   T   →|k&gt;   T (α|0&gt; E   +β|k&gt;   E )  k= 1  . . . T   tot .   (45).  
         [0186]    If each source channel |j&gt; S  j=1 . . . S tot  is simply sent along a single transmission channel (trivial encoding) the error amplitude is β. However an example of the general framework in the previous paragraph is the following encoding/decoding scheme, based on the Fourier transform. The encoding step is  
                              j     〉     S     ↦       1     T              ∑     k   =   1       T   tot                              -   2                   π                                      k        (     j   -   1     )       /   T                  k     〉     T     .           (   46   )                               
 
         [0187]    The decoding step is  
                              k     〉     T     ↦       1     T              ∑     m   =   1       S   tot                              -   2                   π                                      k        (     m   -   1     )       /   T                  m     〉     R     .           (   47   )                               
 
         [0188]    For example this protocol may be used in the case that S tot =2=R tot  and T tot =3. Let us write the state emitted by the source as  
         α 1 |1&gt; S +α 2 |2&gt; S .   (48)  
         [0189]    It may be calculated that the fidelity of the state arriving at the receiver in the channels |1&gt; R  and |2&gt; R  to the incoming state is  
                        α        2     +              β        2     3          (     1   +     2               α   1          2                 α   2          2         )                  α        2     +       2             β        2       3         .           (   49   )                               
 
         [0190]    The average value of this fidelity over the Bloch sphere of incoming states is  
                        α        2     +       4             β        2       9                α        2     +       2             β        2       3         .           (   50   )                               
 
         [0191]    For any α and β, this is greater than the average fidelity achieved by simply sending each source state through one transmission channel.  
         [0192]    2.9 Quantum Protocol for Filtration of More General Noise  
         [0193]    The fact that the noise corrected by the previous protocols was phase-noise, and hence corresponds to random elements of the Abelian group U(1) was not critical. The protocols can be simply extended to the case where each channel can carry a system which has “internal” degrees of freedom (i.e. each channel has a state space which is a Hilbert space of arbitrary dimension I; we shall consider this dimension to be finite here, but this is not essential to the success of the protocol).  
         [0194]    Thus we consider an orthonormal set of source states  
         | iμs&gt;   S   ; i= 1  . . . S   tot , μ=1  . . . I.    (51)  
         [0195]    An example is the case where each channel can carry a spin degree of freedom, so that I=2. We consider a set of transmission states  
         | jμ&gt;   T   ; j= 1  . . . T   tot , μ=1  . . . I.    (52)  
         [0196]    i.e. there are T tot  transmission channels each of which carries a state space of dimension I. The transmission states are affected by the following noise:  
                                                          j                 μ       〉     T        0     〉     E     ↦   α          j                 μ       〉     T        0     〉     E     +       ∑     ν   =   1     I                       ∑     λ   =   1     L                         β   λ          (     E   λ     )         μ                 ν                  j                 ν       〉     T          j                 λ       〉     E     .           (   53   )                               
 
         [0197]    This describes L types of error; each error corresponds to a rotation of the system state. In the case of internal spin degrees of freedom, I=2, an example of a set of possible errors is the set of three Pauli matrices:  
         ( E   1 ) μv =(σ x ) μv ; ( E   2 ) μv =(σ y ) μv ; ( E   3 ) μv =(σ z ) μv .   (54)  
         [0198]    Thus |jλ&gt; E  is the state of the environment if error λ occured on channel j.  
         [0199]    The total probability of error in the channel (53) is  
                                          ∑     ν   =   1     I                       ∑     λ   =   1     L                         β   λ          (     E   λ     )         μ                 ν                j                 ν       〉     T          j                 λ       〉     E          2     =              ∑     λ   =   1     L                              β   λ          2                   ∑     ν   =   1     I            (     E   λ     )       μ                 ν              2                     =            1   -          α        2                     (   55   )                               
 
         [0200]    Thus if the source state |1μ&gt; S  is simply sent through a single transmission channel with trivial encoding and decoding,  
         |1μ&gt; S →|1μ&gt; T →|1μ&gt; R ,   (56)  
         [0201]    the probability of error is  
         1−|α| 2 .   (57)  
         [0202]    Now consider a simple error-filtration protocol in which the source channel is multiplexed to T transmission channels. The encoding step is  
                                            1                 μ       〉     S        0     〉     E     ↦       1     T            ∑     j   =   1     T                         j                 μ       〉     T        0     〉     E     .           (   58   )                               
 
         [0203]    Note that the encoding is independent of μ.  
         [0204]    Now the noise occurs during the transmission, and the state becomes  
                                                         1     T            ∑     j   =   1     T                       j                 μ       〉     T        0     〉     E     ↦       1     T              ∑     j   =   1     T                   α              j                 μ       〉     T        0     〉     E     +       1     T              ∑     j   =   1     T            ∑     ν   =   1     I                       ∑     λ   =   1     L                         β   λ          (     E   λ     )         μ                 ν                      j                 ν       〉     T          j                 λ       〉     E     .           (   59   )                               
 
         [0205]    The decoding step for this protocol is also the Fourier transform on the j indices:  
                                j                 ν       〉     T     ↦       1     T              ∑     k   =   1     T               2                       π                     j        (     k   -   1     )       /   T                    k                 ν       〉     R     .           (   60   )                               
 
         [0206]    As before we select the term |1μ&gt; R  at the receiver; thus the state in this receiver channel is  
                                                  α        1                 μ       〉     R        0     〉     E     +       1     T              ∑     j   =   1     T            ∑     ν   =   1     I                       ∑     λ   =   1     L                         β   λ          (     E   λ     )         μ                 ν                                 1                 ν       〉     T          j                 λ       〉     E     .           (   61   )                               
 
         [0207]    Now the probability that the state was affected by noise is the square of the magnitude of the second term:  
                           1     T   2                       ∑     j   =   1     T            ∑     ν   =   1     I                       ∑     λ   =   1     L                         β   λ          (     E   λ     )         μ                 ν                             1                 ν       〉     R            j                 λ       〉     E          2     =       1   T            ∑     λ   =   1     L                              β   λ          2                   ∑     ν   =   1     I            (     E   λ     )       μ                 ν              2                   (   62   )                               
 
         [0208]    where we have used the fact that  
           E   &lt;j   1 λ 1   |j   2 λ 2 &gt; E =δ j1j2 δ λ1λ2  and  R &lt;1 v   1 |1 v   2 &gt; R =δ v1v2    (63)  
         [0209]    Thus comparing ( 62) with (55) we see that the error filtration protocol has reduced the probability of error by a factor of 1/T, i.e. each error amplitude has been reduced by a factor of 1/{square root}{square root over (T)}.  
         [0210]    This protocol has essentially used the Fourier transform to encode and decode. It is not difficult to extend the protocol to more general encoding/decodings as was done for phase noise in the sections 2.6, 2.7, 2.8. Furthermore the encoding need not be independent of the internal degrees of freedom μ (as was the case in eq. (58)).  
         [0211]    2.10 Quantum Series Protocol  
         [0212]    The previous protocols can loosely be described as using transmission channels in parallel to achieve noise filtration. We may also use the idea of multiple channels in series to filter noise. We illustrate this idea in the case of phase noise; the extension to the more general noise in the previous section is straightforward.  
         [0213]    We compare two situations. Given a source channel we wish to improve, we can use the encoding above where we multiplex a single source channel into T transmission channels. This has the effect of causing the noise amplitude to be reduced from β to β/{square root}{square root over (T)}, as we showed earlier. If we imagine that the transmission channels have a certain length, l we could perform the same encoding as in the above protocol, but then use the original decoding procedure at the half-way point (or any other point along the transmission channels), then re-perform the encoding, allow the signal to travel for the remaining part of the transmission channel, and finally decode again. As we now show, this protocol gives better error filtration than the protocol without the interior decoding/encoding (assuming that the decoding/encoding module itself does not introduce significant errors). Clearly one could perform the decoding/encoding module at as many interior points as one wishes; we calculate the effect of this below.  
         [0214]    Recall first that if we do not carry out multiplexing, the state of a particle passing through channel  1  is  
         |1&gt; R (α|0&gt; E +β|1&gt; E ),   (64)  
         [0215]    whereas if we multiplex into T transmission channels the state of the system plus environment after transmission is  
                                           1     〉     R            (                α      0     〉     E       +     β     T            1     〉     E     .           (   65   )                               
 
         [0216]    Now we imagine decomposing the transmission channel into two halves. We describe the environment Hilbert space as being the tensor product of two Hilbert spaces, one for the first half (E 1 ), and one for the second half (E 2 ) of the transmission. After the first half (in the absence of multiplexing) the state is  
         |1&gt; R (α′|0&gt; E1 +β′|1&gt; E1 ),   (66)  
         [0217]    and after the second half it is  
         |1&gt; R (α′|0&gt; E     1   +β′|1&gt; E     1   )(α′|0&gt; E     2   +β′|1&gt; E     2   ).   (67)  
         [0218]    Comparing with eq. (64), we see that α′ 2 =α.  
         [0219]    If we carry out multiplexing in series on the two halves, we find that the state after transmission is  
                                                         1     〉     R            (                  α   ′        0     〉       E   1         +       β   ′       T            1     〉       E   1       )                       (                  α   ′        0     〉       E   2         +       β   ′       T            1     〉       E   2       )     .           (   68   )                               
 
         [0220]    In order to find out the overall probability for an error to have occurred, we write (68) as  
         |0&gt; R (α″|0&gt; E +β″|1″&gt; E ),   (69)  
         [0221]    where |1″&gt; E  is a normalised vector. The probability that the useful receiver state is affected by noise is thus  
                      β   ″          2     =           (     1   -        α          )          (     1   +     2      T           α          -        α          )         T   2       .             (   70   )                               
 
         [0222]    It is not difficult to check that this probability is less than the probability of error without the insertion of the decoding/encoding module (this is equal to |β| 2 /T) for any α.  
         [0223]    More generally one can consider what happens if one has a total of q internal decoding/encoding modules. One gets maximally reduction of error probability when these modules are equally spaced along the transmission channel. In this case the total error probability is found to be  
                 [            α          2     (     q   +   1     )         +       1   -          α          2     (     q   +   1     )           T       ]       (     q   +   1     )       -            α        2     .             (   71   )                               
 
         [0224]    We note that this probability tends to  
                    α            2        (     T   -   1     )       T       -            α        2     .             (   72   )                               
 
         [0225]      (72)  
         [0226]    as the number, q, of internal decoding/encoding modules tends to infinity.  
         [0227]    2.11 Quantum Multi-Excitation Protocol  
         [0228]    In the previous protocols the channels contained only a single excitation each. In the case of bosons, we can also consider the situation where each channel contains many quanta. We will illustrate this first by considering the case that the channel states are coherent states; at the end of this section we show how the protocol may be used for general multi-excitation states.  
         [0229]    Let us consider as before two input channels. Each channel is now described by an infinite dimensional Hilbert space and we may describe the states in terms of the creation and annihilation operators:  
         [ a   S   1 , ( a   S   1 ) t ]=1; and [ {overscore (a)}   S   1 , ( {overscore (a)}   S   1 ) t ]=1,   (73)  
         [0230]    where a S   1  refers to the first channel and {overscore (a)} S   1  to the second. We will work in the Schrödinger picture of dynamics. Let the initial state of the system be the following coherent state:  
                       N        (   λ   )            exp        (       λ     2            (         (     a   S   1     )     †     +                               Φ            (       a   ~     S   1     )       †       )       )            0     〉     sys     ,           (   74   )                               
 
         [0231]    where |0&gt; sys  is the vacuum state for the system, and N(λ) is a normalisation factor. The phase Φ allows us to transmit a signal; it will also be used later to allow us to measure the effect of the noise.  
         [0232]    Let us first consider what happens in the absence of filtration, that is, when there is trivial encoding, namely when each source channel evolves into a single transmission channel. The state of the system evolves to  
                       N        (   λ   )            exp        (       λ     2            (         (     a   T   1     )     †     +                               Φ            (       a   ~     T   1     )       †       )       )            0     〉     sys     .           (   75   )                               
 
         [0233]    The initial state of the environment is a product of states, one for each channel. We denote it |ξ&gt; E . Thus the state of the system plus environment is  
                             N        (   λ   )            exp        (       λ     2            (         (     a   T   1     )     †     +                               Φ            (       a   ~     T   1     )       †       )       )            0     〉     sys        ξ     〉     E     .           (   76   )                               
 
         [0234]    The effect of the noise is that there is an interaction between the system and environment. This may be modelled by the Hamiltonian of the form  
         ( a   T   1 ) t   a   T   1   B   1 +( ã   T   1 ) t   ã   T   1   {tilde over (B)}   1 ,   (77)  
         [0235]    where B 1  and {tilde over (B)} 1  are Hermitian operators acting on the environment Hilbert spaces which we do not need to specify further.  
         [0236]    Thus after transmission through the noisy channels, the state becomes  
                             N        (   λ   )            exp        (       λ     2            (           (     a   T   1     )     †                                  B   1           +                                 Φ            (       a   ~     T   1     )       †                                    B   ~     1             )       )            0     〉     sys        ξ     〉     E     .           (   78   )                               
 
         [0237]    We now decode the signal trivially so that the state at the receiver is  
                             N        (   λ   )            exp        (       λ     2            (           (     a   R   1     )     †                                  B   1           +                                 Φ            (       a   ~     R   1     )       †                                    B   ~     1             )       )            0     〉     sys        ξ     〉     E     .           (   79   )                               
 
         [0238]    Let us now allow these two receiver channels to interfere. This has the effect of transforming the operators a R   1  and {overscore (a)} R   1  into  
                 (     a   R   1     )     ↦       1     2            (       c   R   1     +     d   R   1       )         ;       and                   (       a   ~     R   1     )       ↦       λ     2              (       c   R   1     -     d   R   1       )     .                 (   80   )                               
 
         [0239]    We now calculate the current in the channel c R   1 . This is the expected value of the operator  
         (c R   1 ) t c R   1    (81)  
         [0240]    in the final state  
                       N        (   λ   )              exp   (         λ     2            (           (     c   R   1     )     †          (                               B   1         +                             Φ                                      B   ~     1             )       +         (     d   R   1     )     †          (                               B   1         -                             Φ                                      B   ~     1             )         )          0     〉     sys          ξ     〉     E     .           (   82   )                               
 
         [0241]    This expectation value is  
                      λ        2     4              〈     ξ            (              -                        B   1         +              -                      Φ                   -                          B   ~     1             )          (                               B   1         +                             Φ                                      B   ~     1             )          ξ       〉     E           E         .             (   83   )                               
 
         [0242]    Recall that the state of the vacuum |ξ&gt; E  is a product of states for the individual channels, thus we may write it as  
         |ξ&gt; E =|ξ 1 &gt; E |{tilde over (ξ)} 1 &gt; E .   (84)  
         [0243]    Thus for example  
           E   &lt;ξ|e   −iB     1     e   i{tilde over (B)}     1   |ξ&gt; E = E &lt;ξ 1   |e   −iB     1   |ξ 1 &gt; E E &lt;{tilde over (ξ)} 1   |e   i{tilde over (B)}     1   |{tilde over (ξ)} 1 &gt; E .   (85)  
         [0244]    We assume, as in our discussions of the previous protocols, that the noise on different channels is independent, thus we write  
           E &lt;ξ 1   |e   −iB     1   |ξ 1 &gt; E =α*;  E &lt;{tilde over (ξ)} 1   |e   i{tilde over (B)}     1   |{tilde over (ξ)} 1 &gt; E =α.   (86)  
         [0245]    Therefore the expected value of the current in the channel c R   1  is  
                      λ        2     2            (     1   +            α        2        cos                 Φ       )     .             (   87   )                               
 
         [0246]    We now consider what happens when we encode each of the source channels by multiplexing to T transmission channels. We again start with the coherent state (74). We illustrate the noise filtration with the simplest encoding, the analogue of (7). This encoding has the effect of transforming the creation operators in the coherent state into  
                   (     a   S   1     )     †     ↦       1     T              ∑     i   =   1     T                       (     a   T   i     )     †           ;         (       a   ~     S   1     )     †     ↦       1     T              ∑     i   =   1     T                         (       a   ~     T   i     )     †     .                   (   88   )                               
 
         [0247]    The noise now occurs, causing each creation operator in the coherent state to transform into  
         ( a   T   i ) t   →e   iB     i   ( a   T   i ) t ; ( ã   T   i ) t   →e   i{tilde over (B)}     i   ( ã   T   i ) t .   (89)  
         [0248]    We now decode with the inverse Fourier transform, and consider the signal in the two receiver channels defined by the creation operators (a R   1 ) t  and (ã R   1 ) t . We again allow these to interfere and finally calculate the expected value of the current  
         (c R   1 ) t c r   1    (90)  
         [0249]    in the final state. This is  
                        λ        2       4        T   2                〈     ξ            (       ∑     i   =   1     T          (              -                        B   i         +              -                      Φ                   -                          B   ~     i             )       )          (       ∑     j   =   1     T          (                               B   j         +                             Φ                                      B   ~     j             )       )          ξ       〉     E           E           =              λ        2     2          (       1   +       (     T   -   1     )               α        2         T     )            (     1   +         T             α        2         1   +       (     T   -   1     )               α        2              cos                 Φ       )     .               (   91   )                               
 
         [0250]    Exactly as in the previous protocols the multiplexing has the effect of reducing the noise.  
         [0251]    So far in this section we have considered a particularly simple initial state, a coherent state. In this case it is rather straightforward to calculate the effect of our filtration protocol. However the protocol may be used for any multi-excitation state.  
         [0252]    Let us consider that the state of the source is defined by some function of creation operators (a S   1 ) t  acting on the vacuum. The effect of the encoding and decoding that we have performed above is to change this state to one in which the operator (a S   1 ) t  is transformed to an expression of the form  
               1   T            ∑     j   =   1     T                                        B   j              (     a   R   1     )       †     .               (   92   )                               
 
         [0253]    Thus any power of the operator ((a S   1 ) t ) N  becomes replaced by  
               1     T   N              (       ∑     j   =   1     T                                           B                 j         )     N              (       (     α   R   1     )     †     )     N     .             (   93   )                               
 
         [0254]    We now imagine computing the expectation value of some operator in the state. For T much larger than N we can neglect all terms in the expectation value in which any given operator e iB     k   , say, appears to any power greater than 1. Hence when we compute the expection value, we can perform the inner-product with the state of the environment, and hence replace (93) by  
                 1     T   N              (     T                 α     )     N            (       (     α   R   1     )     †     )     N       ,           (   94   )                               
 
         [0255]    where α is the expected value of e iB     k    for channel k. Thus in the limit of large T we see that the effect of the protocol is that the source operator (a S   1 ) t  gets transformed to  
         α(a R   1 ) t .   (95)  
         [0256]    The key point that this protocol achieves (for large T) is that interference between operators is not affected i.e.  
                 1     2            (         (     α   S   1     )     †                 Φ          (       a   ~     S   1     )       †       )       ↦     α        1     2              (         (     α   R   1     )     †     +            Φ          (       α   ~     R   1     )       †       )     .               (   96   )                               
 
         [0257]    Destruction of interference is avoided and replaced by overall absorption of quanta. This is the exact analogue of what happens for the single-quanta protocols presented earlier where visibility is improved at the cost of overall reduction in intensity.  
         [0258]    We note that while we have focused on the case of large T in the previous paragraph, similar analysis shows that, quite generally, even for finite T, multiplexing has the effect of reducing noise and replacing it by an overall reduction in intensity.  
         [0259]    2.12 Protocols for Error Filtration for Classical Wave Propagation  
         [0260]    The ideas in the previous sections can easily be adapted to filter errors in the propagation of classical waves.  
         [0261]    We will consider first how to filter phase noise using a particular protocol which is the precise analogue of the quantum protocol in section 2.6. Let us label the orthonormal modes of the source channels as ψ S   i  and φ S   j  where i, j=1 . . . S; thus a state of the system may be written as Σc i ψ S   i +Σd i φ S   i , where c i  and d i  are complex amplitudes. Now let us focus on two particular source modes, ψ S   1  and φ S   1 . We can use the visibility of interference between these modes as a measure of how well the errors are filtered. Specifically we form the state  
                 A     2            (       ψ   S   1     +                             Φ            φ   S   1         )       ,           (   97   )                               
 
         [0262]    and we calculate how well we can observe ψ after transmission. In all the classical protocols we discuss we will use A to denote a real number. Let us consider the case that there is phase noise in the transmission channel. We label the modes of the transmission channels as ψ T   i  and φ T   j  where i, j=1 . . . T. These modes interact with the environment and acquire random phases:  
         ψ T   i   →e   iθ     i   ψ T   i ; φ T   j   →e   iξ     j   φ T   j .   (98)  
         [0263]    We assume that the θ i  and ξ j  are independent and have the same distributions for all i and j; no other properties of these random phases will be needed.  
         [0264]    First consider what happens in the case of trivial encoding:  
                 A     2            (       ψ   S   1     +          Φ          φ   S   1         )       ↦       A     2            (       ψ   T   1     +          Φ          φ   T   1         )               (   99   )                               
 
         [0265]    The noise in the transmission channel causes the state to change to  
               A     2            (              θ   1            ψ   T   1       +            ξ   1               Φ          φ   T   1         )             (   100   )                               
 
         [0266]    We now perform trivial decoding into receiver modes:  
         ψ T   1 →ψ R   1 ; φ T   1 →φ R   1 .   (101)  
         [0267]    Thus the state becomes  
               A     2            (              θ   1            ψ   R   1       +            ξ   1               Φ          φ   R   1         )             (   102   )                               
 
         [0268]    In order to see the phase Φ we resolve the state into two components  
                 ω   R   1          :     =     1     2            (       ψ   R   1     +     φ   R   1       )       ;                               and                   z   R   1          :     =     1     2              (       ψ   R   1     -     φ   R   1       )     .               (   103   )                               
 
         [0269]    Thus the state becomes  
               A   2            (         (            θ   1       +            ξ   1               Φ         )          ω   R   1       +       (            θ   1       -            ξ   1               Φ         )          z   R   1         )     .             (   104   )                               
 
         [0270]    The phase Φ may be observed by considering the intensity of the w R   1  component:  
                 A   2     4                   (            θ   1       +            ξ   1               Φ         )          2     .             (   105   )                               
 
         [0271]    The expected value of this intensity is  
                   A   2     4                                (            θ   1       +            ξ   1               Φ         )            2     _       =         A   2     4            (     2   +                θ   1                 -     ξ   1           _               -   Φ         +                -     θ   1                   ξ   1         _               +   Φ           )     .               (   106   )                               
 
         [0272]    However  
         {overscore (e iθ     1   )}={overscore ( iξ     1   )}=α,   (107)  
         [0273]    for some complex number α which has modulus less than or equal to 1. Thus the expected value of this intensity is  
                   A   2     2          (     1   +            α        2        cos                 Φ       )       ,           (   108   )                               
 
         [0274]    and the visibility is  
                   I   max     -     I   min           I   max     +     I   min         =            α        2     .             (   109   )                               
 
         [0275]    Now let us consider multiplexing the source as in the previous quantum protocols.  
         [0276]    The encoding step, rather than the trivial encoding (99), is  
                 A     2            (       ψ   S   1     +          Φ          φ   S   1         )       ↦       A       2      T                (         ∑     j   =   1     T                     ψ   T   j       +          Φ            ∑     j   =   1     T                     φ   T   j           )     .               (   110   )                               
 
         [0277]    This encoding can be thought of as a Fourier transform, as in the quantum case.  
         [0278]    The noise in the transmission channel causes the state to change to  
                 A       2      T              (         ∑     j   =   1     T                       ψ   T   j               θ   j           +          Φ            ∑     j   =   1     T                       φ   T   j               ξ   j               )       ,           (   111   )                               
 
         [0279]    where, as before θ i  and ξ j  are random phases with the same distribution for all i and j.  
         [0280]    We now perform decoding into receiver modes:  
                 ψ   T   j     ↦       1     T              ∑     k   =   1     T                            2          πj        (     k   -   1     )       /   T              ψ   R   k             ;       φ   T   j     ↦       1     T              ∑     k   =   1     T                            2          πj        (     k   -   1     )       /   T                φ   R   k     .                     (   112   )                               
 
         [0281]    As before we focus in the receiver channels ψ R   1  and φ R   1 . The terms in the state containing these channels are  
               A       2        T   2                (         (       ∑     k   =   1     T                          θ   k         )          ψ   R   1       +       (       ∑     k   =   1     T                          ξ   k         )             Φ          φ   R   1         )             (   113   )                               
 
         [0282]    As before, in order to see the phase Φ we resolve the state into two components  
                 ω   R   1     :=       1     2            (       ψ   R   1     +     φ   R   1       )         ;                  and                   z   R   1       :=       1     2              (       ψ   R   1     -     φ   R   1       )     .                 (   114   )                               
 
         [0283]    The phase Φ may be observed by considering the intensity of the W R   1  component:  
                 A   2       4        T   2                (       (       ∑     k   =   1     T                          θ   k         )     +       (       ∑     k   =   1     T                          ξ   k         )             Φ         )             2     .             (   115   )                               
 
         [0284]    The expected value of this intensity is  
                 A   2     2          (       1   +       (     T   -   1     )               α        2         T     )            (     1   +         T             α        2         1   +       (     T   -   1     )               α        2              cos                 Φ       )     .             (   116   )                               
 
         [0285]    Thus the visibility is  
                 T             α        2         1   +       (     T   -   1     )               α        2           .           (   117   )                               
 
         [0286]    This visibility increases monontonically with T and tends to one as T→∞.  
         [0287]    The protocol we have described is the analogue of the simple Fourier transform protocol for quantum signals in section 2.6. Not surprisingly they give the same visibility as the coherent states analysed in section 2.11. This protocol may easily be generalised as in sections 2.7 and 2.8. We also note that while it is important for the protocol that the noise in each channel was independent, it is less important that the noise in different channels is identically distributed. The exact extent to which the noise is filtered will depend on these distributions. However the protocol will still reduce the noise even if the distributions are not the same.  
         [0288]    2.13 Classical Channels with Internal Degrees of Freedom  
         [0289]    Let us now consider the case that the classical channels have internal degrees of freedom and that the noise has the effect of performing random rotations on these internal degrees of freedom.  
         [0290]    Let us label the orthonormal modes of the source channels ψ S   iμ  and φ S   jv  where i, j=1 . . . S label the different channels and μ, ν=1 . . . I label the different internal degrees of freedom. For simplicity of notation, however, we will use a vector notation and denote vectors of orthonormal modes by ψ S   i  and Φ S   j  (i.e. for each i, ψ S   i  is an I component vector).  
         [0291]    For simplicity of explanation, we will, as before, focus on two particular source modes, ψ S   1  and Φ S   1  (it is straightforward to see the effect on a larger number of source modes in a general incoming state). We use the visibility of interference between these modes as a measure of how well the errors are filtered. Specifically we form the superposition  
               A     2              (       Ψ   S   1     +     U                   Ψ   S   1         )     .             (   118   )                               
 
         [0292]    U is a unitary transformation (rotation) on Φ S   1  and we will calculate how well we can observe U after transmission.  
         [0293]    The noise in the transmission channels takes the following form. We label the modes of the transmission channels as ψ T   i  and Φ T   j  where i, j=1 . . . T. These modes interact with the environment and acquire random rotations:  
         ψ T   i =U i ψ T   i ; Φ T   j →V j Φ T   j .   (119)  
         [0294]    We assume that the random unitary transformations U i  and V j  are independent and have the same distributions for all i and j; no other properties of these random rotations will be needed.  
         [0295]    We now encode the source states using the Fourier transform, exactly as in the previous protocol:  
                 A     2            (       Ψ   S   1     +     U                   Ψ   S   1         )       ↦       A       2      T                (         ∑     j   =   1     T          Ψ   T   j       +     U                     ∑     j   =   1     T          Ψ   T   j           )     .               (   120   )                               
 
         [0296]    The decoding will also be via the Fourier transform:  
                 Ψ   T   j     ↦       1     T              ∑     k   =   1     T                 2                                  π                     j        (     k   -   1     )       /   T              Ψ   R   k             ;       Φ   T   j     ↦       1     T              ∑     k   =   1     T                 2                                  π                     j        (     k   -   1     )       /   T                Φ   R   k     .                     (   121   )                               
 
         [0297]    As before we focus in the receiver channels ψ R   1  and Φ R   1  and consider the two combinations  
                 w   R   1     :=       1     2            (       Ψ   R   1     +     Φ   R   1       )         ;       and                   z   R   1       :=       1     2              (       Ψ   R   1     -     Φ   R   1       )     .                 (   122   )                               
 
         [0298]    Finally we calculate the expected value of the intensity of the w R   1  component. If we call B the expected value of the random unitaries U i  and V j , we find that this intensity is  
                 A   2       2                 T              (     1   +       (     T   -   1     )          w   R     1      †            B   †        B                   w   R   1       +     T                   w   R     1      †              B   †          (       U   +     U   †       2     )          B                   w   R   1         )     .             (   123   )                               
 
         [0299]    If there is no noise, this intensity is equal to  
                   A   2       2                 T            (     1   +         w   R     1      †            (       U   +     U   †       2     )                       w   R   1         )       ,           (   124   )                               
 
         [0300]    with or without multiplexing. If the noise is uniform over the internal degrees of freedom, i.e. B=α(id) for some complex number a then the protocol improves the visibility and one finds that the output intensity is  
                 A   2       2                 T            (     1   +       (     T   -   1     )               α        2         )            (     1   +         T             α        2         1   +       (     T   -   1     )               α        2                  w   R     1      †            (       U   +     U   †       2     )                       w   R   1         )     .             (   125   )                               
 
         [0301]    If the noise is not uniform (i.e. different internal degrees of freedom are degraded differently), then we must further process the signal by acting with a decreasing operator C which has the property that CB=β(id) for some complex number β. Then the visibility is again improved as before with α replaced by β.  
         [0302]    As with the case of quantum mechanical signals where the channels have internal degrees of freedom, this protocol can be generalised to use much more general encoding and decoding schemes.  
         [0303]    2.14 Non-Linear Noise  
         [0304]    We now note that the previous protocols are also effective in the case that the noise is non-linear, in other words where the noise distribution depends on the amplitude. Let us first consider the case of classical signals without internal degrees of freedom as in section 2.12. Let us say that the transmission states ψ T   i  and φ T   j  have complex amplitudes A i  and B j  respectively. We consider initially that the noise in the transmission channels depends on these modulus of these complex amplitudes:  
         A i ψ T   i →A i e iθ     i     (|A     i     |) ψ T   i ; B j φ T   j →B j e iξ     j     (|B     j     |) φ T   j .   (126)  
         [0305]    We still consider the noise to be independent in different channels. Thus if the transmission signal is  
                   ∑     i   =   1     T                       A   i          ψ   T   i         +       ∑     j   =   1     T                       B   j          φ   T   j           ,           (   127   )                               
 
         [0306]    the noise transforms the signal to  
                   ∑     i   =   1     T                       A   i                                    θ   i          (          A   i          )                ψ   T   i         +       ∑     j   =   1     T                       B   j                                    ξ   j          (          B   j          )                φ   T   j           ,           (   128   )                               
 
         [0307]    We now consider exactly the same situation as in section 2.12. We start with the superposition  
                 A     2            (       ψ   S   1     +                             Φ            φ   S   1         )       ,           (   129   )                               
 
         [0308]    we mulitplex both ψ S   1  and φ S   1  to T transmission channels and consider the w R   1  component of the signal at the receiver. The amplitude of this component is  
               A       4        T   2                  (       (       ∑     k   =   1     T                                               θ   k          (     A       2      T         )             )     +       (       ∑     k   =   1     T                                               ξ   k          (     A       2      T         )             )                                Φ           )     .             (   130   )                               
 
         [0309]    The expected value of the random, amplitude-dependent, phases are  
                                             θ   k          (     A       2      T         )           _     =                                   ξ   k          (     A       2      T         )           _     =     α   (     A       2      T         )         ,           (   131   )                               
 
         [0310]    where this expected value depends on the amplitude in each transmission channel. Computing the visibility of the interference fringes, one finds the same result as when the noise is linear eq. (117), but now the constant α is replaced by the function (131).  
         [0311]    The improvement of the visibility combines two effects: first of all the increase of the visibility as T increases that was already apparent in eq. (117); and secondly the decrease of  
       α        (     A       2      T         )                           
 
         [0312]    as T increases (since one expects the non-linearity of the noise to decrease with decreasing intensity). That is, the multiplexing reduces the amplitude in each channel, and hence decreases the effects of any non-linearities. If the input modes have different intensities the situation is a little less straight-forward than the case when the intensities are equal, as in (129). However the multiplexing still helps to reduce the effect of the noise. This is particularly the case when the number of transmission channels T is large enough so that the function a becomes independent of the amplitude which will often be the case when the amplitude of the signal in a mode become small (as will be the case for large enough T). In this limit, the protocol works just as in the previous sections when the noise was assumed to be independent of the intensity. A similar remark also applies in the case that the phase disturbance (θ i  and ξ i  in this section) depend on the phase of the signal as well as its intensity; as T increases we expect this disturbance to be less and less significant since, as T increases the noise is likely to become independent of the phase of this signal.  
         [0313]    2.15 Classical and Quantum Amplitude Noise  
         [0314]    In all the previous protocols we considered the noise to be amplitude preserving. We now show using simple examples that our protocols also improve amplitude noise.  
         [0315]    We first consider the simplest example in the classical case. Recall that the simplest classical channel (section 2.12) was where the amplitude in each channel was described by a complex number (i.e. there were no internal degrees of freedom) and that the noise has the effect that the amplitudes in the transmission channels, ψ T   i  and φ T   j , became multiplied by a random phase:  
         ψ T   i =e iθ     i   ψ T   i ; φ T   j →e iξ     j   φ T   j .   (132)  
         [0316]    However it might be the case that rather than just being modified by random phases, these amplitude gets multiplied by a random complex number which need not have amplitude 1:  
         ψ T   i →β i ψ T   i ; φ T   j →γ i φ T   j .   (133)  
         [0317]    We now show that the previous classical protocols are also effective in this case. As before, we consider the noise to be independent in different channels.  
         [0318]    We now consider exactly the same situation as in sections 2.12,2.14. We start with the superposition  
                 A     2            (       ψ   S   1     +                             Φ            φ   S   1         )       ,           (   134   )                               
 
         [0319]    we mulitplex both ψ S   1  and φ S   1  to T transmission channels and consider the w R   1  component of the signal at the receiver. The amplitude of this component is  
               A       4        T   2                  (       (       ∑     k   =   1     T                     β   i       )     +       (       ∑     k   =   1     T                     γ   i       )                                Φ           )     .             (   135   )                               
 
         [0320]    Let us write the expection value of the random amplitudes as  
         {overscore (β i )}={overscore (γ i )}=β 
         {overscore (β i β i *)}={overscore (γ i γ i *)}=B 2    (136)  
         [0321]    where β is a complex number of modulus less than one and B is real (there is no summation in the terms in the second line). We note that  
         ββ*≦B 2    (137)  
         [0322]    The intensity observed at the receiver channel may be calculated to be  
                 A   2     2          (         B   2     +       (     T   -   1     )               β        2         T     )            (     1   +         T             β        2           B   2     +       (     T   -   1     )               β        2              cos                 Φ       )     .             (   138   )                               
 
         [0323]    Thus we see that the multiplexing will reduce the effect of amplitude noise, exactly as in the case of phase noise.  
         [0324]    Now consider, as an illustration, the quantum case in which a single particle is affected both by phase noise and amplitude noise; this is an illustration. In this case the evolution during transmission (3) is replaced by  
         | j&gt;   T |0&gt; E   →|j&gt;   T (α|0&gt; E   +β|j&gt;   E )+γ| abs   j &gt; T,E    (139)  
         [0325]    where γ is the amplitude that the particle is absorbed during transmission and |abs j &gt; E  is the state of the system plus environment if the particle is absorbed in transmission channel j. Using this noise model, all the calculations of section 2.16 follow through unchanged except that |α| 2 +|β| 2 =1−|γ| 2 &lt;1. In particular eq. (24), is unchanged, and hence we see that multiplexing improves the quality of the channel (and hence the quality of the interference) when both amplitude and phase noise occurs.  
         [0326]    It may be checked that all the protocols we have described improve the quality of transmission in the case of amplitude noise.  
         [0327]    2.16 Protocols for Communication of Entangled States  
         [0328]    All the previous protocols are error-filtration schemes for one-way communication of quantum and classical signals. We now show the these ideas may be extended to provide protocols for situations where the goal is to send entangled quantum states from a source to two or more parties.  
         [0329]    Firstly however let us note that if the goal is simply to set up entangled states between a number of parties, this may be achieved, and the errors diminished, by using the previous quantum protocols: one of the parties simply prepares the state locally and transmits it using the one-way communication channels we have described earlier.  
         [0330]    In what follows we will mostly concentrate, for explicitness, on protocols for transmission of a state from a source to two parties; it is clear that related ideas may be used to transmit a state from a source to three or more parties.  
         [0331]    In more detail the set-up is as follows. The source ( 4 . 01  in FIG. 4) emits two S-level systems ( 4 . 08 . 1  and  4 . 08 . 2  in FIG. 4). These are encoded by the encoders ( 4 . 04 . 1  and  4 . 04 . 2  in FIG. 4) as T-level systems. The signals then flow through the noisy channels, ( 4 . 03 . 1  and  4 . 03 . 2  in FIG. 4), are decoded by the decoders ( 4 . 05 . 1  and  4 . 05 . 2  in FIG. 4) to R-level systems ( 4 . 09 . 1  and  4 . 09 . 2  in FIG. 4). As with the protocols for one-way communication above, a novel aspect of the protocols we describe are the realisation that it is important to allow the encoding and decoding to change the dimension of the space of states; this is key to the performance of the protocols.  
         [0332]    Again, as with the earlier protocols, an important feature of the implementations we consider is the form of the Hilbert space of states as a direct sum of the Hilbert spaces of the individual transmission channels. Associated with this is the fact that the dominant type of noise has a very specific form: the noise on different channels is independent. It is the particular form of the noise which allows our protocols to work.  
         [0333]    For simplicity in this section we consider the case of phase noise. Just as in the one-way protocols, it is straightforward to generalise the protocols to the case of more general noise. We consider that any transmission state |j&gt; T  interacts with the environment as  
         | j&gt;   T |0&gt; E   →|j&gt;   T (α|0&gt; E   +β|j&gt;   E )   (140)  
         [0334]    where the environment states |j&gt; E  are orthogonal for different j.  
         [0335]    The protocols we describe have the following general structure. States of system A come from the source:  
         | i&gt;   S   A  ( i= 1  . . . S )   (141)  
         [0336]    These states are encoded by the encoder ( 4 . 04 . 1  in FIG. 4) by a transformation U A   E ; thus the state of the system which emerges is  
                     U   e   A     |   i     〉     S   A     =         ∑   T   A       j   =   1     T                         〈     j   |     U   e   A     |   i     〉     S   A                 j   〉     T   A     .                 (   142   )                               
 
         [0337]    Thus the initial state of the system plus environment of the channel is thus  
                 ∑   T   A       j   =   1     T                         〈     j   |     U   e   A     |   i     〉     S   A               j   〉     T   A                 0   〉     E   A     .               (   143   )                               
 
         [0338]    After transmission through the channel the state becomes  
                       ∑   T   A       j   =   1     T                         〈     j   |     U   e   A     |   i     〉     S   A               j   〉     T   A            (       α   jA     |   0     〉     E   A         +       β   jA               j   〉     E   A         )     .           (   144   )                               
 
         [0339]    The decoding acts by a further transformation U d   A  thus the final state after encoding and decoding is  
               ∑     j   =   1     T                  T   A          〈   j               U   e   A               i   〉     S   A                     U   d   A               j   〉     T   A            (         α   jA               0   〉     E   A       +       β   jA               j   〉     E   A         )     .               (   145   )                               
 
         [0340]    Finally, only some of the receiver states are used. This is accomplished by projecting the final state on a Hilbert subspace of receiver states of dimension R. We will denote this projector by II A . There is a certain liberty in choosing this projector as one can modify the projector by a unitary transformation which, on the other hand, can be absorbed into the definition of U d   A . For concreteness, we fix this arbitrariness by defining  
               Π   A     =       ∑     l   =   1     R                 k   〉     R   A                  R   A          〈   k          .                 (   146   )                               
 
         [0341]    Thus when starting with the initial state |i&gt; S   A |0&gt; E   A  we end up with the (unnormalized) state  
               ∑     j   =   1     T                  T   A          〈   j               U   e   A               i   〉     S   A                     Π   A          U   d   A               j   〉     T   A            (         α   jA               0   〉     E   A       +       β   jA               j   〉     E   A         )     .               (   147              )                               
 
         [0342]    Party B performs similar operations on its state.  
         [0343]    A given protocol is a choice of the dimensions of the different Hilbert spaces at each time, and of the encoding and decoding operations. Below we shall give some specific examples of these choices.  
         [0344]    2.16.1 Protocol 1: Multiplexing at the Source  
         [0345]    In this example the task is to share an R-dimensional maximally entangled state. The protocol works by preparing an S-level system (S&gt;R), allowing it to be transmitted through the noisy channel, and then processing it at the end (i.e. the encoding between the source and receiver channels is trivial and T=S). The protocol allows the two parties to end up with a final state of their R-level systems which has higher fidelity than would have been achieved if the R-level system were simply transmitted directly through the channel. We call our method “multiplexing at source” because we use a source which produces more entanglement than the one state we wish to produce at the receivers (S&gt;R). It is this which enables us to obtain a state at the receivers which is closer to the required state than that we would have obtained had we started with the source simply producing an R-dimensional entangled state.  
         [0346]    Consider the initial state  
                    ψ     i                 n       〉     =       1     S              ∑     i   =   1     S                 i   〉     S   A               i   〉     S   B               0   〉     E   A                 0   〉     E   B     .                   (   148   )                               
 
         [0347]    The first condition defining this protocol is that the encoding stage is trivial. This means that  
           T   A   &lt;j|U   e   A   |i&gt;   S   A = T   B   &lt;j|U   e   B   |i&gt;   S   B =δ ij    (149)  
         [0348]    Thus the un-normalised state of the system after decoding and projection is  
                    ψ   fin     〉     =       1     S              ∑     i   =   1     S            Π   A          Π   B          U   d   A          U   d   B               i   〉     T   A               i   〉     T   B          (       α             0   〉     E   A       +     β                        i   〉     E   A         )          (       α             0   〉     E   B       +     β             i   〉     E   B         )                   (   150   )                               
 
         [0349]    We are interested in the maximum fidelity to an R-level |ψ R &gt; singlet that we can produce  
                    ψ   R     〉     =       1     R              ∑     i   =   1     R                 i   〉     R   A                 i   〉     R   B     .                   (   151   )                               
 
         [0350]    The fidelity of the state |ψ fin &gt; is  
             F   =              〈       ψ   R     |     ψ   fin       〉          2       〈       ψ   fin     |     ψ   fin       〉               (   152   )                               
 
         [0351]    We now introduce the second condition defining the protocol, namely that U d   A  and U d   B  should be related by being essentially the complex conjugates of each other in the bases we are using. i.e. If we write  
                 U   d   A               i   〉     T   A       =       ∑   j            u   ij               j   〉     R   A                 (   153   )             then                             U   d   B               i   〉     T   B       =       ∑   j            u   ij   *                 j   〉     R   B     .                 (   154   )                               
 
         [0352]    This means in particular that  
                 U   d   A          U   d   B            ∑   i                 i   〉     T   A               i   〉     T   B           =       ∑   i                 i   〉     R   A                 i   〉     R   B     .                 (   155   )                               
 
         [0353]    Now let us compute  
                     〈       ψ   fin     |     ψ   fin       〉     =              1   S            ∑     i   ,       i   ′     =   1       S              〈     i   ′          T   B       T   A          〈     i   ′                 (     U   d   A     )     †            (     U   d   B     )     †          Π   A          Π   B          U   d   A          U   d   B               i   〉     T   A               i   〉     T   B     ×                              [            α        4     +       (     1   -          α        4       )          δ     i   ,     i   ′             ]                 =                       α        4     S            ∑     i   ,       i   ′     =   1       S              〈     i   ′          T   B       T   A          〈     i   ′                 (     U   d   A     )     †            (     U   d   B     )     †          Π   A          Π   B          U   d   A          U   d   B               i   〉     T   A               i   〉     T   B           +                              1   -          α        4       S            ∑     i   =   1     S              〈   i        T   B       T   A          〈   i               (     U   d   A     )     †            (     U   d   B     )     †          Π   A          Π   B          U   d   A          U   d   B               i   〉     T   A                 i   〉     T   B     .                         (   156   )                               
 
         [0354]    It may be calculated that  
               〈       ψ   fin          ψ   fin       〉     =                α        4        R     S     +         1   -          α        4       S            ∑     i   =   1     S                           (   T   A            〈     i              (     U   d   A     )     †          Π   A          U   d   A          i       〉     T   A     )     2     .                   (   157   )                               
 
         [0355]    Where we have used the fact that  
                         T   A            〈     i              (     U   d   A     )     †          Π   A          U   d   A          i       〉     T   A          =   T   B            〈     i              (     U   d   B     )     †          Π   B          U   d   B          i       〉     T   B                          (   158   )                 Als                 o                          〈       ψ   R          ψ   fin       〉          2       =                α        4        R     S     +         1   -          α        4         R                 S              ∑     i   =   1     S                           (   T   A            〈     i              (     U   d   A     )     †          Π   A          U   d   A          i       〉     T   A     )     2     .                   (   159   )                               
 
         [0356]    Thus we may write the fidelity as  
               F   =                〈       ψ   R          ψ   fin       〉          2       〈       ψ   fin          ψ   fin       〉       =       (                α        4        R     S     +         1   -          α        4       S          Y   R         )            (                α        4        R     S     +         1   -          α        4       S        Y       )       -   1                  
        where           (   160   )               Y   =       ∑     i   =   1     S                           (   T   A            〈     i              (     U   d   A     )     †          Π   A          U   d   A          i       〉     T   A     )     2     .               (   161   )                               
 
         [0357]    Y is a positive quantity and by Schwarz&#39;s inequality  
             Y   =         ∑     i   =   1     S            (                  〈     i              (     U   d   A     )     †          Π   A          U   d   A          i       〉     T   A       T   A     )     2       ≥       1   S              (       ∑     i   =   1     S                       〈     i              (     U   d   A     )     †          Π   A          U   d   A          i       〉     T   A       T   A       )     2     .     
        But                 (   162   )                   ∑     i   =   1     S                       〈     i              (     U   d   A     )     †          Π   A          U   d   A          i       〉     T   A       T   A       =     R   .     
        Thus             (   163   )               Y   ≥       R   2     S             (   164   )                               
 
         [0358]    with equality when  
                 〈     i              (     U   d   A     )     †          Π   A          U   d   A          i       〉     T   A       T   A     =       R   S                   for                 all                   i   .               (   165   )                               
 
         [0359]    We will impose (165) as the third condition defining this protocol. In this case, the fidelity is  
             F   =       (                α        4        R     S     +         1   -          α        4       S          R   S         )                         (                α        4        R     S     +       (     1   -          α        4       )            (     R   S     )     2         )       -   1       .               (   166   )                               
 
         [0360]    We see that by increasing the amount of entanglement produced by the source, (i.e. by increasing S), the fidelity is increased.  
         [0361]    2.16.2 Protocol 2  
         [0362]    We may also use the protocols for error filtration presented in sections 2.6,2.7, 2.8 directly to filter errors when communicating entangled quantum states. We can think of the protocols in sections 2.6,2.7, 2.8 as ways of improving a given transmission channel: by multiplexing each source channel to T transmission channels we can reduce the error amplitude from β to β/{square root}{square root over (T)}.  
         [0363]    Consider, then, that a source prepares a state of two S level systems. This state is pre-processed by multiplexing each source channel into T transmission channels using a general encoding as given in section 2.7. The signal is then decoded and post-processed to yield a state at the two receivers R A  and R B . The received state will be of higher fidelity than if the pre- and post-processing had not been used.  
         [0364]    Consider for example the following input state  
                                ψ     i                 n         〉     =       ∑     i   =   1     S            a   i             i   〉              S   A                   i     〉              S   B       ,           (   167   )                               
 
         [0365]    where a i  are complex amplitudes (this is essentially the most general bi-partite state). If each source channel is processed through T transmission channels, in such a way that the original error amplitude is reduced from β to β/{square root}{square root over (T)}, then the final state is  
                                                      ψ     f                 i                 n         〉     =       ∑     i   =   1     S            a   i             i   〉              S   A                   i     〉            (     α      0     〉     E   A       S   B       +     β     T            i     〉              E   A       )            (     α      0     〉     E   B       +     β     T            i     〉              E   B       )     .           (   168   )                               
 
         [0366]    The fidelity of the state at the receivers to the state which would have been transmitted if there were no noise (i.e.  
                 (     i   .   e   .                  ∑     i   =   1     S            a   i             i   〉              R   A                   i     〉              S   B       )                   is                         
 
                   F   =                     〈       ψ     i                 n            ψ   fin       〉          2       〈       ψ   fin          ψ   fin       〉                   =                       α        4     +       [         (            α        2     +            β        2     /   T       )     2     -          α        4       ]            ∑     i   =   1     S                 a   i          4               (            α        2     +            β        2     /   T       )     2       .                   (   169   )                               
 
         [0367]    Thus the fidelity increases monotonically with T and tends to 1 as T→∞.  
         [0368]    3 Physical Implementations of Error Filtration  
         [0369]    3.1 Example of the Implementation of the Simple Error Filtration Protocols in Optical Fibres.  
         [0370]    This is illustrated in FIG. 5. For concreteness we consider the case in which there are two source channels and four transmission channels. The source  5 . 01  sends signals down two optical fibres: the source channels  5 . 08 . 1  and  5 . 08 . 3 . The encoding is performed by using optical couplers as encoders  5 . 04 . The signal then travels along the noisy transmission fibres  5 . 03 . 1 - 5 . 03 . 4 . The decoders,  5 . 05 , are also optical couplers. The signal is collected at the receivers  5 . 02 ; the useful channels are  5 . 09 . 1  and  5 . 09 . 3 ; the signals appearing at the other two channels,  5 . 07 . 2  and  5 . 07 . 4 , are pure noise and are discarded. Note that the pairs of transmission fibers  5 . 03 . 1  and  5 . 03 . 2  (or  5 . 03 . 3  and  5 . 03 . 4 ) constitute an interferometer. The optical length of these two fibers must be equal so that in the absence of noise a signal emitted by the source in fiber  5 . 08 . 1  (or  5 . 08 . 3 ) is recovered with certainty in fiber  5 . 09 . 1  (or  5 . 09 . 3 ).  
         [0371]    This hardware can be used for many of the protocols we describe in the text: single photon quantum signals, states with internal degrees of freedom, multi-photon quantum states and classical signals.  
         [0372]    In the case of single photon quantum states the two source channels carry the states |1&gt; S  and |3&gt; S  (for consistency with the notation in the text) and the four transmission channels carry the states |i&gt; T , i=1 . . . 4. The state of the photon in the source fibres  5 . 08 . 1  and  5 . 08 . 3  is al |1&gt; S +b|3&gt; S  where a and b are complex numbers, |a| 2 +|b| 2 =1. The state emerging from the encoders  5 . 04  is  
           a     2            (            1   〉     T     +          2   〉     T       )       +       b     2              (            3   〉     T     +          4   〉     T       )     .                             
 
         [0373]    The signal then travels along the noisy transmission fibres  5 . 03 . 1 - 5 . 03 . 4 . The upper decoder causes the transformations  
                1   〉     T     ↦       1     2            (            1   〉     R     -          2   〉     R       )                   and                        2   〉     T       ↦       1     2            (            1   〉     R     +          2   〉     R       )         ;                         
 
         [0374]    the lower decoder causes the transformations  
              3   〉     T     ↦       1     2            (            3   〉     R     -          4   〉     R       )                             
 
         [0375]    and  
              4   〉     T     ↦       1     2              (            3   〉     R     +          4   〉     R       )     .                             
 
         [0376]    The states in the useful channels  5 . 09 . 1  and  5 . 09 . 3  are |1&gt; R  and |3&gt; R , respectively.  
         [0377]    In the case of classical wave signals the two source channels carry the modes ψ S   1  and φ S   1  (for consistency with the notation in the text) and the four transmission channels carry the modes ψ T   1 , ψ T   2 , ψ T   1  and ψ T   2 . The signal in the source fibres  5 . 08 . 1  and  5 . 08 . 3  is aψ S   1 +bφ S   1  where a and b are complex numbers, with |a| 2 +|b| 2  equal to the total intensity emitted by the source. The state emerging from the encoders  5 . 04  is  
           a     2            (       ψ   T   1     +     ψ   T   2       )       +       b     2              (       φ   T   1     +     φ   T   2       )     .                             
 
         [0378]    The signal then travels along the noisy transmission fibres  5 . 03 . 1 - 5 . 03 . 4 . The upper decoder causes the transformations  
         ψ   T   1     ↦       1     2            (       ψ   R   1     -     ψ   R   2       )                             
 
         [0379]    and  
           ψ   T   2     ↦       1     2            (       ψ   R   1     +     ψ   R   2       )         ;                         
 
         [0380]    the lower decoder causes the transformations  
         φ   T   1     ↦       1     2            (       φ   R   1     -     φ   R   2       )                   and                   φ   T   2       ↦       1     2              (       φ   R   1     +     φ   R   2       )     .                             
 
         [0381]    The states in the useful channels  5 . 09 . 1  and  5 . 09 . 3  are ψ R   1  and φ R   1 , respectively.  
         [0382]    Filtration of the other types of signal listed above works in very similar ways, as described in detail in part 2.  
         [0383]    We note that we have not made use of any internal degrees of freedom of the signals in the above examples. In the case of single photon states we could slightly change the implementation encoding the signal in the two polarisation states |H&gt; and |V&gt; of the photon. Thus using these internal degrees of freedom we need only use one source channel and two transmission channels. The signal could be encoded as a|H&gt; S +b|V&gt; S . The encoding and decoding would be carried out by a single non-polarising beam-splitter. As long as the noise for all four components of the transmission signal (horizontal and vertical polarization in each of two fibres) is independent, the protocol will work exactly as above.  
         [0384]    3.2 Example of the Implementation of the Simple Error Filtration Protocols Optically in Free Space.  
         [0385]    This is illustrated in FIG. 6, and is very similar to the implementations in the previous section except that rather than being sent through optical fibres, the signal is sent through free space. Thus the optical elements are different. As in the examples in the previous section, for concreteness we consider the case in which there are two source channels and four transmission channels. The source  6 . 01  sends signals into free space: the source channels  6 . 08 . 1  and  6 . 08 . 3 . The encoding is performed by using beam splitters as encoders  6 . 04 . The signal then travels along the noisy transmission paths  6 . 03 . 1 - 6 . 03 . 4 ; these signal paths should have the same optical length. The signals must be directed to the output and so mirrors  6 . 10  are needed to direct the signal. The decoders,  6 . 05 , are also beam-splitters. The signal is collected at the receivers  6 . 02 ; the useful channels are  6 . 09 . 1  and  6 . 09 . 3 ; the signals appearing at the other two channels,  6 . 07 . 2  and  6 . 07 . 4 , are pure noise and are discarded.  
         [0386]    As in the implementations in optical fibres in the previous section, this hardware can be used for many of the protocols we describe in the text: single photon quantum signals, states with internal degrees of freedom, multi-photon quantum states and classical signals.  
         [0387]    The mathematical description of the states of the system during the transmission are exactly the same as in the previous implementations and so are not repeated here.  
         [0388]    3.3 Example of the Implementation of the Simple Error Filtration Protocols Using Time-Bins in Optical Fibres.  
         [0389]    This is illustrated in FIG. 7. In this implementation the signal is sent through optical fibres. However, rather than being sent through multiple physical fibres as in the implementations in section 3.1, the signals are sent through a single fibre, but the different components of the signal are encoded in different time-bins. This implementation is based on the recent realisation that one can easily manipulate signals propagating in optical fibers and distributed in time bins (J. Brendel, W. Tittel, H. Zbinden and N. Gisin, Phys. Rev. Lett. 82, 2594, 1999). We refer to this reference for a description of how to realise a source that emits a signal in different time bins.  
         [0390]    As in the examples in the previous sections, for concreteness we consider the case in which there are two source basis states which we will refer to as source channels and four transmission basis states (channels). The source  7 . 01  sends signals along the fibre in two time bins. To make it easier to see how the implementation works we have drawn these two signals as a round blob  7 . 08 . 3  and a triangular one  7 . 08 . 1 .  
         [0391]    The encoding is performed by the single encoder  7 . 04 . The encoder has one short arm  7 . 12  and one long arm  7 . 13 . A signal arriving at the encoder first passes through the optical coupler  7 . 11 . 1  and has amplitude 1/{square root}{square root over (2)} of passing through the long or the short arm of the encoder. It then reaches a switch  7 . 14 . 1 . This switch is synchronized with the source in such a way that it sends both the part of the signal that passed along the long arm of the encoder and the short arm of the encoder through the transmission optical fiber  7 . 03 . 0 . The effect of the encoder is that any signal arriving at the encoder leaves it split into two time bins. The relative lengths of the optical paths in the two arms are arranged so that the time separation of the two time bins is greater than the time separation of the two incoming bins (this simplifies the switching in the decoder—see below). The result of this encoding is that the original signal in two time bins emerges in four time bins  7 . 03 . 1 - 7 . 03 . 4  and the signal then travels along the noisy transmission fibre in these four time bins.  
         [0392]    There is a single physical decoder,  7 . 05 . It has a switch  7 . 14 . 2  at the incoming end, one short path  7 . 16  and one long one  7 . 17 , and an optical coupler  7 . 15  (with transmission and coefficients of 1/{square root}{square root over (2)}) at the output end. The optical path lengths along the arms of the decoder are arranged to be the same as that of the corresponding arms of the encoder. The two first signal components to arrive at the decoder (i.e. those which went along the short path in the encoder) are sent along the long path; the switch is then thrown so that the second pair of signals is sent through the short arm of the decoder. Thus the switch must be timed with the known optical lengths of the different paths. The decoder has the effect of re-combining signals into two time bins. The signal is collected at the receiver  7 . 02 ; the useful channels are  7 . 09 . 1  and  7 . 09 . 3 ; the signals appearing at the other two channels,  7 . 07 . 2  and  7 . 07 . 4 , are pure noise and are discarded.  
         [0393]    An advantage of this scheme is that it does not require us to stabilize an interferometer over the whole transmission line. Only the difference in optical length between the short and long arm of the coder and decoder must be kept constant. On the other hand this scheme requires a non-linear element, namely the switches. If one replaces the switches by couplers with 1/{square root}{square root over (2)} transmission coefficients, then the scheme continues to work, but each particle has probability ¾ of being discarded (and the receiver must be able to discriminate on the basis of time of arrival whether to accept the particle or discard it).  
         [0394]    As in the implementations in the previous sections, this hardware can be used for many of the protocols we describe in the text: single photon quantum signals, states with internal degrees of freedom, multi-photon quantum states and classical signals.  
         [0395]    In the case of single photon quantum states the two source time-bins (channels) carry the states |1&gt; S  and |3&gt; S  (for consistency with the notation in the text) and the four transmission time-bins carry the states |i&gt; T , i=1 . . . 4. The state of the photon in the source time-bins  7 . 08 . 1  and  7 . 08 . 3  is a|1&gt; S +b|3&gt; S  where, as before, a and b are complex numbers, |a| 2 +|b| 2 =1. The state emerging from the encoder  7 . 04  is  
           a     2            (            1   〉     T     +          2   〉     T       )       +       b     2              (            3   〉     T     +          4   〉     T       )     .                             
 
         [0396]    The signal then travels along the noisy transmission line in the four time-bins  7 . 03 . 1 - 7 . 03 . 4 . The decoder causes the transformations  
              1   〉     T     ↦       1     2            (            1   〉     R     -          2   〉     R       )                   and                        2   〉     T       ↦       1     2            (            1   〉     R     +          2   〉     R       )                   and                        3   〉     T       ↦       1     2            (            3   〉     R     -          4   〉     R       )                             
 
         [0397]    and  
              4   〉     T     ⇥       1     2              (            3   〉     R     +          4   〉     R       )     .                             
 
         [0398]    The states in the useful time-bins  7 . 09 . 1  and  7 . 09 . 3  are |1&gt; S  and |1&gt; R  respectively.  
         [0399]    Filtration of the other types of signal listed above works in very similar ways, as described in detail in part 2; we do not repeat the mathematical description here.  
         [0400]    As before we note that we have not made use of any internal degrees of freedom of the signals in the example in this section. In the case of single photon states we could slightly change the implementation encoding the signal in the two polarisation states |V&gt; and |H&gt; of the photon. Thus using these internal degrees of freedom we need only have one source time-bin and two transmission time-bins. The signal could be encoded as a|V&gt; S +b|H&gt; S . As long as the noise for all four components of the transmission signal (up and down polarization in each of two time-bins) is independent, the protocol will work exactly as above.  
         [0401]    3.4 Example of the Implementation of the Simple Error Filtration Protocols Using Time-Bins in Free Space.  
         [0402]    This is illustrated in FIG. 8. Just as there is a free space analogue section 3.2 of the multi-fibre protocol in section 3.1, there is a free space analogue of the implementation in the previous section, using time-bins. The principle of the implementation in this section is very similar to that in the previous section, but the hard-ware is different.  
         [0403]    As in the examples in the previous section, for concreteness we consider the case in which there are two source basis states (channels) and four transmission basis states (channels). The source  8 . 01  sends signals in free-space in two time bins. The encoding is performed by the single encoder  8 . 04 . The encoder has one short arm  8 . 12  and one long arm  8 . 13 . A signal arriving at the encoder reaches the beam-splitter  8 . 11 . 1  and is distributed through the two arms of the encoder. Mirrors  8 . 10  are needed to direct the photon to switch  8 . 14 . 1  which completes the encoding. As in the implementation in the previous section, the effect of the encoder is that any signal arriving at the encoder leaves it split into two time bins; again the relative lengths of the optical paths in the two arms are arranged so that the time separation of the two time bins is greater than the time separation of the two incoming bins. The result of this encoding is that the original signal in two time bins emerges in four time bins and the signal then travels in free space in these four time bins  8 . 03 ; during this travel there is noise. There is a single physical decoder,  8 . 05 . It has a switch  8 . 14 . 2  at the incoming end, one short path  8 . 16  and one long one  8 . 17 , and an beam-splitter at the output end  8 . 11 . 2 . The optical path lengths along the arms of the decoder are arranged to be the same as that of the corresponding arms of the encoder. The two first signal components to arrive at the decoder (i.e. those which went along the short path in the encoder) are sent along the long path; the switch is then thrown so that the second pair of signals is sent through the short arm of the decoder. The switch must be timed with the known path lengths of the entire optical paths. The decoder has the effect of re-combining signals into two time bins.  
         [0404]    The signal is collected at the receiver  8 . 02 ; any signals appearing at  8 . 07  are pure noise and are discarded.  
         [0405]    As in the implementations in the previous sections, this hardware can be used for many of the protocols we describe in the text: single photon quantum signals, states with internal degrees of freedom, multi-photon quantum states and classical signals.  
         [0406]    The description of the state at each stage in the implementation of any protocol is exactly as in the previous section.  
         [0407]    We note as before that we have not made use of any internal degrees of freedom of the signals in the example in this section and that this may be done, hence reducing the number of time bins necessary.  
         [0408]    3.5 Example of the Implementation of the Protocol for Distribution of Entangled States in Multiple Optical Fibres.  
         [0409]    This is illustrated in FIG. 9. This implementation is of the protocol in section 2.16.1 which uses multiplexing at the source. The goal is to provide the receivers A and is B ( 9 . 02 . 1  and  9 . 02 . 2  respectively) with a state which is as close as possible to a maximally entangled state. For concreteness we consider the case in which the receivers wish to share a maximally entangled state of two 2-level systems, and where there are four source channels emerging towards each receiver. We recall that in this case there is no encoding therefore that there are also four transmission channels. The signal leaves the source and then travels along the noisy transmission fibres  9 . 03 . 1 - 9 . 03 . 8 . The optical length of each pair of tranmission fibers (for instance  9 . 03 . 1  and  9 . 03 . 2 ) must be equal. The decoders,  9 . 05 . 1 - 9 . 05 . 4 , are optical couplers with 1/{square root}{square root over (2)} transmission amplitudes. The signal is collected at the receivers  9 . 02 . 1  and  9 . 02 . 2 . Each receiver collects the signal arriving at two channels and the receivers must collect the signals arriving at correlated channels. Thus for example receiver  9 . 02 . 1  could collect the signal arriving in channels  9 . 09 . 1  and  9 . 09 . 3  in which case receiver  9 . 02 . 2  should collect the signals arriving in channels  9 . 09 . 5  and  9 . 09 . 7 .  
         [0410]    In this implementation of the protocol in section  2 . 16 . 1  the photons leave the source in state  
               1   2            (              1   〉     S   A               1   〉     S   B       +            2   〉     S   A               2   〉     S   B       +            3   〉     S   A               3   〉     S   B       +            4   〉     S   A               4   〉     S   B         )     .             (   170   )                               
 
         [0411]    Since the encoding is trivial, the state entering the noisy fibres is  
               1   2            (              1   〉     T   A               1   〉     T   B       +            2   〉     T   A               2   〉     T   B       +            3   〉     T   A               3   〉     T   B       +            4   〉     T   A               4   〉     T   B         )     .             (   171   )                               
 
         [0412]    The signal then travels along the noisy transmission fibres  9 . 03 . 1 - 9 . 03 . 8 . The signals entering decoder  9 . 05 . 1  are |1&gt; T   A  and |2&gt; T   A , and the decoder causes the transformations  
                1   〉     T   A     ⇥       1     2            (            1   〉     R   A     -          2   〉     R   A       )                   and                        2   〉     T   A       ⇥       1     2              (            1   〉     R   A     +          2   〉     R   A       )     .                                          
 
         [0413]    Similarly the other decoders  9 . 05 . 2 - 9 . 05 . 4  cause the transformations  
              3   〉     T   A     ⇥       1     2            (            3   〉     R   A     -          4   〉     R   A       )                             
 
         [0414]    and  
                4   〉     T   A     ⇥       1     2            (            3   〉     R   A     +          4   〉     R   A       )         ;            1   〉     T   B     ⇥       1     2            (            1   〉     R   B     -          2   〉     R   B     -          2   〉     R   B       )                   and                        2   〉     T   B     ⇥       1     2            (            1   〉     R   B     +          2   〉     R   B       )         ;            3   〉     T   B     ⇥       1     2            (            3   〉     R   B     -          4   〉     R   B       )                   and                      4   〉     T   B     ⇥       1     2              (            3   〉     R   B     +          4   〉     R   B       )     .                             
 
         [0415]    The receivers collect the states |1&gt; R   A , |3&gt; R   A , |1&gt; R   B  and |3&gt; R   B  which appear in channels  9 . 09 . 1 ,  9 . 09 . 3 ,  9 . 09 . 5  and  9 . 09 . 7 . The receivers will also collect error-filtered entangled states if they collect the complementary states |2&gt; R   A , |4&gt; R   A , |2&gt; R   B  and |4&gt; R   B  which appear in the other receiver channels. It may be checked that these choices of the decoding operation and the states which are collected satisfy the three conditions of section 2.16.1.  
         [0416]    An example of an arrangement for a source which can be used in this protocol is given in FIG. 13. A laser  13 . 01  sends a UV pulse  13 . 05  along an optical fibre  13 . 04 . It reaches a coupler  13 . 02  generating four pulses  13 . 06  each travelling on one of the four optical fibres  13 . 09  of equal optical length. The four pulses  13 . 06  reach four non-linear crystals  13 . 07  simultaneously. Each pulse generates 2 optical photon pulses. The four upper fibres  13 . 11 . 1 - 13 . 11 . 4 , one emerging from each crystal correspond to the four fibres  9 . 03 . 1 - 9 . 03 . 4  in FIG. 9. The four lower fibres  13 . 11 . 5 - 13 . 11 . 8 , one emerging from each crystal correspond to the four fibres  9 . 03 . 5 - 9 . 03 . 8  in FIG. 9.  
         [0417]    The whole set up may also be implemented in free-space rather than using optical fibres, exactly as the one-way communication protocols could be implemented in fibres or free-space. As before mirrors are needed to direct the photons and the optical couplers will be replaced by beam-splitters.  
         [0418]    We note again that we have not made use of any internal degrees of freedom of the signals in the above examples. We could slightly change the implementation to make use of the two polarisation states of the photon. Thus using these internal degrees of freedom reduces the number of physical fibres. As long as the noise for all components of the transmission signal is independent, the protocol will work exactly as above.  
         [0419]    3.6 Example of the Implementation of the Protocol for Distribution of Entangled States in Time-Bins in Optical Fibres.  
         [0420]    This is illustrated in FIG. 10. This implementation is of the same protocol as in the previous section namely using multiplexing at the source. However, rather than using multiple fibres as in the previous protocol, the signal is encoded in multiple time bins. As before the goal is to provide the receivers A and B ( 10 . 02 . 1  and  10 . 02 . 2  respectively) with a state which is as close as possible to a maximally entangled state. Again we consider the case in which the receivers wish to share a maximally entangled state of two 2-level systems. We consider the case that there are four source time-bins travelling towards each receiver. As before, there is no encoding therefore there are also four transmission time-bins. Note that it was shown in Brendel et al. Phys Rev Lett 82 (1999) 2594, how to realise experimentally a source of entangled states in multiple time bins.  
         [0421]    Let us consider the signal travelling towards receiver A; the description of the signal travelling to B is identical. The signal leaves the source and then travels along the noisy transmission fibre in four time bins  10 . 03 . 1 - 10 . 03 . 4 . There is a single physical decoder in this part of the apparatus,  10 . 05 . 1 . It has a switch  10 . 14 . 1  at the incoming end, one short path  10 . 16 . 1  and one long one  10 . 17 . 1 , and an optical coupler at the output end  10 . 15 . 1 . The optical path lengths along the arms of the decoder are arranged to be the same as that between time bins  10 . 03 . 1  and  10 . 03 . 2  which is the same as that between  10 . 03 . 3  and  10 . 03 . 4 . The two first signal components to arrive at the decoder are sent along the long path; the switch is then thrown so that the second pair of signals is sent through the short arm of the decoder. The switch must be timed with the known path lengths of the entire optical paths. The decoder has the effect of re-combining signals into two time bins along each output fibre from the coupler. The signal is collected at the receiver  10 . 02 . 1 ; if this receiver collects the two time bins  10 . 09 . 1  and  10 . 09 . 3 , then the other receiver must collect the corresponding time bins on its side.  
         [0422]    The description of the states and transformations performed by the apparatus are precisely analogous to that in the previous section and need not be repeated.  
         [0423]    An example of a source which can be used in this protocol was described in Brendel et al. Phys Rev Lett 82 (1999) 2594, and is illustrated in FIG. 12. A laser  12 . 01  emits an UV pulse  12 . 05  along an optical fibre  12 . 04 . An optical coupler  12 . 02  connects 4 optical fibres  12 . 09  of different optical lengths. The original pulse is split into 4 pulses, one travelling along each of the fibres  12 . 09 . The fibres are recoupled at the coupler  12 . 03 . Four pulses will emerge from the coupler and travel along fibre  12 . 10 . The pulses reach a non-linear crystal  12 . 07 . At the crystal each of the four pulses  12 . 06  generates 2 optical photon pulses, one travelling along fibre  12 . 11 . 1  and the other along  12 . 11 . 2 . Thus a total of 8 pulses are generated by the four pulses  12 . 06 . The set of four pulses  12 . 08 . 1  are used as the signal pulses  10 . 03 . 1 - 10 . 03 . 4  sent towards receiver  10 . 02 . 1  in FIG. 10, the other four pulses  12 . 08 . 2  are used as the signal pulses sent towards receiver  10 . 02 . 2  in FIG. 10.  
         [0424]    Also, as described in the previous section, the whole set up may also be implemented in free-space rather than using optical fibres, exactly as the one-way communication protocols could be implemented in fibres or free-space. As before mirrors are needed to direct the photons and the optical couplers will be replaced by beam-splitters.  
         [0425]    We note again that we have not made use of any internal degrees of freedom of the signals in the above examples. We could slightly change the implementation to make use of the two polaxisation states of the photon. Thus using these internal degrees of freedom reduces the number of time-bins needed. As long as the noise for all components of the transmission signal is independent, the protocol will work exactly as above.  
         [0426]    3.7 The Implementation of the Second Protocol for Distribution of Entangled States.  
         [0427]    We simply note here that, as was made clear in the text in section 2.16, any of the one-way communication protocols which improve the transmission of quantum states may be used to improve the transmission of entangled states.  
         [0428]    3.8 The Implementation of Protocols in Mesoscopic Quantum Systems.  
         [0429]    We note that any of the previous implementations of protocols may be adapted to the use in mesoscopic systems, or indeed any other physical arena in which it is possible to perform quantum or classical wave information processing: the optical elements (fibres, couplers, beam-splitters etc.) are simply replaced by the element which performs the equivalent task in the mesoscopic or other domain.  
         [0430]    In the case of mesoscopic implementations explicit descriptions of examples of physical elements which may be used to implement our protocols may be found in R. Ionicioiu et al quant-ph/9907043 and quant-ph/0011051 and references therein. For each optical element we have used in our protocols above, there corresponding nano-scale object; specifically a quantum nano-wire corresponds to the optical fibre and a electron wave-guide coupler or a symmetric tunneling junction correspond to a beam-splitter or optical coupler.  
         [0431]    [0431]FIG. 11 illustrates the implementation of the simplest protocol (section 2.6) in the mesoscopic domain. For concreteness we consider the case in which there are two source channels and four transmission channels. The source  11 . 01  sends signals down two nano-wires: the source channels  11 . 08 . 1  and  11 . 08 . 3 . The encoding is performed by using nano-scale couplers as encoders  11 . 04 . The signal then travels along the noisy transmission wires  11 . 03 . 1 - 11 . 03 . 4 . The decoders,  11 . 05 , are also nano-scale couplers. The signal is collected at the receivers  11 . 02 ; the useful channels are  11 . 09 . 1  and  11 . 09 . 3 ; the signals appearing at the other two channels,  11 . 07 . 2  and  11 . 07 . 4 , are pure noise and are discarded. Note that the pairs of transmission wires  11 . 03 . 1  and  11 . 03 . 2  (or  11 . 03 . 3  and  11 . 03 . 4 ) constitute an interferometer. The transmission length of these two wires must be equal so that in the absence of noise a signal emitted by the source in wire  11 . 08 . 1  (or  11 . 08 . 3 ) is recovered with certainty in wire  11 . 09 . 1  (or  11 . 09 . 3 ).  
         [0432]    This hardware can be used for many of the protocols we describe in the text: single electron quantum signals, states with internal degrees of freedom, multi-particle quantum states and classical currents.