Related papers: Driven Gaussian quantum walks
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the nowadays widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in…
A quantum walk, \emph{i.e.}, the quantum evolution of a particle on a graph, is termed \emph{scalar} if the internal space of the moving particle (often called the coin) has a dimension one. Here, we study the existence of scalar quantum…
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard…
Quantum walks are powerful kernels in quantum computing protocols that possess strong capabilities in speeding up various simulation and optimisation tasks. One striking example is given by quantum walkers evolving on glued trees for their…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…
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.…
Quantum walk represents one of the most promising resources for the simulation of physical quantum systems, and has also emerged as an alternative to the standard circuit model for quantum computing. Up to now the experimental…
The quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range…
In some of the earliest work on quantum mechanical computers, Feynman showed how to implement universal quantum computation by the dynamics of a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is…
The formalism of continuous-time quantum walks on graphs has been widely used in the study of quantum transport of energy and information, as well as in the development of quantum algorithms. In experimental settings, however, there is…
Quantum random walks have received much interest due to their non-intuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable…
Quantum walks subject to decoherence generically suffer the loss of their genuine quantum feature, a quadratically faster spreading compared to classical random walks. This intuitive statement has been verified analytically for certain…
The classicalization of a decoherent discrete-time quantum walk on a line or an n-cycle can be demonstrated in various ways that do not necessarily provide a geometry-independent description. For example, the position probability…
Quantum billiards have been simulated so far in many ways, but in this work a new aproximation is considerated. This study is based on the quantum billiard already obtained by others authors via a tensor product of two 1-D quantum walks .…
We analyze the solution of the coined quantum walk on a line. First, we derive the full solution, for arbitrary unitary transformations, by using a new approach based on the four "walk fields" which we show determine the dynamics. The…
Quantum Non-Gaussian states are considered as a useful resource for many tasks in quantum information processing, from quantum metrology and quantum sensing to quantum communication and quantum key distribution. Another useful tool that is…
Quantum walks are counterparts of classical random walks. They spread faster, which can be exploited in information processing tasks, and constitute a versatile simulation platform for many quantum systems. Yet, some of their properties can…
Simulating quantum mechanics is known to be a difficult computational problem, especially when dealing with large systems. However, this difficulty may be overcome by using some controllable quantum system to study another less controllable…
Quantum walks and random walks bear similarities and divergences. One of the most remarkable disparities affects the probability of finding the particle at a given location: typically, almost a flat function in the first case and a…
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. Searching in this mathematical framework has interested the community since a long time. However, most results consider spatial search…