相关论文: Quantum Random Walks and Time Reversal
Within the algebraic framework of Hopf algebras, random walks and associated diffusion equations (master equations) are constructed and studied for two basic operator algebras of Quantum Mechanics i.e the Heisenberg-Weyl algebra (hw) and…
Working withing the framework of Hopf algebras, a random walk and the associated diffusion equation are constructed on a space that is algebraically described as the merging of the real line algebra with the anyonic line algebra.…
We show how the Weyl quantum walk derived from principles in Ref. [1], enjoying a nonlinear Lorentz symmetry of dynamics, allows one to introduce Hopf algebras for position and momentum of the emerging particle. We focus on two special…
One can view quantum mechanics as a generalization of classical probability theory that provides for pairwise interference among alternatives. Adopting this perspective, we ``quantize'' the classical random walk by finding, subject to a…
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains.…
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science.…
Algebraic random walks (ARW) and quantum mechanical random walks (QRW) are investigated and related. Based on minimal data provided by the underlying bialgebras of functions defined on e. g the real line R, the abelian finite group Z_N, and…
The role of classical noise in quantum walks (QW) on integers is investigated in the form of discrete dichotomic random variable affecting its reshuffling matrix parametrized as a SU2)/U(1) coset element. Analysis in terms of quantum…
This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is on the connections and differences between the two types of…
Although quantum walks exhibit peculiar properties that distinguish them from random walks, classical behavior can be recovered in the asymptotic limit by destroying the coherence of the pure state associated to the quantum system. Here I…
A new model that maps a quantum random walk described by a Hadamard operator to a particular case of a random walk is presented. The model is represented by a Markov chain with a stochastic matrix, i.e., all the transition rates are…
We use simple deterministic dynamical systems as coins in studying quantum walks. These dynamical systems can be chosen to display, in the classical limit, a range of behaviors from the integrable to chaotic, or deterministically random. As…
Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…
Discrete time (coined) quantum walks are produced by the repeated application of a constant unitary transformation to a quantum system. By recasting these walks into the setting of periodic perturbations to an otherwise freely evolving…
This paper provides a primer in quantum field theory (QFT) based on Hopf algebra and describes new Hopf algebraic constructions inspired by QFT concepts. The following QFT concepts are introduced: chronological products, S-matrix, Feynman…
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…
For a continuous-time quantum walk on a line the variance of the position observable grows quadratically in time, whereas, for its classical counterpart on the same graph, it exhibits a linear, diffusive, behaviour. A quantum walk, thus,…
It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit…
We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases. This model enables us to study in detail…
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…