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

Quantum walks with one-dimensional translational symmetry are important for quantum algorithms, where the speed-up of the diffusion speed can be reached if long-range couplings are added. Our work studies a scheme of a ring under the strong…

Quantum transport through disordered structures is inhibited by (Anderson) localization effects. The disorder can be either topological as in random networks or energetical as in the original Anderson model. In both cases the eigenstates of…

I introduce a new type of continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First I analyze the quantum snake walk on the line, and I…

We analyze continuous-time quantum and classical random walk on spidernet lattices. In the framework of Stieltjes transform, we obtain density of states, which is an efficiency measure for the performance of classical and quantum mechanical…

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…

Topological edge states are robust against symmetry-preserving perturbations and noise, making them promising for quantum information and computation, particularly in topological quantum computation through braiding operations of Majorana…

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…

We study the effect of backward scatterings in the tunneling at a point contact between the edges of a second level hierarchical fractional quantum Hall states. A universal scaling dimension of the tunneling conductance is obtained only…

We theoretically investigate quantum transport properties of quantum anomalous Hall bilayers, with arbitrary ratio of lattice constants, i.e., with lattice mismatch. In the simplest case of ratio 1 (but with different model parameters in…

Continuous time quantum walks provide an important framework for designing new algorithms and modelling quantum transport and state transfer problems. Often, the graph representing the structure of a problem contains certain symmetries that…

Continuous-time quantum walks (CTQWs) provide a valuable model for quantum transport, universal quantum computation and quantum spatial search, among others. Recently, the empowering role of new degrees of freedom in the Hamiltonian…

We propose a new family of discrete-spacetime quantum walks capable to propagate on any arbitrary triangulations. Moreover we also extend and generalize the duality principle introduced by one of the authors, linking continuous local…

In all existing quantum walk models, the assumption about a pre-existing fixed background causal structure is always made and has been taken for granted. Nevertheless, in this work we will get rid of this tacit assumption especially by…

Discrete-time quantum walks have been shown to simulate all known topological phases in one and two dimensions. Being periodically driven quantum systems, their topological description, however, is more complex than that of closed…

We study the quantum-mechanical transport on two-dimensional graphs by means of continuous-time quantum walks and analyse the effect of different boundary conditions (BCs). For periodic BCs in both directions, i.e., for tori, the problem…

We address the problem of routing quantum and classical information from one sender to many possible receivers in a network. By employing the formalism of quantum walks, we describe the dynamics on a discrete structure based on a complete…

Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…

This paper presents a novel methodology that transforms discrete-time quantum walks into a graph embedding technique, offering a fresh perspective on graph representation methods.Through mathematical manipulations, the approach of this…

The staggered quantum walk is a type of discrete-time quantum walk model without a coin which can be generated on a graph using particular partitions of the graph nodes. We design Hamiltonians for potential realization of the staggered…

A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the…