Related papers: Full state revivals in higher dimensional quantum …
Quantum walks function as essential means to implement quantum simulators, allowing one to study complex and often directly inaccessible quantum processes in controllable systems. In this contribution, the notion of a driven Gaussian…
We advance the previous studies of quantum walks on the line with two coins. Such four-state quantum walks driven by a three-direction shift operator may have nonzero stationary distributions (localization), thus distinguishing themselves…
In this paper, we study the recurrence of Open Quantum Walks induced by finite-dimensional coins on the line ($\mathbb{Z}$) and on the grid ($\mathbb{Z}^2$). Two versions are considered: discrete-time open quantum walks (OQW) and…
It is known that there exist a limited number of analytic potentials with the unusual property that any bound quantum state therein will be periodic in time. This is known as a perfect quantum state revival. Examples of such potentials are…
We discuss the model of a one-dimensional, discrete-time walk on a line with spatial heterogeneity in the form of a variable set of ultrametric barriers. Inspired by the homogeneous quantum walk on a line, we develop a formalism by which…
Quantum Random Walks, which have drawn much attention over the past few decades for their distinctly non-classical behavior, is a promising subfield within Quantum Computing. Theoretical framework and applications for these walks have seen…
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…
Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of study for devising quantum algorithms for long-standing open problems as well as those arising in the field of quantum computing. In the…
In this work we introduce discrete-time quantum walks in state space, more precisely on Fock-state lattices. Fock-state lattices provide a natural and clean setting for implementing lattice models, particularly in quantum optical systems.…
In recent years, there has been an emerging trend of combining two innovations in computer science and physics to achieve better computation capability. Exploring the potential of quantum computation to achieve highly efficient performance…
We analyze the quantum walk on a cycle using discrete Wigner functions as a way to represent the states and the evolution of the walker. The method provides some insight on the nature of the interference effects that make quantum and…
Quantum walks determined by the coin operator on graphs have been intensively studied. The typical examples of coin operator are the Grover and Fourier matrices. The periodicity of the Grover walk is well investigated. However, the…
The evolution of a walker in standard "Discrete-time Quantum Walk (DTQW)" is determined by coin and shift unitary operators. The conditional shift operator shifts the position of the walker to right or left by unit step size while the…
We study the state transfer through quantum walks placed on a bounded one-dimensional path. We first consider continuous-time quantum walks from a Gaussian state. We find such a state when superposing centered on the starting and antipodal…
We analyze the recurrence probability (P\'olya number) for d-dimensional unbiased quantum walks. A sufficient condition for a quantum walk to be recurrent is derived. As a by-product we find a simple criterion for localisation of quantum…
In most widely discussed discrete time quantum walk model, after every unitary shift operator, the particle evolves into the superposition of position space and settles down in one of its basis states, loosing entanglement in the coin space…
High-fidelity quantum state transfer is critical for quantum communication and scalable quantum computation. Current quantum state transfer algorithms on the complete bipartite graph, which are based on discrete-time quantum walk search…
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing…
Search and state transfer between hubs, i.e. fully connected vertices, on otherwise arbitrary connected graph is investigated. Motivated by a recent result of Razzoli et al. (J. Phys. A: Math. Theor. 55, 265303 (2022)) on universality of…