Related papers: One-dimensional discrete-time quantum walks with g…
The discrete-time quantum walk (QW) is a quantum version of the random walk (RW) and has been widely investigated for the last two decades. Some remarkable properties of QW are well known. For example, QW has a ballistic spreading, i.e., QW…
We study a spin-1/2-particle moving on a one dimensional lattice subject to disorder induced by a random, space-dependent quantum coin. The discrete time evolution is given by a family of random unitary quantum walk operators, where the…
Quantum networks are complex systems formed by the interaction among quantum processors through quantum channels. Analogous to classical computer networks, quantum networks allow for the distribution of quantum computation among quantum…
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…
A quantum computer, i.e. utilizing the resources of quantum physics, superposition of states and entanglement, could furnish an exponential gain in computing time. A simulation using such resources is called a quantum simulation. The…
In this Chapter, we present some interesting properties of quantum walks on the line. We concentrate our attention in the emergence of invariance and provide some insights into the ultimate origin of the observed behavior. In the first part…
Quantum networks are complex systems formed by the interaction among quantum processors through quantum channels. Analogous to classical computer networks, quantum networks allow for the distribution of quantum operations among quantum…
Exploring the quantum walk as a tool of generating various probability distributions and quantum entanglements is a topic of current interest. In the present work, we use extensive numerical simulations to investigate the influence of…
We demonstrate a quantum walk with time-dependent coin bias. With this technique we realize an experimental single-photon one-dimensional quantum walk with a linearly-ramped time-dependent coin flip operation and thereby demonstrate two…
We introduce a variation of the discrete time quantum walk, the nonreversal quantum walk, which does not step back onto a position which it has just occupied. This allows us to simulate a dimer and we achieve it by introducing a new type of…
The role of classical noise in quantum walks (QW) on integers is investigated in the form of discrete dichotomic random variable affecting its reshuffling matrix parametrized as a SU2)/U(1) coset element. Analysis in terms of quantum…
The quantum random walk has been much studied recently, largely due to its highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum walk on the line: the presence of decoherence…
We analyze a special class of 1-D quantum walks (QWs) realized using optical multi-ports. We assume non-perfect multi-ports showing errors in the connectivity, i.e. with a small probability the multi- ports can connect not to their nearest…
Discrete-time quantum walks are considered a counterpart of random walks and the study for them has been getting attention since around 2000. In this paper, we focus on a quantum walk which generates a probability distribution splitting to…
We address metrological problems where the parameter of interest is encoded in the internal degree of freedom of a discrete-time quantum walker, and provide evidence that coin dimensionality is a potential resource to enhance precision. In…
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 investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves…
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…
Quantum walks with memory(QWM) are a type of modified quantum walks that record the walker's latest path. As we know, only two kinds of QWM are presented up to now. It is desired to design more QWM for research, so that we can explore the…
We present a scheme for multi-bit quantum random number generation using a single qubit discrete-time quantum walk in one-dimensional space. Irrespective of the initial state of the qubit, quantum interference and entanglement of particle…