Related papers: Optical realization of one-dimensional generalized…
Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In…
Quantum walks are promising for information processing tasks because on regular graphs they spread quadratically faster than random walks. Static disorder, however, can turn the tables: unlike random walks, quantum walks can suffer Anderson…
The quantum walk (QW) is the term given to a family of algorithms governing the evolution of a discrete quantum system and as such has a founding role in the study of quantum computation. We contribute to the investigation of QW phenomena…
Quantum walks (QW) are of crucial importance in the development of quantum information processing algorithms. Recently, several quantum algorithms have been proposed to implement network analysis, in particular to rank the centrality of…
We consider quantum walks defined on arbitrary infinite graphs, parameterized by a family of scattering matrices attached to the vertices. Multiplying each scattering matrix by an i.i.d. random phase, we obtain a random scattering quantum…
A discrete-time quantum walk (QW) is essentially a unitary operator driving the evolution of a single particle on the lattice. Some QWs have familiar physics PDEs as their continuum limit. Some slight generalization of them (allowing for…
High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…
We report on the possibility of controlling quantum random walks with a step-dependent coin. The coin is characterized by a (single) rotation angle. Considering different rotation angles, one can find diverse probability distributions for…
Quantum walks, both discrete (coined) and continuous time, on a general graph of N vertices with undirected edges are reviewed in some detail. The resource requirements for implementing a quantum walk as a program on a quantum computer are…
Discrete-time quantum walks can be regarded as quantum dynamical simulators since they can simulate spatially discretized Schr\"{o}dinger, massive Dirac, and Klein-Gordon equations. Here, two different types of Fibonacci discrete-time…
Quantum walk represents one of the most promising resources for the simulation of physical quantum systems, and has also emerged as an alternative to the standard circuit model for quantum computing. Up to now the experimental…
The quantum walk is a quantum counterpart of the classical random walk that exhibits nonclassical behaviors and outperforms the classical random walk in various aspects. It has been known that a single particle can be propagated by a…
Integrated optics is an engineering solution proposed for exquisite control of photonic quantum information. Here we use silicon photonics and the linear combination of quantum operators scheme to realise a fully programmable two-qubit…
In this study we show a way of achieving the reverse evolution of n-dimensional quantum walks by introducing interventions on the coin degree of freedom during the forward progression of the coin-walker system. Only a single intervention is…
Cat states are coherent quantum superpositions of macroscopically distinct states and are useful for understanding the boundary between the classical and the quantum world. Due to their macroscopic nature, cat states are difficult to…
Discrete-time quantum walks with position-dependent coin operators have numerous applications. For a position dependence that is sufficiently smooth, it has been provided in Ref. [1] an approximate quantum-circuit implementation of the coin…
A quantum walk model which reflects the $2$-cell embedding on the orientable closed surface of a graph in the dynamics is introduced. We show that the scattering matrix is obtained by finding the faces on the underlying surface which have…
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…
Quantum walks have emerged as an interesting candidate for the implementation of quantum information processing protocols. Optical implementations of quantum walks have been demonstrated by various groups and some have received high-profile…