We present several protocols for reliable quantum state transfer through an XY spin chain. Among these is a simple two-spin encoding that achieves a remarkably high-fidelity transfer for an arbitrary quantum state. The fidelity of the transfer also decreases slowly with increasing chain length. Furthermore, the reliability can be increased by taking advantage of a local memory and/or confirming transfer using a second spin chain. The simplicity and high fidelity of the encoding makes this a candidate for near-future experiments including a test of the quantum speed limit.

We provide a class of initial encodings that can be sent with a high fidelity over an unmodulated, linear, XY spin chain. As an example, an average fidelity of 96% can be obtained using an 11-spin encoding to transmit a state over a chain containing 10 000 spins. An analysis of the magnetic-field dependence is given, and conditions for field optimization are provided.

The operator-sum decomposition (OS) of a mapping from one density matrix to another has many applications in quantum information science. To this mapping there corresponds an affine map which provides a geometric description of the density matrix in terms of the polarization vector representation. This has been thoroughly explored for qubits since the components of the polarization vector are measurable quantities (corresponding to expectation values of Hermitian operators) and also because it enables the description of map domains geometrically. Here we extend the OS-affine map correspondence to qudits, briefly discuss general properties of the map, the form for particular important cases, and provide several explicit results for qutrit maps. We use the affine map and a singular-value-like decomposition, to find positivity constraints that provide a symmetry for small polarization vector magnitudes (states which are closer to the maximally mixed state) which is broken as the polarization vector increases in magnitude (a state becomes more pure). The dependence of this symmetry on the magnitude of the polarization vector implies the polar decomposition of the map can not be used as it can for the qubit case. However, it still leads us to a connection between positivity and purity for general d-state systems. Contents

The interest in decoherence-free, or noiseless subsystems (DFS/NSs) of quantum systems is both of fundamental and practical interest. Understanding the invariance of a set of states under certain transformations is mutually associated with a better understanding of some fundamental aspects of quantum mechanics as well as the practical utility of invariant subsystems. For example, DFS/NSs are potentially useful for protecting quantum information in quantum cryptography and quantum computing as well as enabling universal computation. Here we discuss transformations which are compatible with a DFS/NS that is composed of d-state systems which protect against collective noise. They are compatible in the sense that they do not take the logical (encoded) states outside of the DFS/NS during the transformation. Furthermore, it is shown that the Hamiltonian evolutions derived here can be used to perform universal quantum computation on a three qudit DFS/NS. Many of the methods used in our derivations are directly applicable to a large variety of DFS/NSs. More generally, we may also state that these transformations are compatible with collective motions.

We investigate the quality of quantum state transfer through a uniformly coupled antiferromagnetic spin chain in a multi-excitation subspace. The fidelity of state transfer using multi-excitation channels is found to compare well with communication protocols based on the ground state of a spin chain with ferromagnetic interactions. Our numerical results support the conjecture that the fidelity of state transfer through a multi-excitation subspace only depends on the number of initial excitations present in the chain and is independent of the excitation ordering. Based on these results, we describe a communication scheme which requires little effort for preparation.