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.
We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., non-random) case, we allow any unitary operator, which commutes with translations, and couples only sites at a finite distance from each other. For example, a single step of the walk could be composed of any finite succession of different shift and coin operations in the usual sense, with any lattice dimension and coin dimension. We find ballistic scaling, and establish a direct method for computing the asymptotic distribution of position divided by time, namely as the distribution of the discrete time analog of the group velocity. In the random case, we let a Markov chain (control process) pick in each step one of finitely many unitary walks, in the sense described above. In ballistic order we find a non-random drift, which depends only on the mean of the control process and not on the initial state. In diffusive scaling the limiting distribution is asymptotically Gaussian, with a covariance matrix (diffusion matrix) depending on momentum. The diffusion matrix depends not only on the mean but also on the transition rates of the control process. In the non-random limit, i.e., when the coins chosen are all very close, or the transition rates of the control process are small, leading to long intervals of ballistic evolution, the diffusion matrix diverges. Our method is based on spatial Fourier transforms, and the first and second order perturbation theory of the eigenvalue 1 of the transition operator for each value of the momentum.Comment: 34 pages, 20 figure
We study reversible quantum cellular automata with the restriction that these are also Clifford operations. This means that tensor products of Pauli operators (or discrete Weyl operators) are mapped to tensor products of Pauli operators. Therefore Clifford quantum cellular automata are induced by symplectic cellular automata in phase space. We characterize these symplectic cellular automata and find that all possible local rules must be, up to some global shift, reflection invariant with respect to the origin. In the one dimensional case we also find that every uniquely determined and translationally invariant stabilizer state can be prepared from a product state by a single Clifford cellular automaton timestep, thereby characterizing these class of stabilizer states, and we show that all 1D Clifford quantum cellular automata are generated by a few elementary operations. We also show that the correspondence between translationally invariant stabilizer states and translationally invariant Clifford operations holds for periodic boundary conditions.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.