Quantum random walk is the quantum counterpart of a classical random walk. The classical
random walk concept has long been used as a computational framework for designing …

We present an introductory overview of the use of spin chains as quantum wires, which has
recently developed into a topic of lively interest. The principal motivation is in connecting …

We review recent developments in the physics of ultracold atomic and molecular gases in
optical lattices. Such systems are nearly perfect realisations of various kinds of Hubbard …

A proof that continuous-time quantum walks are universal for quantum computation, using
unweighted graphs of low degree, has recently been presented by AM Childs [Phys. Rev …

We review the subject of perfect state transfer—how one designs the (fixed) interactions of a
chain of spins so that a quantum state, initially inserted on one end of the chain, is perfectly …

These are exciting times for quantum physics as new quantum technologies are expected to
soon transform computing at an unprecedented level. Simultaneously network science is …

If X is a graph with adjacency matrix A, then we define H (t) to be the operator exp (itA). We
say that we have perfect state transfer in X from the vertex u to the vertex v at time τ if the uv …

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 …

Transferring quantum states efficiently between distant nodes of an information processing
circuit is of paramount importance for scalable quantum computing. We report on an …

The transfer of data is a fundamental task in information systems. Microprocessors contain
dedicated data buses that transmit bits across different locations and implement …