Related papers: Comfortability of quantum walks on embedded graphs…
Consider a discrete-time quantum walk on the $N$-cycle subject to decoherence both on the coin and the position degrees of freedom. By examining the evolution of the density matrix of the system, we derive some new conclusions about the…
We consider to what extent quantum walks can constitute models of thermalization, analogously to how classical random walks can be models for classical thermalization. In a quantum walk over a graph, a walker moves in a superposition of…
We present an introduction to coined quantum walks on regular graphs, which have been developed in the past few years as an alternative to quantum Fourier transforms for underpinning algorithms for quantum computation. We then describe our…
We construct a new type of quantum walks on simplicial complexes as a natural extension of the well-known Szegedy walk on graphs. One can numerically observe that our proposing quantum walks possess linear spreading and localization as in…
We explore a discrete-time, coined quantum walk on a quantum network where the coherent superposition of walker-moves originates from the unitary interaction of the walker-coin with the qubit degrees of freedom in the quantum network. The…
Advances in recent years have made it possible to explore quantum dots as a viable technology for scalable quantum information processing. Charge qubits for example can be realized in the lowest bound states of coupled quantum dots and the…
In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step towards this objective, the following question is being…
We study the resonant scattering for discrete time quantum walks on graphs with some tails. In our arguments, we reduce the study of resonances to the perturbation of eigenvalues of a finite rank matrix associated with the internal graph.…
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…
Quantum walks are considered in a one-dimensional random medium characterized by static or dynamic disorder. Quantum interference for static disorder can lead to Anderson localization which completely hinders the quantum walk and it is…
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…
Quantum walks are roughly analogous to classical random walks, and like classical walks they have been used to find new (quantum) algorithms. When studying the behavior of large graphs or combinations of graphs it is useful to find the…
Quantum walks (QWs) represent pillars of quantum dynamics and information processing. They provide a powerful framework for simulating quantum transport, designing search algorithms, and enabling universal quantum computation. Several…
We consider a quantum walk model on a finite graph which has an interaction with the outside. Here a quantum walker from the outside penetrates the graph and also a quantum walker in the graph goes out to the outside at every time step.…
In the present paper, we study the continuous-time quantum walk on quotient graphs. On such graphs, there is a straightforward reduction of problem to a subspace that can be considerably smaller than the original one. Along the lines of…
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…
We propose a novel implementation of discrete time quantum walks for a neutral atom in an array of optical microtraps or an optical lattice. We analyze a one-dimensional walk in position space, with the coin, the additional qubit degree of…
This dissertation presents investigations on dynamics of discrete-time quantum walk and some of its applications. Quantum walks has been exploited as an useful tool for quantum algorithms in quantum computing. Beyond quantum computational…
We study quantum transport on finite discrete structures and we model the process by means of continuous-time quantum walks. A direct and effective comparison between quantum and classical walks can be attained based on the average…
The evolution of a many-particle system on a one-dimensional lattice, subjected to a quantum walk can cause spatial entanglement in the lattice position, which can be exploited for quantum information/communication purposes. We demonstrate…