We present a general model for quantum channels with memory and show that it is sufficiently general to encompass all causal automata: any quantum process in which outputs up to some time @math do not depend on inputs at times @math can be decomposed into a concatenated memory channel. We then examine and present different physical setups in which channels with memory may be operated for the transfer of (private) classical and quantum information. These include setups in which either the receiver or a malicious third party have control of the initializing memory. We introduce classical and quantum channel capacities for these settings and give several examples to show that they may or may not coincide. Entropic upper bounds on the various channel capacities are given. For forgetful quantum channels, in which the effect of the initializing memory dies out as time increases, coding theorems are presented to show that these bounds may be saturated. Forgetful quantum channels are shown to be open and dense in the set of quantum memory channels.
Recently, an unmodulated spin chain has been proposed as a model for short distance quantum communication @cite_30 @cite_56 @cite_23 @cite_11 . In such a scheme, the state to be communicated over the channel is placed on one of the spins of the chain, propagates for a specific amount of time, and is then received at a distant spin of the chain (cf. Fig. ). When viewed as a model for quantum communication, it is generally assumed that a reset of the spin chain occurs after each signal @cite_28 , for example by applying an external magnetic field, resulting in a memoryless channel. However, a continuous operation without reset may lead to higher transmission rates, and corresponds to a quantum channel with memory.
@cite_30 @cite_28 @cite_56 @cite_23 @cite_11
1983655155 1974818117 2074134590 2006456190
We propose a scheme for using an unmodulated and unmeasured spin chain as a channel for short distance quantum communications. The state to be transmitted is placed on one spin of the chain and received later on a distantspin with some fidelity. We first obtain simple expressions for the fidelity of quantum state transfer and the amount of entanglement sharable between any two sites of an arbitrary Heisenberg ferromagnet using our scheme. We then apply this to the realizable case of an open ended chain with nearest neighbor interactions. The fidelity of quantum state transfer is obtained as an inverse discrete cosine transform and as a Bessel function series. We find that in a reasonable time, a qubit can be directly transmitted with better than classical fidelity across the full length of chains of up to 80 spins. Moreover, our channel allows distillable entanglement to be shared over arbitrary distances. We suggest a protocol for perfect quantum communication through spin-chain channels. By combining a dual-rail encoding with measurements only at the receiving end, we can get conclusively perfect state transfer, whose probability of success can be made arbitrarily close to unity. As an example of such an amplitude-delaying channel, we show how two parallel Heisenberg spin chains can be used as quantum wires. Perfect state transfer with a probability of failure lower than P in a Heisenberg chain of N spin-(1 2) particles can be achieved in a timescale of the order of (0.33( Dirac_h 2 pi ) J)N sup 1.7 vertical bar ln P vertical bar. We demonstrate that our scheme is more robust to decoherence and nonoptimal timing than any scheme using single spin chains. In this paper we study quantum communication channels with correlated noise effects, i.e., quantum channels with memory. We derive a model for correlated noise channels that includes a channel memory state. We examine the case where the memory is finite, and derive bounds on the classical and quantum capacities. For the entanglement-assisted and unassisted classical capacities it is shown that these bounds are attainable for certain classes of channel. Also, we show that the structure of any finite-memory state is unimportant in the asymptotic limit, and specifically, for a perfect finite-memory channel where no information is lost to the environment, achieving the upper bound implies that the channel is asymptotically noiseless. Abstract Simulation-based and information theoretic models for a diffusion-based short-range molecular communication channel between a nano-transmitter and a nano-receiver are constructed to analyze information rates between channel inputs and outputs when the inputs are independent and identically distributed (i.i.d.). The total number of molecules available for information transfer is assumed to be limited. It is also assumed that there is a maximum tolerable delay bound for the overall information transfer. Information rates are computed via simulation-based methods for different time slot lengths and transmitter–receiver distances. The rates obtained from simulations are then compared to those computed using information theoretic channel models which provide upper bounds for information rates. The results indicate that a 4-input–2-output discrete channel model provides a very good approximation to the nano-communication channel, particularly when the time slot lengths are large and the distance between the transmitter and the receiver is small. It is shown through an extensive set of simulations that the information theoretic channel capacity with i.i.d. inputs can be achieved when an encoder adjusts the relative frequency of binary zeros to be higher (between 50 and 70 for the scenarios considered) than binary ones, where a ‘zero’ corresponds to not releasing and a ‘one’ corresponds to releasing a molecule from the transmitter.