Related papers: Staggered quantum walks with superconducting micro…

Quantum random walk in a two-dimensional lattice with randomly distributed traps is investigated. Distributions of quantum walkers are evaluated dynamically for the cases of Hadamard, Fourier, and Grover coins, and quantum to classical…

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 elaborate on a model of quantum random walk proposed by Hillery et. al., and Jeong et. al., which uses the multiports for quantum "coin tossing". The dynamics of this model is analyzed for the case when the multiports are arranged on the…

In this paper, we study the graph-based semi-supervised learning for classifying nodes in attributed networks, where the nodes and edges possess content information. Recent approaches like graph convolution networks and attention mechanisms…

We find out a few ways to improve the realization of entanglement between the internal (spin) and external (position) degrees of freedom of a quantum particle, through the insertion of disordered time steps along a one-dimensional discrete…

Theoretical and applied studies of quantum walks are abundant in quantum science and technology thanks to their relative simplicity and versatility. Here we derive closed-form expressions for the probability distribution of quantum walks on…

We consider two independent quantum walks on separate lines augmented by partial or full swapping of coins after each step. For classical random walks, swapping or not swapping coins makes little difference to the random walk…

We investigate time-independent disorder on several two-dimensional discrete-time quantum walks. We find numerically that, contrary to claims in the literature, random onsite phase disorder, spin-dependent or otherwise, cannot localise the…

We scheme an efficient and reusable approach to quantum teleportation that allows cyclic teleportation of a two-qubit graph state around a quantum hamster wheel -- a ring of qubits entangled as a one-dimensional line prepared on the…

Entanglement generation in discrete time quantum walks is deemed to be another key property beyond the transport behaviors. The latter has been widely used in investigating the localization or topology in quantum walks. However, there are…

A spidernet is a graph obtained by adding large cycles to an almost regular tree and considered as an example having intermediate properties of lattices and trees in the study of discrete-time quantum walks on graphs. We introduce the…

We study the simulation of the topological phases in three subsequent dimensions with quantum walks. We are mainly focused on the completion of a table for the protocols of the quantum walk that could simulate different family of the…

We introduce an analytically treatable spin decoherence model for quantum walk on a line that yields the exact position probability distribution of an unbiased classical random walk at all-time scales. This spin decoherence model depicts a…

This work investigates a discrete-time quantum walk on a one-dimensional lattice driven by three entangled coins, each initialized via a Hadamard operator. The walker moves only when all three coins yield identical outcomes (HHH or TTT),…

Random walks are fundamental tools for analyzing complex networked systems, including social networks, biological systems, and communication infrastructures. While classical random walks focus on pairwise interactions, many real-world…

Many signals evolve in time as a stochastic process, randomly switching between states over discretely sampled time points. Here we make an explicit link between the underlying stochastic process of a signal that can take on a bounded…

Graph embedding has recently gained momentum in the research community, in particular after the introduction of random walk and neural network based approaches. However, most of the embedding approaches focus on representing the local…

In this work the quantum random walk search algorithm with walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is one qudit with arbitrary dimension. Monte Carlo simulations,…

A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. Here we…

We analyze the application of the history state formalism to quantum walks. The formalism allows one to describe the whole walk through a pure quantum history state, which can be derived from a timeless eigenvalue equation. It naturally…