We show how to construct discrete-time quantum walks on directed, Eulerian graphs. These graphs have tails on which the particle making the walk propagates freely, and this makes it possible to analyze the walks in terms of scattering theory. The probability of entering a graph from one tail and leaving from another can be found from the scattering matrix of the graph. We show how the scattering matrix of a graph that is an automorphic image of the original is related to the scattering matrix of the original graph, and we show how the scattering matrix of the reverse graph is related to that of the original graph. Modifications of graphs and the effects of these modifications are then considered. In particular we show how the scattering matrix of a graph is changed if we remove two tails and replace them with an edge or cut an edge and add two tails. This allows us to combine graphs, that is if we connect two graphs we can construct the scattering matrix of the combined graph from those of its parts. Finally, using these techniques, we show how two graphs can be compared by constructing a larger larger graph in which the two original graphs are in parallel, and performing a quantum walk on the larger graph. This is a kind of quantum walk interferometry.
In this paper, we consider the scattering theory for a one-dimensional quantum walk with impurities which make reflections and transmissions. We focus on an explicit expression of the scattering operator. Our construction of the formula is based on the counting paths of quantum walkers. The Fourier transform of the scattering operator gives an explicit formula of the scattering matrix which is deeply related with the resonant-tunneling for quantum walks.
We introduce history-dependent discrete-time quantum random walk models by adding uncorrelated memory terms and also by modifying Hamiltonian of the walker to include couplings with memory-keeping agents. We next numerically study the correlation effects in these models. We also propose a correlation exponent as a relevant and promising tool for investigation of correlation or memory (hence non-Markovian) effects. Our analysis can easily be applied to more realistic models in which different regimes may emerge because of competition between different underlying physical mechanisms.
A randomly walking quantum particle searches in Grover's $Θ(\sqrt{N})$ iterations for a marked vertex on the complete graph of $N$ vertices by repeatedly querying an oracle that flips the amplitude at the marked vertex, scattering by a "coin" flip, and hopping. Physically, however, potential energy barriers can hinder the hop and cause the search to fail, even when the amplitude of not hopping decreases with $N$. We correct for these errors by interpreting the quantum walk search as an amplitude amplification algorithm and modifying the phases applied by the coin flip and oracle such that the …
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 hypercube. If the hypercube is attached to semi-infinite lines, then it can act as a scattering potential, which can be reduced to a quantum walk on the line with non-unitary evolution. We also show how this model can be implemented using simple quantum gates.
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through the graph, to the other. The particle propagates freely on the half lines but is scattered at each vertex in the original graph. The probability of starting on one line and reaching the other after n steps can be expressed in terms of the transmission amplitude for the graph. An example is presented.
We address the scattering of a quantum particle by a one-dimensional barrier potential over a set of discrete positions. We formalize the problem as a continuous-time quantum walk on a lattice with an impurity, and use the quantum Fisher information as a mean to quantify the maximal possible accuracy in the estimation of the height of the barrier. We introduce suitable initial states of the walker and derive the reflection and transmission probabilities of the scattered state. We show that while the quantum Fisher information is affected by the width and central momentum of the initial wave pa…
The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at locating a specially marked vertex on square grid graphs, consisting of N$^2$ nodes. We simulate these quantum systems using classical computational methods, and find that the probability distributions that arise are very favorable for a hybrid quantum / classical algorithm. We then examine how this hybrid algorithm handles varying types of randomness in both location of the special vertex and later random obstacles pla…
Quantum walks in atomic systems, owing to their continuous nature, are especially well-suited for the simulation of many-body physics and can potentially offer an exponential speedup in solving certain black box problems. Photonics offers an alternate route to simulating such nonclassical behavior in a more robust platform. However, in photonic implementations to date, an increase to the depth of a continuous quantum walk requires modifying the footprint of the system. Here we report continuous walks of a two-photon quantum frequency comb with entanglement across multiple dimensions. The coupl…
In recent years it became possible to align molecules in free space using ultrashort laser pulses. Here we explore two schemes for controlling molecule-surface scattering process, which are based on the laser-induced molecular alignment. In the first scheme, a single ultrashort non-resonant laser pulse is applied to a molecular beam hitting the surface. This pulse modifies the angular distribution of the incident molecules, and causes the scattered molecules to rotate with a preferred sense of rotation (clockwise or counter-clockwise). In the second scheme, two properly delayed laser pulses ar…
We systematically investigated perfect state transfer between antipodal nodes of discrete time quantum walks on variants of the cycles C_4, C_6 and C_8 for three choices of coin operator. Perfect state transfer was found, in general, to be very rare, only being preserved for a very small number of ways of modifying the cycles. We observed that some of our useful modifications of C_4 could be generalised to an arbitrary number of nodes, and present three families of graphs which admit quantum walks with interesting dynamics either in the continuous time walk, or in the discrete time walk for ap…
The aim of this article is to relate the discrete quantum walk on $\mathbb{Z}$ with the continuous Schrödinger operator on $\mathbb{R}$ in the scattering problem. Each point of $\mathbb{Z}$ is associated with a barrier of the potential, and the coin operator of the quantum walk is determined by the transfer matrix between bases of WKB solutions on the classically allowed regions of both sides of the barrier. This correspondence enables us to represent each entry of the scattering matrix of the Schrödinger operator as a countable sum of probability amplitudes associated with the paths of the qu…
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that its behavior there is analogous to free propagation We are interested in how many steps it will take the particle, starting on one tail and propagating through the graph (where its propagation is not free), to emerge onto the other tail. The probability to make such a walk in n steps and the hitting time for such a walk can be expressed in terms of the tran…
We investigate the behavior of coherence in scattering quantum walk search on complete graph under the condition that the total number of vertices of the graph is greatly larger than the marked number of vertices we are searching, $N \gg v$. We find that the consumption of coherence represents the increase of the success probability for the searching,also the consumption of coherence is related to the efficiency of the algorithm represented by oracle queries.If no coherence is consumed, the efficiency of the algorithm will be the same as the classical blind search, implying that coherence is r…
We analyze the realization of a quantum-walk search algorithm in a passive, linear optical network. The specific model enables us to consider the effect of realistic sources of noise and losses on the search efficiency. Photon loss uniform in all directions is shown to lead to the rescaling of search time. Deviation from directional uniformity leads to the enhancement of the search efficiency compared to uniform loss with the same average. In certain cases even increasing loss in some of the directions can improve search efficiency. We show that while we approach the classical limit of the gen…
We perform the scattering analysis of the evolution operator of quantum walks with an anisotropic coin, and we prove a weak limit theorem for their asymptotic velocity. The quantum walks that we consider include one-defect models, two-phase quantum walks, and topological phase quantum walks as special cases. Our analysis is based on an abstract framework for the scattering theory of unitary operators in a two-Hilbert spaces setting, which is of independent interest.
One-dimensional discrete-time quantum walks show a rich spectrum of topological phases that have so far been exclusively analysed in momentum space. In this work we introduce an alternative approach to topology which is based on the scattering matrix of a quantum walk, adapting concepts from time-independent systems. For gapped quantum walks, topological invariants at quasienergies 0 and π probe directly the existence of protected boundary states, while quantum walks with a non-trivial quasienergy winding have a discrete number of perfectly transmistting unidirectional modes. Our classificatio…
A slight modification of one axiom of quantum theory changes a reversible theory into a time asymmetric theory. Whereas the standard Hilbert space axiom does not distinguish mathematically between the space of states (in-states of scattering theory) and the space of observables (out-``states'' of scattering theory) the new axiom associates states and observables to two different Hardy subspaces which are dense in the same Hilbert space and analytic in the lower and upper complex energy plane, respectively. As a consequence of this new axiom the dynamical equations (Schrödinger or Heisenberg) i…
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 response of a subgraph to signals of different frequencies. In so doing we can replace an entire subgraph with a single vertex with frequency dependent scattering coefficients. In this paper a simple technique for quickly finding the scattering coefficients of any quantum graph will be presented. These scattering coefficients can be expressed entirely in terms o…
We study large time behavior of quantum walks (QW) with self-dependent coin. In particular, we show scattering and derive the reproducing formula for inverse scattering in the weak nonlinear regime. The proof is based on space-time estimate of (linear) QW such as Strichartz estimate. Such argument is standard in the study of nonlinear Schrödinger equations but it seems to be the first time to be applied to QW. We also numerically study the dynamics of QW and observe soliton like solutions.
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 dynamics on a two-dimensional lattice composed of superconducting microwave resonators connected with tunable couplings. The naive generalization of the one-dimensional staggered dynamics generates two uncoupled one-dimensional quantum walks thus more complex partitions need to be employed. However, by analyzing the coherence of the dynamics, we show that the qu…
We study hybrid atom-molecule quantum walks in one-dimensional optical lattices with two interacting bosonic atoms which may be converted into a molecule. The hybrid atom-molecule energy bands include a continuum band and two isolated bands, which respectively correspond to scattering states and dressed bound states (DBS's). Because of the atom-molecule coupling, the DBS's may appear even in the absence of atom-atom interaction. From an initial state of two atoms occupying the same site, in addition to independent quantum walks which correspond to scattering states, correlated quantum walks ap…
This paper introduces a new notion of quantum recursion of which the control flow of the computation is quantum rather than classical as in the notions of recursion considered in the previous studies of quantum programming. A typical example is recursive quantum walks, which are obtained by slightly modifying the construction of the ordinary quantum walks. The operational and denotational semantics of quantum recursions are defined by employing the second quantisation method, and they are proved to be equivalent.
In this work a Green function approach for scattering quantum walks is developed. The exact formula has the form of a sum over paths and always can be cast into a closed analytic expression for arbitrary topologies and position dependent quantum amplitudes. By introducing the step and path operators, it is shown how to extract any information about the system from the Green function. The method relevant features are demonstrated by discussing in details an example, a general diamond-shaped graph.
We study scattering quantum walks on highly symmetric graphs and use the walks to solve search problems on these graphs. The particle making the walk resides on the edges of the graph, and at each time step scatters at the vertices. All of the vertices have the same scattering properties except for a subset of special vertices. The object of the search is to find a special vertex. A quantum circuit implementation of these walks is presented in which the set of special vertices is specified by a quantum oracle. We consider the complete graph, a complete bipartite graph, and an $M$-partite graph…
In this paper, we analyze the potential for new types of searches using the formalism of scattering random walks on Quantum Computers. Given a particular type of graph consisting of nodes and connections, a "Tree Maze", we would like to find a selected final node as quickly as possible, faster than any classical search algorithm. We show that this can be done using a quantum random walk, both exactly through numerical calculations as well as analytically using eigenvectors and eigenvalues of the quantum system.
In this paper, we introduce a quantum walk whose local scattering at each vertex is denoted by a unitary circulant matrix; namely the circulant quantum walk. We also introduce another quantum walk induced by the circulant quantum walk; namely the optical quantum walk, whose underlying graph is a $2$-regular directed graph and obtained by blowing up the original graph in some way. We propose a design of an optical circuit which implements the stationary state of the optical quantum walk. We show that if the induced optical quantum walk does not have $+1$ eigenvalue, then the stationary state of…
We show how a quantum walk can be used to find a marked edge or a marked complete subgraph of a complete graph. We employ a version of a quantum walk, the scattering walk, which lends itself to experimental implementation. The edges are marked by adding elements to them that impart a specific phase shift to the particle as it enters or leaves the edge. If the complete graph has N vertices and the subgraph has K vertices, the particle becomes localized on the subgraph in O(N/K) steps. This leads to a quantum search that is quadratically faster than a corresponding classical search. We show how …
Multi-dimensional quantum walks can exhibit highly non-trivial topological structure, providing a powerful tool for simulating quantum information and transport systems. We present a flexible implementation of a 2D optical quantum walk on a lattice, demonstrating a scalable quantum walk on a non-trivial graph structure. We realized a coherent quantum walk over 12 steps and 169 positions using an optical fiber network. With our broad spectrum of quantum coins we were able to simulate the creation of entanglement in bipartite systems with conditioned interactions. Introducing dynamic control all…
In some of the earliest work on quantum mechanical computers, Feynman showed how to implement universal quantum computation by the dynamics of a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to be a sparse matrix with all entries equal to 0 or 1, i.e., the adjacency matrix of a low-degree graph. Thus quantum walk can be regarded as a universal computational primitive, with any desired quantum computation encoded entirely in some underlying graph. The main idea of the construction is to implement quantum gates by scattering processes.
Experimental observations of quantum walks in one dimension have provided many exciting applications in quantum computing, while recent theoretical investigation of single phase defect in these system points towards interesting phenomena associated with bounds states. Here we obtain analytical solutions of quantum walk with a general quantum coin in one dimension with multiple defects, with new prediction on the condition for zero reflectance for scattering state, and the existence of an analogy to the Ramsauer effect for multiple defects. We also show the transition from the zero reflectance …
A Quantum Walk Inspired Qubit Lattice Algorithm for Simulating Electromagnetic Wave Propagation and Scattering in Conservative and Dissipative Magnetized Plasmas
In the setting of networked computation, data security can be a significant concern. Here we consider the problem of allowing a server to remotely manipulate client supplied data, in such a way that both the information obtained by the client about the server's operation and the information obtained by the server about the client's data are significantly limited. We present a protocol for achieving such functionality in two closely related models of restricted quantum computation -- the Boson sampling and quantum walk models. Due to the limited technological requirements of the Boson scatterin…
We study the effects of long-range hopping and long-range inter-particle interactions on quantum walk of hard-core bosons in ideal and disordered one-dimensional lattices. We find that the range of hopping has a much more significant effect on the particle correlation dynamics than the range of interactions. We illustrate that long-range hopping makes the correlation diagrams asymmetric with respect to the sign of the interaction and examine the relative role of repulsive and attractive interactions on the dynamics of scattering by isolated impurities and Anderson localization in dis- ordered …
Quantum walks constitute a versatile platform for simulating transport phenomena on discrete graphs including topological material properties while providing a high control over the relevant parameters at the same time. To experimentally access and directly measure the topological invariants of quantum walks we implement the scattering scheme proposed by Tarasinski et al.[Phys. Rev. A 89, 042327 (2014)] in a photonic time multiplexed quantum walk experiment. The tunable coin operation provides opportunity to reach distinct topological phases, and accordingly to observe the corresponding topolo…
Discrete-time photonic quantum walks on a synthetic lattice, where both spatial and temporal evolution of light is discretized, have provided recently a fascinating platform for the observation of a wealth of non-Hermitian physical phenomena and for the control of light scattering in complex media. A rather open question is whether invisible potentials, analogous to the ones known for continuous optical media, do exist in such discretized systems. Here it is shown that, under certain conditions, slowly-drifting Kramers-Kronig potentials behave as invisible potentials in discrete-time photonic …
We consider the Grover walk on the infinite graph in which an internal finite subgraph receives the inflow from the outside with some frequency and also radiates the outflow to the outside. To characterize the stationary state of this system, which is represented by a function on the arcs of the graph, we introduce a kind of discrete gradient operator twisted by the frequency. Then we obtain a circuit equation which shows that (i) the stationary state is described by the twisted gradient of a potential function which is a function on the vertices; (ii) the potential function satisfies the Pois…
We define resonances for finitely perturbed quantum walks as poles of the scattering matrix in the lower half plane. We show a resonance expansion which describes the time evolution in terms of resonances and corresponding Jordan chains. In particular, the decay rate of the survival probability is given by the imaginary part of resonances and the multiplicity. We prove generic simplicity of the resonances, although there are quantum walks with multiple resonances.
Coin and scattering are the two major formulations for discrete quantum walks models, each believed to have its own advantages in different applications. Although they are related in some cases, it was an open question their equivalence in arbitrary topologies. Here we present a general construction for the two models for any graph and also for position dependent transition amplitudes. We then prove constructively their unitary equivalence. Defining appropriate projector operators, we moreover show how to obtain the probabilities for one model from the evolution of the other.
In the present paper, the first in a series of two, we propose a model of universal quantum computation using a fermionic/bosonic multi-particle continuous-time quantum walk with two internal states (e.g., the spin-up and down states of an electron). A dual-rail encoding is adopted to convert information: a single-qubit is represented by the presence of a single quantum walker in either of the two parallel paths. We develop a roundabout gate that moves a walker from one path to the next, either clockwise or counterclockwise, depending on its internal state. It can be realized by a single-parti…
We propose a realistic scheme to implement discrete-time quantum walks in the Brillouin zone (i.e., in quasimomentum space) with a spinor Bose-Einstein condensate. Relying on a static optical lattice to suppress tunneling in real space, the condensate is displaced in quasimomentum space in discrete steps conditioned upon the internal state of the atoms, while short pulses periodically couple the internal states. We show that tunable twisted boundary conditions can be implemented in a fully natural way by exploiting the periodicity of the Brillouin zone. The proposed setup does not suffer from …
We investigate continuous-time quantum walks of two indistinguishable particles [bosons, fermions or hard-core bosons (HCBs)] in one-dimensional lattices with nearest-neighbor interactions. The results for two HCBs are well consistent with the recent experimental observation of two-magnon dynamics [Nature 502, 76 (2013)]. The two interacting particles can undergo independent- and/or co-walking depending on both quantum statistics and interaction strength. Two strongly interacting particles may form a bound state and then co-walk like a single composite particle with statistics-dependent walk s…
