Related papers: Edge-state enhanced transport in a 2-dimensional q…

There are few known exponential speedups for quantum algorithms and these tend to fall into even fewer families. One speedup that has mostly resisted generalization is the use of quantum walks to traverse the welded-tree graph, due to…

We examine quantum transport in periodic quantum graphs with a vertex coupling non-invariant with respect to time reversal. It is shown that the graph topology may play a decisive role in the conductivity properties illustrating this claim…

We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum-walk features such as localization that starkly distinguishes classical from quantum…

We study topological transport in the steady state of a quantum particle hopping on a one-dimensional lattice in the presence of dissipation. The model exhibits a rich phase structure, with the average particle velocity in the steady state…

We establish a general mechanism for highly efficient quantum transport through finite, disordered 3D networks. It relies on the interplay of disorder with centro-symmetry and a dominant doublet spectral structure, and can be controlled by…

We study transport within a spatially heterogeneous one-dimensional quantum walk with a combination of hierarchical and random barriers. Recent renormalization group calculations for a spatially disordered quantum walk with a regular…

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,…

We propose a robust and efficient way to store and transport quantum information via one-dimensional discrete time quantum walks. We show how to attain an effective dispersionless wave packet evolution using only two types of local unitary…

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…

Perfect state transfer between two marked vertices of a graph by means of discrete-time quantum walk is analyzed. We consider the quantum walk search algorithm with two marked vertices, sender and receiver. It is shown by explicit…

Continuous-time quantum walks provide a natural framework to tackle the fundamental problem of finding a node among a set of marked nodes in a graph, known as spatial search. Whether spatial search by continuous-time quantum walk provides a…

A quantum finite multi-barrier system, with a periodic potential, is considered and exact expressions for its plane wave amplitudes are obtained using the Transfer Matrix method [10]. This quantum model is then associated with a stochastic…

In this paper, we study the quantum walk on the 2D Penrose Lattice, which is intermediate between periodic and disordered structure. Quantum walk on Penrose Lattice is less efficient in transport comparing to the regular lattices. By…

We present a generalized definition of discrete-time quantum walks convenient for capturing a rather broad spectrum of walker's behavior on arbitrary graphs. It includes and covers both: the geometry of possible walker's positions with…

Here, we employ a numerical approach to investigate the transport and conductance characteristics of a quantum point contact. A quantum point contact is a narrow constriction of a width comparable to the electron wavelength defined in a…

We consider the quantum mechanical transport of (coherent) excitons on small-world networks (SWN). The SWN are build from a one-dimensional ring of N nodes by randomly introducing B additional bonds between them. The exciton dynamics is…

We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a…

Topological edge states are recently attracting intense interest due to their robustness in the presence of disorder and defects. However, most approaches for manipulating such states require global modulations of the system's Hamiltonian.…

We outline a theory of symmetry protected topological phases of one-dimensional quantum walks. We assume spectral gaps around the symmetry-distinguished points +1 and -1, in which only discrete eigenvalues are allowed. The phase…

Random walk algorithms are crucial for sampling and approximation problems in statistical physics and theoretical computer science. The mixing property is necessary for Markov chains to approach stationary distributions and is facilitated…