Entanglement in coined quantum walks on regular graphs
Ivens Carneiro, Meng Loo, Xibai Xu, Mathieu Girerd, Viv Kendon, Peter L. Knight
备注：
23 pages, many eps embedded figures; v2 published version: better quality figures on journal website (open access) at http://www.iop.org/EJ/abstract/1367-2630/7/1/156/; v3 corrects errors in fig 2 and related text (thanks to Annette Gattner and Mostafa Annabestani)
Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum algorithms. Here we use numerical simulations to study the properties of discrete, coined quantum walks. We investigate the variation in the entanglement between the coin and the position of the particle by calculating the entropy of the reduced density matrix of the coin. We consider both dynamical evolution and asymptotic limits for coins of dimensions from two to eight on regular graphs. For low coin dimensions, quantum walks which spread faster (as measured by the mean square deviation of their distribution from uniform) also exhibit faster convergence towards the asymptotic value of the entanglement between the coin and particle's position. For high-dimensional coins, the DFT coin operator is more efficient at spreading than the Grover coin. We study the entanglement of the coin on regular finite graphs such as cycles, and also show that on complete bipartite graphs, a quantum walk with a Grover coin is always periodic with period four. We generalize the 'glued trees' graph used by Childs et al (2003 Proc. STOC, pp 5968) to higher branching rate (fan out) and verify that the scaling with branching rate and with tree depth is polynomial.
The connection between coined and continuous-time quantum walk models has been addressed in a number of papers. In most of those studies, the continuous-time model is derived from coined quantum walks by employing dimensional reduction and taking appropriate limits. In this work, we produce the evolution of a coined quantum walk on a generic graph using a continuous-time quantum walk on a larger graph. In addition to expanding the underlying structure, we also have to switch on and off edges during the continuous-time evolution to accommodate the alternation between the shift and coin operator…
We give a characterization of the line digraph of a regular digraph. We make use of the characterization, to show that the underlying digraph of a coined quantum random walk is a line digraph. We remark the connection between line digraphs and in-split graphs in symbolic dynamics.
Coined quantum walks may be interpreted as the motion in position space of a quantum particle with a spin degree of freedom; the dynamics are determined by iterating a unitary transformation which is the product of a spin transformation and a translation conditional on the spin state. Coined quantum walks on the d-dimensional lattice can be treated as special cases of coined quantum walks on d-dimensional Euclidean space. We study quantum walks on d-dimensional Euclidean space and prove that the sequence of rescaled probability distributions in position space associated to the unitary evolutio…
Motivated by the recent work of Patel et al., this paper clarifies a connection between coined quantum walks and quantum cellular automata in a general setting. As a consequence, their result is naturally derived from the connection.
Szegedy's quantum walk is a quantization of a classical random walk or Markov chain, where the walk occurs on the edges of the bipartite double cover of the original graph. To search, one can simply quantize a Markov chain with absorbing vertices. Recently, Santos proposed two alternative search algorithms that instead utilize the sign-flip oracle in Grover's algorithm rather than absorbing vertices. In this paper, we show that these two algorithms are exactly equivalent to two algorithms involving coined quantum walks, which are walks on the vertices of the original graph with an internal deg…
We analyze the equivalence between discrete-time coined quantum walks and Szegedy's quantum walks. We characterize a class of flip-flop coined models with generalized Grover coin on a graph $Γ$ that can be directly converted into Szegedy's model on the subdivision graph of $Γ$ and we describe a method to convert one model into the other. This method improves previous results in literature that need to use the staggered model and the concept of line graph, which are avoided here.
We study time-dependent discrete-time quantum walks on the one-dimensional lattice. We compute the limit distribution of a two-period quantum walk defined by two orthogonal matrices. For the symmetric case, the distribution is determined by one of two matrices. Moreover, limit theorems for two special cases are presented.
We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a quantum walk where each vertex has a single self-loop of real-valued weight $l$. We apply this real-valued lackadaisical quantum walk to two problems. First, we analyze it on the line or one-dimensional lattice, showing that it is exactly equivalent to a continuous deformation of the three-state Grover walk with faster ballistic dispersion. Second, we genera…
Coined Quantum Walks (QWs) are being used in many contexts with the goal of understanding quantum systems and building quantum algorithms for quantum computers. Alternative models such as Szegedy's and continuous-time QWs were proposed taking advantage of the fact that quantum theory seems to allow different quantized versions based on the same classical model, in this case, the classical random walk. In this work, we show the conditions upon which coined QWs are equivalent to Szegedy's QWs. Those QW models have in common a large class of instances, in the sense that the evolution operators ar…
We present and study a two-particle quantum walk on the line in which the two particles interact via a long-range Coulombian-like interaction. We obtain the spectrum of the system as well as study the type of molecules that form, attending to the bosonic or fermionic nature of the walkers. The usual loss of distinction between attractive and repulsive forces does not entirely apply in our model because of the long-range of the interaction.
We propose an alternative definition of an N-dimensional coined quantum walk by generalizing a recent proposal [Di Franco et al., Phys. Rev. Lett. 106, 080502 (2011)]. This N-dimensional alternate quantum walk, AQW_N, in contrast with the standard definition of the N-dimensional quantum walk, QW_N, requires only a coin-qubit. We discuss the quantum diffusion properties of AQW_2 and AQW_3 by analyzing their dispersion relations that reveal, in particular, the existence of diabolical points. This allows us to highlight interesting similarities with other well known physical phenomena. We also de…
Quantum versions of random walks on the line and cycle show a quadratic improvement in their spreading rate and mixing times respectively. The addition of decoherence to the quantum walk produces a more uniform distribution on the line, and even faster mixing on the cycle by removing the need for time-averaging to obtain a uniform distribution. We calculate numerically the entanglement between the coin and the position of the quantum walker and show that the optimal decoherence rates are such that all the entanglement is just removed by the time the final measurement is made.
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 properties of quantum walks compared with their classical counterparts have been well-studied on regular structures and also shown to be sensitive to defects and imperfections in the lattice. As a simple example of a disordered system, we consider percolation lattices, in which edges or sites are randomly missing, interrupting the progress of the quantum walk. We us…
Quantum walks obey unitary dynamics: they form closed quantum systems. The system becomes open if the walk suffers from imperfections represented as missing links on the underlying basic graph structure, described by dynamical percolation. Openness of the system's dynamics creates decoherence, leading to strong mixing. We present a method to analytically solve the asymptotic dynamics of coined, percolated quantum walks for a general graph structure. For the case of a circle and a linear graph we derive the explicit form of the asymptotic states. We find that a rich variety of asymptotic evolut…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the long-time behaviour appears untreatable with direct numerical methods. We develop novel analytic methods based on the theory of random unitary operations which help us to determine explicitly the asymptotic dynamics of quantum walks on 2D finite integer lattices with percolation. Based on this theory we find new unexpected features of percolated walks like …
Quantum walks with memory(QWM) are a type of modified quantum walks that record the walker's latest path. The general model of coined QWM is presented in Phys. Rev. A 93, 042323 (2016). In this paper, we present general model of Szegedy QWM. Importantly, the relation of coined QWM and Szegedy QWM is revealed. By transforming coined QWM to Szegedy QWM, some amazing results about QWM are founded.
The goal of teleportation is to transfer the state of one particle to another particle. In coined quantum walks, conditional shift operators can introduce entanglement between position space and coin space. This entanglement resource can be used as a quantum channel for teleportation, as proposed by Wang, Shang and Xue [Quantum Inf. Process. 16, 221 (2017)]. Here, we demonstrate the implementation of quantum teleportation using quantum walks on a five-qubit quantum computer and a 32-qubit simulator provided by IBM quantum experience beta platform. We show the teleportation of single-qubit, two…
In recent years, quantum walks have been widely researched and have shown exciting properties. One such is a quadratic speed-up in hitting time compared to its classical counterpart. In this paper, we design a quantum circuit for the MNRS algorithm, which finds a marked node in a graph with a quantum walk, and use it to find a hitting time for the marked nodes in the walk. We do this by implementing the circuit on IBM quantum simulators and show that the execution on a noise-free simulator results in hitting times that agree with the theoretical expectations. We also run the algorithm on a moc…
A coinless, discrete-time quantum walk possesses a Hilbert space whose dimension is smaller compared to the widely-studied coined walk. Coined walks require the direct product of the site basis with the coin space, coinless walks operate purely in the site basis, which is clearly minimal. These coinless quantum walks have received considerable attention recently because they have evolution operators that can be obtained by a graphical method based on lattice tessellations and they have been shown to be as efficient as the best known coined walks when used as a quantum search algorithm. We argu…
The Pólya number characterizes the recurrence of a random walk. We apply the generalization of this concept to quantum walks [M. Štefaňák, I. Jex and T. Kiss, Phys. Rev. Lett. \textbf{100}, 020501 (2008)] which is based on a specific measurement scheme. The Pólya number of a quantum walk depends in general on the choice of the coin and the initial coin state, in contrast to classical random walks where the lattice dimension uniquely determines it. We analyze several examples to depict the variety of possible recurrence properties. First, we show that for the class of quantum walks driven by in…
In this paper we complete the analysis begun by two of the authors in a previous work on the discrete quantum walk on the line [J. Phys. A 36:8775-8795 (2003) quant-ph/0303105 ]. We obtain uniformly convergent asymptotics for the "exponential decay'' regions at the leading edges of the main peaks in the Schr{ö}dinger (or wave-mechanics) picture. This calculation required us to generalise the method of stationary phase and we describe this extension in some detail, including self-contained proofs of all the technical lemmas required. We also rigorously establish the exact Feynman equivalence be…
Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model for a discrete-time quantum walk with memory by endowing the walker with multiple recycled coins and using a physical memory function via a history dependent coin flip. By numerical simulation we observe several phenomena. First in one dimension, walkers with memory have persistent quantum ballistic speed up over classical walks just as found in previous studies of multi-coined walks with trivial me…
Quantum walks can be defined in two quite distinct ways: discrete-time and continuous-time quantum walks (DTQWs and CTQWs). For classical random walks, there is a natural sense in which continuous-time walks are a limit of discrete-time walks. Quantum mechanically, in the discrete-time case, an additional "coin space" must be appended for the walk to have nontrivial time evolution. Continuous-time quantum walks, however, have no such constraints. This means that there is no completely straightforward way to treat a CTQW as a limit of DTQW, as can be done in the classical case. Various approach…
We clarify that coined quantum walk is determined by only the choice of local quantum coins. To do so, we characterize coined quantum walks on graph by disjoint Euler circles with respect to symmetric arcs. In this paper, we introduce a new class of coined quantum walk by a special choice of quantum coins determined by corresponding quantum graph, called quantum graph walk. We show that a stationary state of quantum graph walk describes the eigenfunction of the quantum graph.
We consider discrete-time evolution equations in which the stochastic operator of a classical random walk is replaced by a unitary operator. Such a problem has gained much attention as a framework for coined quantum walks that are essential for attaining the Grover limit for quantum search algorithms in physically realizable, low-dimensional geometries. In particular, we analyze the exact real-space renormalization group (RG) procedure recently introduced to study the scaling of quantum walks on fractal networks. While this procedure, when implemented numerically, was able to provide some deep…
There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the particle will move. The continuous walk operates with continuous time. Here a third model for a quantum walk is proposed, which is based on an analogy to optical interferometers. It is a discrete-time model, and the unitary operator that advances the walk one step depends only on the local structure of the graph on which the walk is taking place. No quantum coin i…
The staggered quantum walk model allows to establish an unprecedented connection between discrete-time quantum walks and graph theory. We call attention to the fact that a large subclass of the coined model is included in Szegedy's model, which in its turn is entirely included in the staggered model. In order to compare those three quantum walk models, we put them in the staggered formalism and we show that the Szegedy and coined models are defined on a special subclass of graphs. This inclusion scheme is also true when the searching framework is added. We use graph theory to characterize whic…
Discrete-time quantum walk evolve by a unitary operator which involves two operators a conditional shift in position space and a coin operator. This operator entangles the coin and position degrees of freedom of the walker. In this paper, we investigate the asymptotic behavior of the coin position entanglement (CPE) for an inhomogeneous quantum walk which determined by two orthogonal matrices in one-dimensional lattice. Free parameters of coin operator together provide many conditions under which a measurement perform on the coin state yield the value of entanglement on the resulting position …
IRT Saint Exupery（圣埃克苏佩里技术研究所）；Université Paul Sabatier（保罗·萨巴捷大学）；IRIT（图卢兹信息学研究所）
Quantum walks on binary trees are used in many quantum algorithms to achieve important speedup over classical algorithms. The formulation of this kind of algorithms as quantum circuit presents the advantage of being easily readable, executable on circuit based quantum computers and simulators and optimal on the usage of resources. We propose a strategy to compose quantum circuit that performs quantum walk on binary trees following universal gate model quantum computation principles. We give a particular attention to NAND formula evaluation algorithm as it could have many applications in game t…
The properties of the coinless quantum walk model have not been as thoroughly analyzed as those of the coined model. Both evolve in discrete time steps but the former uses a smaller Hilbert space, which is spanned merely by the site basis. Besides, the evolution operator can be obtained using a process of lattice tessellation, which is very appealing. The moments of the probability distribution play an important role in the context of quantum walks. The ballistic behavior of the mean square displacement indicates that quantum-walk-based algorithms are faster than random-walk-based ones. In thi…
We propose an optical cavity implementation of the two-dimensional coined quantum walk on the line. The implementation makes use of only classical resources, and is tunable in the sense that a large number of different unitary transformations can be implemented by tuning some parameters of the device.
A quantum walk on a toral phase space involving translations in position and its conjugate momentum is studied in the simple context of a coined walker in discrete time. The resultant walk, with a family of coins parametrized by an angle is such that its spectrum is exactly solvable with eigenangles for odd parity lattices being equally spaced, a feature that is remarkably independent of the coin. The eigenvectors are naturally specified in terms the $q-$Pochhammer symbol, but can also be written in terms of elementary functions, and their entanglement can be analytically found. While the phas…
Discrete time (coined) quantum walks are produced by the repeated application of a constant unitary transformation to a quantum system. By recasting these walks into the setting of periodic perturbations to an otherwise freely evolving system we introduce the concept of a stroboscopic quantum walk. Through numerical simulation, we establish the link between families of stroboscopic walks and quantum resonances. These are observed in the nonlinear systems of quantum chaos theory such as the delta-kicked rotator or the delta-kicked accelerator.
We show that the coined quantum walk on a line can be understood as an interference phenomenon, can be classically implemented, and indeed already has been. The walk is essentially two independent walks associated with the different coin sides, coupled only at initiation. There is a simple analogy between the evolution of walker positions and the propagation of light in a dispersive optical fiber.
We discuss how the coined quantum walk on the line or on the circle can be implemented using optical waves. We propose several optical cavity configurations for these implementations.
We demonstrate a coined quantum walk over ten steps in a one-dimensional network of linear optical elements. By applying single-point phase defects, the translational symmetry of an ideal standard quantum walk is broken resulting in localization effect in a quantum walk architecture. We furthermore investigate how the level of phase due to single-point phase defects and coin settings influence the strength of the localization signature.
A simple coined quantum walk in one dimension can be characterized by a $SU(2)$ operator with three parameters which represents the coin toss. However, different such coin toss operators lead to equivalent dynamics of the quantum walker. In this manuscript we present the unitary equivalence classes of quantum walks and show that all the nonequivalent quantum walks can be distinguished by a single parameter. Moreover, we argue that the electric quantum walks are equivalent to quantum walks with time dependent coin toss operator.
We study the evolution of initially extended distributions in the coined quantum walk on the line by analyzing the dispersion relation of the process and its associated wave equations. This allows us, in particular, to devise an initially extended condition leading to a uniform probability distribution whose width increases linearly with time, with increasing homogeneity.
In this work we explain the necessity for consistently labeled rotation maps for efficiently computing coined discrete time quantum walks on regular graphs.
We introduce a new framework to analyze quantum algorithms with the renormalization group (RG). To this end, we present a detailed analysis of the real-space RG for discrete-time quantum walks on fractal networks and show how deep insights into the analytic structure as well as generic results about the long-time behavior can be extracted. The RG-flow for such a walk on a dual Sierpinski gasket and a Migdal-Kadanoff hierarchical network is obtained explicitly from elementary algebraic manipulations, after transforming the unitary evolution equation into Laplace space. Unlike for classical rand…
In discrete time, coined quantum walks, the coin degrees of freedom offer the potential for a wider range of controls over the evolution of the walk than are available in the continuous time quantum walk. This paper explores some of the possibilities on regular graphs, and also reports periodic behaviour on small cyclic graphs.
We consider the two-state space-inhomogeneous coined quantum walk (QW) in one dimension. For a general setting, we obtain the stationary measure of the QW by solving the eigenvalue problem. As a corollary, stationary measures of the multi-defect model and space-homogeneous QW are derived. The former is a generalization of the previous works on one-defect model and the latter is a generalization of the result given by Konno and Takei (2015).
We present the first robust implementation of a coined quantum walk over five steps using only passive optical elements. By employing a fiber network loop we keep the amount of required resources constant as the walker's position Hilbert space is increased. We observed a non-Gaussian distribution of the walker's final position, thus characterizing a faster spread of the photon wave-packet in comparison to the classical random walk. The walk is realized for many different coin settings and initial states, which opens the way for the implementation of a quantum walk-based search algorithm.
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 compared and found to be very similar for both discrete and continuous time walks. The role of the oracle, and how it changes if more prior information about the graph is available, is also discussed.
Quantum walks can be used either as tools for quantum algorithm development or as entanglement generators, potentially useful to test quantum hardware. We present a novel algorithm based on a discrete Hadamard quantum walk on a line with one coin and two walkers whose purpose is to generate entanglement between walkers. We provide several classical computer simulations of our quantum algorithm in which we show that, although the asymptotical amount of entanglement generated between walkers does not reach the highest degree of entanglement possible at each step for either coin measurement outco…
We analyze the solution of the coined quantum walk on a line. First, we derive the full solution, for arbitrary unitary transformations, by using a new approach based on the four "walk fields" which we show determine the dynamics. The particular way of deriving the solution allows a rigorous derivation of a long wavelength approximation. This long wavelength approximation is useful as it provides an approximate analytical expression that captures the basics of the quantum walk and allows us to gain insight into the physics of the process.
In this paper, we consider an extended coined Szegedy model and discuss the existence of the point spectrum of induced quantum walks in terms of recurrence properties of the underlying birth and death process. We obtain that if the underlying random walk is not null recurrent, then the point spectrum exists in the induced quantum walks. As an application, we provide a simple computational way of the dispersion relation of the edge state part for the topological phase model driven by quantum walk using the recurrence properties of underlying birth and death process.
Perfect state transfer between two marked vertices of a graph by means of discrete-time quantum walk is analyzed. We consider the quantum walk search algorithm with two marked vertices, sender and receiver. It is shown by explicit calculation that for the coined quantum walks on star graph and complete graph with self-loops perfect state transfer between the sender and receiver vertex is achieved for arbitrary number of vertices $N$ in $O(\sqrt{N})$ steps of the walk. Finally, we show that Szegedy's walk with queries on complete graph allows for state transfer with unit fidelity in the limit o…
