If a one-dimensional quantum lattice system is subject to one step of a reversible discrete-time dynamics, it is intuitive that as much "quantum information" as moves into any given block of cells from the left, has to exit that block to the right. For two types of such systems -namely quantum walks and cellular automata -we make this intuition precise by defining an index, a quantity that measures the "net flow of quantum information" through the system. The index supplies a complete characterization of two properties of the discrete dynamics. First, two systems S 1 , S 2 can be "pieced together", in the sense that there is a system S which acts like S 1 in one region and like S 2 in some other region, if and only if S 1 and S 2 have the same index. Second, the index labels connected components of such systems: equality of the index is necessary and sufficient for the existence of a continuous deformation of S 1 into S 2 . In the case of quantum walks, the index is integer-valued, whereas for cellular automata, it takes values in the group of positive rationals. In both cases, the map S → ind S is a group homomorphism if composition of the discrete dynamics is taken as the group law of the quantum systems. Systems with trivial index are precisely those which can be realized by partitioned unitaries, and the prototypes of systems with non-trivial index are shifts.

No abstract

The Dirac equation can be modelled as a quantum walk, with the quantum walk being: discrete in time and space (i.e. a unitary evolution of the wave-function of a particle on a lattice); homogeneous (i.e. translationinvariant and time-independent), and causal (i.e. information propagates at a bounded speed, in a strict sense). This quantum walk model was proposed independently by Succi and Benzi, Bialynicki-Birula and Meyer: we rederive it in a simple way in all dimensions and for hyperbolic symmetric systems in general. We then prove that for any time t, the model converges to the continuous solution of the Dirac equation at time t, i.e. the probability of observing a discrepancy between the model and the solution is an O(ε 2 ), with ε the discretization step. At the practical level, this result is of interest for the quantum simulation of relativistic particles. At the theoretical level, it reinforces the status of this quantum walk model as a simple, discrete toy model of relativistic particles.

We present a novel method for performing quantum state tomography for many-particle systems, which are particularly suitable for estimating the states in lattice systems such as of ultra-cold atoms in optical lattices. We show that the need to measure a tomographically complete set of observables can be overcome by letting the state evolve under some suitably chosen random circuits followed by the measurement of a single observable. We generalize known results about the approximation of unitary two-designs, i.e. certain classes of random unitary matrices, by random quantum circuits and connect our findings to the theory of quantum compressed sensing. We show that for ultra-cold atoms in optical lattices established experimental techniques such as optical super-lattices, laser speckles and time-of-flight measurements are sufficient to perform fully certified, assumption-free tomography. This is possible without the need to address single sites in any step of the procedure. Combining our approach with tensor network methods-in particular, the theory of matrix product states-we identify situations where the effort of reconstruction is even constant in the number of lattice sites, allowing, in principle, to perform tomography on large-scale systems readily available in present experiments.