Viv Kendon

Thermal concurrence mixing in a one-dimensional Ising model

We investigate the entanglement arising naturally in a one-dimensional Ising chain in a magnetic field in an arbitrary direction. We find that for different temperatures, different orientations of the magnetic field give maximum entanglement. In the high-temperature limit, this optimal orientation corresponds to the magnetic field being perpendicular to the Ising orientation

Quantum walks in optical lattices

(z

Controlling discrete quantum walks: coins and initial states

direction). In the low-temperature limit, we find that varying the angle of the magnetic field very slightly from the z direction leads to a rapid rise in entanglement. We also find that the orientation of the magnetic field for maximum entanglement varies with the field amplitude. Furthermore, we have derived a simple rule for the mixing of concurrences (a measure of entanglement) due to the mixing of pure states satisfying certain conditions.

Universal quantum computation using the discrete-time quantum walk

We propose an experimental realization of discrete quantum walks using neutral atoms trapped in optical lattices. The quantum walk is taking place in position space and experimental implementation with present-day technology\char22{}even using existing setups\char22{}seems feasible. We analyze the influence of possible imperfections in the experiment and investigate the transition from a quantum walk to the classical random walk for increasing errors and decoherence.

Decoherence can be useful in quantum walks

In discrete time, coined quantum walks, the coin degrees of freedom offer the potential for a wider range of controls over the evolution of the walk than are available in the continuous time quantum walk. This paper explores some of the possibilities on regular graphs, and also reports periodic behaviour on small cyclic graphs.

QUANTUM WALKS ON GENERAL GRAPHS

A proof that continuous-time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by A. M. Childs [Phys. Rev. Lett. 102, 180501 (2009)]. We present a version based instead on the discrete-time quantum walk. We show that the discrete-time quantum walk is able to implement the same universal gate set and thus both discrete and continuous-time quantum walks are computational primitives. Additionally, we give a set of components on which the discrete-time quantum walk provides perfect state transfer.

3D spinodal decomposition in the inertial regime

We present a study of the effects of decoherence in the operation of a discrete quantum walk on a line, cycle, and hypercube. We find high sensitivity to decoherence, increasing with the number of steps in the walk, as the particle is becoming more delocalized with each step. However, the effect of a small amount of decoherence is to enhance the properties of the quantum walk that are desirable for the development of quantum algorithms. Specifically, we observe a highly uniform distribution on the line, a very fast mixing time on the cycle, and more reliable hitting times across the hypercube.

When does a physical system compute

Quantum walks, both discrete (coined) and continuous time, on a general graph of N vertices with undirected edges are reviewed in some detail. The resource requirements for implementing a quantum walk as a program on a quantum computer are compared and found to be very similar for both discrete and continuous time walks. The role of the oracle, and how it changes if more prior information about the graph is available, is also discussed.

Coined quantum walks on percolation graphs

We simulate late-stage coarsening of a 3D symmetric binary fluid using a lattice Boltzmann method. With reduced lengths and times l and t respectively (scales set by viscosity, density and surface tension) our data sets cover 1 100 we find clear evidence of Furukawas inertial scaling (l ~ t^{2/3}), although the crossover from the viscous regime (l ~ t) is very broad. Though it cannot be ruled out, we find no indication that Re is self-limiting (l ~ t^{1/2}) as proposed by M. Grant and K. R. Elder [Phys. Rev. Lett. 82, 14 (1999)].

Decoherence versus entanglement in coined quantum walks

Computing is a high-level process of a physical system. Recent interest in non-standard computing systems, including quantum and biological computers, has brought this physical basis of computing to the forefront. There has been, however, no consensus on how to tell if a given physical system is acting as a computer or not; leading to confusion over novel computational devices, and even claims that every physical event is a computation. In this paper, we introduce a formal framework that can be used to determine whether a physical system is performing a computation. We demonstrate how the abstract computational level interacts with the physical device level, in comparison with the use of mathematical models in experimental science. This powerful formulation allows a precise description of experiments, technology, computation and simulation, giving our central conclusion: physical computing is the use of a physical system to predict the outcome of an abstract evolution. We give conditions for computing, illustrated using a range of non-standard computing scenarios. The framework also covers broader computing contexts, where there is no obvious human computer user. We introduce the notion of a ‘computational entity’, and its critical role in defining when computing is taking place in physical systems.