#### Filter Results:

#### Publication Year

2006

2011

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

In this paper we consider the transmission of classical information through a class of quantum channels with long-term memory, which are given by convex combinations of product channels. Hence, the memory of such channels is given by a Markov chain which is aperiodic but not irreducible. We prove the coding theorem and weak converse for this class of… (More)

In this paper, a quantum version of Feinstein's theorem is developed. This is then used to give a completely self-contained proof of the direct channel coding theorem, for transmission of classical information through a quantum channel with Markovian correlated noise. Our proof does not rely on the Holevo-Schumacher-Westmoreland (HSW) theorem. In addition,… (More)

- Tony Dorlas
- 2008

We study large deviations principles for N random processes on the lattice Z d with finite time horizon [0, β] under a symmetrised measure where all initial and terminal points are uniformly given by a random permutation. That is, given a permutation σ of N elements and a vector (x 1 ,. .. , x N) of N initial points we let the random processes terminate in… (More)

- Stefan Adams, Tony Dorlas
- 2007

We give a new derivation of the variational formula for the pressure of the long-range-hopping Bose-Hubbard model, which was first proved in [1]. The proof is analogous to that of a theorem on noncommutative large deviations introduced by Petz, Raggio and Verbeure [2] and could similarly be extended to more general Bose system of mean-field type. We apply… (More)

The classical capacity of a quantum channel with arbitrary Marko-vian correlated noise is evaluated. For an irreducible and aperiodic Markov Chain, the channel is forgetful, and one retrieves the known expression [15] for the capacity. For the more general case of a channel with long-term memory, which corresponds to a Markov chain which does not converge… (More)

- Tony Dorlas, Ciara Morgan
- 2011

The strong capacity of a particular channel can be interpreted as a sharp limit on the amount of information which can be transmitted reliably over that channel. To evaluate the strong capacity of a particular channel one must prove both the direct part of the channel coding theorem and the strong converse for the channel. Here we consider the strong… (More)

In this paper we evaluate the entanglement assisted classical capacity of a class of quantum channels with long-term memory, which are convex combinations of memoryless channels. The memory of such channels can be considered to be given by a Markov chain which is aperiodic but not irreducible. This class of channels was introduced in [7], where its product… (More)

- ‹
- 1
- ›