The continuous limit of one dimensional discrete-time quantum walks with time- and space-dependent coefficients is investigated. A given quantum walk does not generally admit a continuous limit but some families (1-jets) of quantum walks do. All families (1-jets) admitting a continuous limit are identified. The continuous limit is described by a Dirac-like equation or, alternately, a couple of Klein-Gordon equations. Variational principles leading to these equations are also discussed, together with local invariance properties.
We show that discrete-time quantum walks on the line, $\mathbb{Z}$, behave as "the quantum tunneling". In particular, quantum walkers can tunnel through a double-well with the transmission probability $1$ under a mild condition. This is a property of quantum walks which cannot be seen on classical random walks, and is different from both linear spreadings and localizations.
We define the quaternionic quantum walk on a finite graph and investigate its properties. This walk can be considered as a natural quaternionic extension of the Grover walk on a graph. We explain the way to obtain all the right eigenvalues of a quaternionic matrix and a notable property derived from the unitarity condition for the quaternionic quantum walk. Our main results determine all the right eigenvalues of the quaternionic quantum walk by using complex eigenvalues of the quaternionic weighted matrix which is easily derivable from the walk. Since our derivation is owing to a quaternionic …
In this paper, we show that a variant of the discrete Burgers equation can be obtained through the Cole--Hopf transformation to a generalized discrete diffusion equation corresponding to the correlated random walk, which is also known as a generalization of the well known random walk. By applying the technique called ultradiscretization, we obtain the generalized ultradiscrete diffusion equation, the ultradiscrete Cole--Hopf transformation and a variant of the ultradiscrete Burgers equation. Moreover, we show that the resulting ultradiscrete Burgers equation yields cellular automata which can …
We introduce a family of discrete-time quantum walks, called two-partition model, based on two equivalence-class partitions of the computational basis, which establish the notion of local dynamics. This family encompasses most versions of unitary discrete-time quantum walks driven by two local operators studied in literature, such as the coined model, Szegedy's model, and the 2-tessellable staggered model. We also analyze the connection of those models with the two-step coined model, which is driven by the square of the evolution operator of the standard discrete-time coined walk. We prove for…
In this paper, we claim that a common underlying structure--a skeleton structure--is present behind discrete-time quantum walks (QWs) on a one-dimensional lattice with a homogeneous coin matrix. This skeleton structure is independent of the initial state, and partially, even of the coin matrix. This structure is best interpreted in the context of quantum-walk-replicating random walks (QWRWs), i.e., random walks that replicate the probability distribution of quantum walks, where this newly found structure acts as a simplified formula for the transition probability. Additionally, we construct a …
We construct concrete examples of time operators for both continuous and discrete-time homogeneous quantum walks, and we determine their deficiency indices and spectra. For a discrete-time quantum walk, the time operator can be self-adjoint if the time evolution operator has a non-zero winding number. In this case, its spectrum becomes a discrete set of real numbers.
Many models of beyond Standard Model physics connect flavor symmetry with a discrete group. Having this symmetry arise spontaneously from a gauge theory maintains compatibility with quantum gravity and can be used to systematically prevent anomalies. We minimize a number of Higgs potentials that break gauge groups to discrete symmetries of interest, and examine their scalar mass spectra.
We introduce a method to exactly generate bridge trajectories for discrete-time random walks, with arbitrary jump distributions, that are constrained to initially start at the origin and return to the origin after a fixed time. The method is based on an effective jump distribution that implicitly accounts for the bridge constraint. It is illustrated on various jump distributions and is shown to be very efficient in practice. In addition, we show how to generalize the method to other types of constrained random walks such as generalized bridges, excursions, and meanders.
