Norio Konno
The Hadamard walk is a typical model of the discrete-time quantum walk. We investigate sojourn times of the Hadamard walk on a line by a path counting method.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Hadamard Rigidity of Positive Sojourn Time Distributions for Rotation Coins
本文研究旋转硬币族中阿达马硬币的正停留时间分布刚性，证明有限时间精确均匀性可刻画阿达马硬币，通过矩阵值生成函数等方法完成相关分析。
Using the technique of path counting we show non-existence of sojourn times in the Grover walk which is related to the Grover's algorithm in computer science.
In this paper we study a one-dimensional quantum random walk with the Hadamard transformation which is often called the Hadamard walk. We construct the Hadamard walk using a transition matrix on probability amplitude and give some results on symmetry of probability distributions for the Hadamard walk.
The present paper treats the period T_N of the Hadamard walk on a cycle C_N with N vertices. Dukes (2014) considered the periodicity of more general quantum walks on C_N and showed T_2 =2, T_4=8, T_8=24 for the Hadamard walk case. We prove that the Hadamard walk does not have any period except for his case, i.e., N=2, 4, 8. Our method is based on a path counting and cyclotomic polynomials which is different from his approach based on the property of eigenvalues for unitary matrix that determines the evolution of the walk.
A new model that maps a quantum random walk described by a Hadamard operator to a particular case of a random walk is presented. The model is represented by a Markov chain with a stochastic matrix, i.e., all the transition rates are positive, although the Hadamard operator contains negative entries. Using a proper transformation that is applied to the random walk distribution after n steps, the probability distributions in space of the two quantum states |1>, |0> are revealed. These show that a quantum walk can be entirely mapped to a particular case of a higher dimension of a random walk mode…
We propose a scheme to implement the simplest and best-studied version of quantum random walk, the discrete Hadamard walk, in one dimension using coherent macroscopic sample of ultracold atoms, Bose-Einstein condensate (BEC). Implementation of quantum walk using BEC gives access to the familiar quantum phenomena on a macroscopic scale. This paper uses rf pulse to implement Hadamard operation (rotation) and stimulated Raman transition technique as unitary shift operator. The scheme suggests implementation of Hadamard operation and unitary shift operator while the BEC is trapped in long Rayleigh…
We study return to the origin on the square lattice and investigate the stability properties of the Hadamard walk in the presence of bias.
Quantum walks, whose dynamics is prescribed by alternating unitary coin and shift operators, possess topological phases akin to those of Floquet topological insulators, driven by a time-periodic field. While there is ample theoretical work on topological phases of quantum walks where the coin operators are spin rotations, in experiments a different coin, the Hadamard operator is often used instead. This was the case in a recent photonic quantum walk experiment, where protected edge states were observed between two bulks whose topological invariants, as calculated by the standard theory, were t…
Existence of the eigenvalues of the discrete-time quantum walks is deeply related to localization of the walks. We revealed the distributions of the eigenvalues given by the splitted generating function method (the SGF method) of the quantum walks we had treated in our previous studies. In particular, we focused on two kinds of the Hadamard walk with one defect models and the two-phase QWs that have phases at the non-diagonal elements of the unitary transition operators. As a result, we clarified the characteristic parameter dependence for the distributions of the eigenvalues with the aid of n…
In this paper, we consider the stationary measure of the Hadamard walk on the one-dimensional integer lattice. Here all the stationary measures given by solving the eigenvalue problem are completely determined via the transfer matrix method. Then these stationary measures can be divided into three classes, i.e., quadratic polynomial, bounded, and exponential types. In particular, we present an explicit necessary and sufficient condition for the bounded-type stationary measure to be periodic.
We study a one-parameter family of discrete-time quantum walk models on the line and in the xy-plane associated with the Hadamard walk. Weak convergence in the long-time limit of all moments of the walker's pseudo-velocity on the line and in the xy-plane is proved. Symmetrization on the line and in the xy-plane is theoretically investigated, leading to the resolution of the Konno-Namiki-Soshi conjecture in the special case of symmetrization of the unbiased Hadamard walk on the line . A necessary condition for the existence of a phenomenon known as localization is given.
A new model maps a quantum random walk described by a Hadamard operator to a particular case of a birth and death process. The model is represented by a 2D Markov chain with a stochastic matrix, i.e., all the transition rates are positive, although the Hadamard operator contains negative entries (this is possible by increasing the dimensionality of the system). The probability distribution of the walker population is preserved using the Markovian property. By applying a proper transformation to the population distribution of the random walk, the probability distributions of the quantum states …
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…
In this paper we investigate one dimensional quantum walks with two-step memory, which can be viewed as an extension of quantum walks with one-step memory. We develop a general formula for the amplitudes of the two-step-memory walk with Hadamard coin by using path integral approach, and numerically simulate its process. The simulation shows that the probability distribution of this new walk is different from that of the Hadamard quantum walk with one-step memory, while it presents some similarities with that of the normal Hadamard quantum walk without memory.
The discrete-time quantum walk dynamics can be generated by a time-dependent Hamiltonian, repeatedly switching between the coin and the shift generators. We change the model and consider the case where the Hamiltonian is time-independent, including both the coin and the shift terms in all times. The eigenvalues and the related Bloch vectors for the time-independent Hamiltonian are then compared with the corresponding quantities for the effective Hamiltonian generating the quantum walk dynamics. Restricted to the non-localized initial quantum walk states, we optimize the parameters in the time-…
Absolute zeta functions and periodicity of quantum walks on cycles
本文建立循环图上 Hadamard 与 3-state Grover 量子行走同绝对 zeta 函数的联系，推导其显式形式并证明这些 zeta 函数为绝对自守形式。
Two-particle Hadamard walk on dynamically percolated line and circle
本文研究了双粒子在动态渗流线与圆上的Hadamard行走的渐近动力学，构建了随机酉演化吸引子空间的基并证明其完备性，发现共享渗流图能作为弱相互作用使初始不相关粒子产生关联。
Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example of a typical walk, the ``Hadamard walk''. We show that after t time steps, the probability distribution on the line induced by the Hadamard walk is almost uniformly distributed over the interval [-t/sqrt(2),t/sqrt(2)]. This implies that the same walk defined on the circle mixes in_linear_ time. This is in direct contrast with the quadratic mixing time for th…
We propose a variation of the quantum walk on a circle in phase space by conjoining the Hadamard coin flip with simultaneous displacement of the walker's location in phase space and show that this generalization is a proper quantum walk albeit over multiple concentric circles in phase instead of just over one circle. We motivate the conjoining of Hadamard and displacement operations by showing that the Jaynes-Cummings model for coin+walker approximately yields this description in the dispersive limit. The quantum walk signature is evident in the phase distribution of the walker provided that a…
Quantum walks are known to have nontrivial interaction with absorbing boundaries. In particular, Ambainis et.\ al.\ \cite{ambainis01} showed that in the $(\Z ,C_1,H)$ quantum walk (one-dimensional Hadamard walk) an absorbing boundary partially reflects information. These authors also conjectured that the left absorption probabilities $P_n^{(1)}(1,0)$ related to the finite absorbing Hadamard walks $(\Z ,C_1,H,\{ 0,n\} )$ satisfy a linear fractional recurrence in $n$ (here $P_n(1,0)$ is the probability that a Hadamard walk particle initialized in $|1\rangle |R\rangle$ is eventually absorbed at $…
Temporal fluctuations in the Hadamard walk on circles are studied. A temporal standard deviation of probability that a quantum random walker is positive at a given site is introduced to manifest striking differences between quantum and classical random walks. An analytical expression of the temporal standard deviation on a circle with odd sites is shown and its asymptotic behavior is considered for large system size. In contrast with classical random walks, the temporal fluctuation of quantum random walks depends on the position and initial conditions, since temporal standard deviation of the …
In an interacting continuous time quantum walk, while the walker (the cursor) is moving on a graph, computational primitives (unitary operators associated with the edges) are applied to ancillary qubits (the register). The model with one walker was originally proposed by R. Feynman, who thus anticipated many features of the Continuous Time Quantum Walk (CTWQ) computing paradigm. In this note we examine the behaviour of an interacting CTQW with two walkers and examine the interaction of the walkers with noncommuting primitives. We endow such a walk with a notion of trajectory, in the sense of s…
We study a generalized Hadamard walk in one dimension with three inner states. The particle governed by the three-state quantum walk moves, in superposition, both to the left and to the right according to the inner state. In addition to these two degrees of freedom, it is allowed to stay at the same position. We calculate rigorously the wavefunction of the particle starting from the origin for any initial qubit state, and show the spatial distribution of probability of finding the particle. In contrast with the Hadamard walk with two inner states on a line, the probability of finding the parti…
We study electric quantum walks in two dimensions considering Grover, Alternate, Hadamard, and DFT quantum walks. In the Grover walk the behaviour under an electric field is easy to summarize: when the field direction coincides with the x or y axes, it produces a transient trapping of the probability distribution along the direction of the field, while when it is directed along the diagonals, a perfect 2D trapping is frustrated. The analysis of the alternate walk helps to understand the behaviour of the Grover walk as both walks are partially equivalent; in particular, it helps to understand t…
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard walks on the line and symmetric walks on the hypercube from the viewpoint of absorbing probability and time.
In this paper we consider a quantum version of Pascal's triangle. Pascal's triangle is a well-known triangular array of numbers and when these numbers are plotted modulo 2, a fractal known as the Sierpinski triangle appears. We first prove the appearance of more general fractals when Pascal's triangle is considered modulo prime powers. The numbers in Pascal's triangle can be obtained by scaling the probabilities of the simple symmetric random walk on the line. In this paper we consider a quantum version of Pascal's triangle by replacing the random walk by the quantum walk known as the Hadamard…
We show that a multi-step quantum walk can be realized for a single trapped ion with interpolation between quantum and random walk achieved by randomizing the generalized Hadamard coin flip phase. The signature of the quantum walk is manifested not only in the ion's position but also its phonon number, which makes an ion trap implementation of the quantum walk feasible.
Let p_j^(n) be the probability that a Hadamard quantum walk, started at site j on the integer lattice {0,...,n}, is absorbed at 0. We give an explicit formula for p_j^(n). Our formula proves a conjecture of John Watrous, concerning an empirically observed linear fractional recurrence relation for the numbers p_1^(n).
For a discrete two-state quantum walk (QW) on the half-line with a general condition at the boundary, we formulate and prove a weak limit theorem describing the terminal behavior of its transition probabilities. In this context, localization is possible even for a walk predicated on the assumption of homogeneity. For the Hadamard walk on the half-line, the weak limit is shown to be independent of the initial coin state and to exhibit no localization.
Closed-form expressions for the probability distribution of quantum walk on a line
本文针对一维直线上量子行走，在最一般硬币算符和初始态条件下，利用 Fibonacci-Horner 基方法推导出概率分布的闭式表达式，并通过 Hadamard 行走模拟验证了其准确性。
We study the motion of M particles performing a quantum walk on the line. Under various conditions on the initial coin states for quantum walkers controlled by the Hadamard operator, we give theoretical criterion to observe the quantum walkers at an initial location with high probability.
We consider asymptotic behaviour of a Hadamard walk on a cycle. For a walk which starts with a state in which all the probability is concentrated on one node, we find the explicit formula for the limiting distribution and discuss its asymptotic behaviour when the length of the cycle tends to infinity. We also demonstrate that for a carefully chosen initial state, the limiting distribution of a quantum walk on cycle can lie further away from the uniform distribution than its initial state.
In this work, we show that ma-QAOA is equivalent to a restriction of continuous-time quantum walks on dynamic graphs. We then show it is universal for computation by finding the appropriate $B$ and $C$ operators and angles that implement the universal gate set consisting of the Hadamard, $π/8$ and Controlled-Not gates in the ma-QAOA framework. This result begins to bridge the gap between the continuous-time quantum walk model and gate model of quantum computation.
We find out a few ways to improve the realization of entanglement between the internal (spin) and external (position) degrees of freedom of a quantum particle, through the insertion of disordered time steps along a one-dimensional discrete time quantum walk. The disorder is introduced by a randomly chosen quantum coin obtained from a uniform distribution among infinite quantum coins or only between Hadamard and Fourier coins for all the time steps. We can also decrease the amount of disorder by alternating disordered and ordered time steps along a quantum walk or by establishing a probability …
We show analytically that particle trapping appears in a quantum process called "quantum walk", in which the particle moves macroscopically correlating to the inner states. It has been well known that a particle in the ``Hadamard walk" with two inner states spreads away quickly on a line. In contrast, we find one-dimensional quantum walk with multi-state in which a particle stays at the starting point entirely with high positive probability. This striking difference is explained from difference between degeneration of eigenvalues of the time-evolution matrices.
In this paper, we study Grover walks on a line with one and two absorbing boundaries. In particular, we present some results for the absorbing probabilities both in a semi-finite and finite line. Analytical expressions for these absorbing probabilities are presented by using the combinatorial approach. These results are perfectly matched with numerical simulations. We show that the behavior of Grover walks on a line with absorbing boundaries is strikingly different from that of classical walks and that of Hadamard walks.
Quantum random walk in a two-dimensional lattice with randomly distributed traps is investigated. Distributions of quantum walkers are evaluated dynamically for the cases of Hadamard, Fourier, and Grover coins, and quantum to classical transition is examined as a function of the density of the traps. It is shown that traps act as a serious and additional source of quantum decoherence. Furthermore, non-trivial temporal dependence of the standard deviation of the probability distribution of the walker is found when the trapping imperfections are introduced.
We analyze the quantum walk in higher spatial dimensions and compare classical and quantum spreading as a function of time. Tensor products of Hadamard transformations and the discrete Fourier transform arise as natural extensions of the quantum coin toss in the one-dimensional walk simulation, and other illustrative transformations are also investigated. We find that entanglement between the dimensions serves to reduce the rate of spread of the quantum walk. The classical limit is obtained by introducing a random phase variable.
In most widely discussed discrete time quantum walk model, after every unitary shift operator, the particle evolves into the superposition of position space and settles down in one of its basis states, loosing entanglement in the coin space in the new position. The Hadamard operation is applied to let the particle to evolve into the superposition in the coin space and the walk is iterated. We present a model with a additional degree of freedom for the unitary shift operator $U^{\prime}$. The unitary operator with additional degree of freedom will evolve the quantum particle into superposition …
Dukes (2014) and Konno, Shimizu, and Takei (2017) studied the periodicity for 2-state quantum walks whose coin operator is the Hadamard matrix on cycle graph C_N with N vertices. The present paper treats the periodicity for 3-state quantum walks on C_N. Our results follow from a new method based on cyclotomic field. This method shows a necessary condition for the coin operator of quantum walks to have the finite period. Moreover, we reveal the period T_N of two kinds of typical quantum walks, the Grover and Fourier walks. We prove that both walks do not have any finite period except for N=3, i…
A review of discrete quantum walk with two particle is given. The use of different states encountered in identical particle, and the idea of entanglement and superposition is explored to explored the interesting dynamics of two particle quantum walk. Boundary conditions can specify certain dynamics and so a survey of periodic boundary condition (circle) is presented. A simulation for a Hadamard walk for different periods of a circle is considered and results are compared for various periods and for a case with absorbing boundaries.
We consider continuous-time quantum walks on distance-regular graphs of small diameter. Using results about the existence of complex Hadamard matrices in association schemes, we determine which of these graphs have quantum walks that admit uniform mixing. First we apply a result due to Chan to show that the only strongly regular graphs that admit instantaneous uniform mixing are the Paley graph of order nine and certain graphs corresponding to regular symmetric Hadamard matrices with constant diagonal. Next we prove that if uniform mixing occurs on a bipartite graph X with n vertices, then n i…
We show how a quantum walk can be implemented for the first time in a quantum quincunx created via superconducting circuit quantum electrodynamics (QED), and how interpolation from quantum to random walk is implemented by controllable decoherence using a two resonator system. Direct control over the coin qubit is difficult to achieve in either cavity or circuit QED, but we show that a Hadamard coin flip can be effected via direct driving of the cavity, with the result that the walker jumps between circles in phase space but still exhibits quantum walk behavior over 15 steps.
In this paper, we consider periodicity for space-inhomogeneous quantum walks on the cycle. For isospectral coin cases, we propose a spectral analysis. Based on the analysis, we extend the result for periodicity for Hadamard walk to some isospectral coin cases. For non-isospectral coin cases, we consider the the system that uses only one general coin at the origin and the identity coin at the other sites. In this case, we show that the periodicity of the general coin at the origin determines the periodicity for the whole system.
We propose a scheme for perfect transfer of an unknown qubit state via the discrete-time quantum walk on a line or a circle. For this purpose, we introduce an additional coin operator which is applied at the end of the walk. This operator does not depend on the state to be transferred. We show that perfect state transfer over an arbitrary distance can be achieved only if the walk is driven by an identity or a flip coin operator. Other biased coin operators and Hadamard coin allow perfect state transfer over finite distances only. Furthermore, we show that quantum walks ending with a perfect st…
We use simple deterministic dynamical systems as coins in studying quantum walks. These dynamical systems can be chosen to display, in the classical limit, a range of behaviors from the integrable to chaotic, or deterministically random. As an example of an integrable coin we study the Fourier walk that generalizes the Hadamard walk and show that the walker slows down with coin dimensionality, which controls the effective Planck constant. Introducing multi-Harper maps as deterministic models of random walks we study the effect of coin chaos on the quantum walk. We also demonstrate that breakin…
We present a novel application of the HHL (Harrow-Hassidim-Lloyd) algorithm -- a quantum algorithm solving systems of linear equations -- in solving an open problem about quantum random walks, namely computing hitting (or absorption) probabilities of a general (not only Hadamard) one-dimensional quantum random walks with two absorbing boundaries. This is achieved by a simple observation that the problem of computing hitting probabilities of quantum random walks can be reduced to inverting a matrix. Then a quantum algorithm with the HHL algorithm as a subroutine is developed for solving the pro…
We study the generation of hybrid entanglement in a one-dimensional quantum walk. In particular, we explore the preparation of maximally entangled states between position and spin degrees of freedom. We address it as an optimization problem, where the cost function is the Schmidt norm. We then benchmark the algorithm and compare the generation of entanglement between the Hadamard quantum walk, the random quantum walk and the optimal quantum walk. Finally, we discuss an experimental scheme with a photonic quantum walk in the orbital angular momentum of light. The experimental measurement of ent…
We study decoherence in the quantum walk on the xy-plane. We generalize the method of decoherent coin quantum walk, introduced by [T.A. Brun, et.al, Phys.Rev.A 67 (2003) 032304],which could be applicable to all sorts of decoherence in two dimensional quantum walks, irrespective of the unitary transformation governing the walk. As an application we study decoherence in the presence of broken line noise in which the quantum walk is governed by the two-dimensional Hadamard operator.
We devise a protocol to build 1D time-dependent quantum walks in 1D maximizing the spatial spread throughout the procedure. We allow only one of the physical parameters of the coin-tossing operator to vary, i.e. the angle $θ$, such that for $θ=0$ we have the $\hatσ_z$, while for $θ=π/4$ we obtain the Hadamard gate. The optimal $θ$ sequences present non-trivial patterns, with mostly $θ\approx 0$ alternated with $θ\approx π/4$ values after increasingly long periods. We provide an analysis of the entanglement properties, quasi-energy spectrum and survival probability, providing a full physical pi…
We consider directional correlations between M-particles on a line. For non-interacting particles we find analytic asymptotic expressions. When delta-interaction is introduced in the model we study the Fourier analysis and obtain general analytic formula for the wave function of the walk in the case M is 2 for the transformation C-delta, which can be considered an unfactorized version of the Hadamard walk in two-dimensions.
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains. We explore the "quantum trajectory" point of view on these quantum random walks, that is, we show that measuring the position of the particle after each time- step gives rise to a classical Markov chain, on the lattice times the state space of the particle. This quantum trajectory is a simulation of the master equation of the quantum random walk. The physica…
Stronger resilience to disorder in 2D quantum walks than in 1D
该研究通过分析二维离散时间量子行走在玻璃态无序下的扩散行为，发现其鲁棒性优于一维，量子优势更稳固。
Lazy quantum walks were presented by Andrew M. Childs to prove that the continuous-time quantum walk is a limit of the discrete-time quantum walk [Commun.Math.Phys.294,581-603(2010)]. In this paper, we discuss properties of lazy quantum walks. Our analysis shows that lazy quantum walks have $O(t^n)$ order of the n-th moment of the corresponding probability distribution, which is the same as that for normal quantum walks. Also, the lazy quantum walk with DFT (Discrete Fourier Transform) coin operator has a similar probability distribution concentrated interval to that of the normal Hadamard qua…
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…
Quantum walks have been shown to be fruitful tools in analysing the dynamic properties of quantum systems. This article proposes to use quantum walks as an approach to Quantum Neural Networks (QNNs). QNNs replace binary McCulloch-Pitts neurons with a qubit in order to use the advantages of quantum computing in neural networks. A quantum walk on the firing states of such a QNN is supposed to simulate central properties of the dynamics of classical neural networks, such as associative memory. It is shown that a biased discrete Hadamard walk derived from the updating process of a biological neuro…
By adding an extra Hilbert space to Hadamard Quantum Walk on Cycles (QWC), we presented a new type of QWCs called Möbius Quantum Walk (MQW). The new space configuration enables the particle to rotate around the axis of movement. We defined factor $α$ as the Möbius factor which is number of rotations per cycle. So by $α=0$ we have normal QWC, while $α\neq 0$ defines new type of QWC (namely Möbius Quantum Walk). Specially $α= \frac{1}{2}$ defines a structure similar to Möbius strip. We analytically investigated this new type of QW and found that by tuning the parameter $α$ we can reach uniform d…
We investigate a generalized Hadamard walk in two dimensions with five inner states. The particle governed by a five-state quantum walk (5QW) moves, in superposition, either leftward, rightward, upward, or downward according to the inner state. In addition to the four degrees of freedom, it is allowed to stay at the same position. We calculate rigorously the wave function of the particle starting from the origin in the plane for any initial state, and give the spatial distribution of probability of finding the particle. We also investigate the localization problem for the two-dimensional five-…
Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the one-dimensional discrete-time QW and discuss basic steps in detail by incorporating the most general coin operator. We investigate the impact of each parameter of the general coin operator on the probability distribution of the quantum walker. We show that by tuning the parameters of the general coin, one can regulate the probability distribution of the walker. We pro…
Quantum walk (QW), which is considered as the quantum counterpart of the classical random walk (CRW), is actually the quantum extension of CRW from the single-coin interpretation. The sequential unitary evolution engenders correlation between different steps in QW and leads to a ballistic position distribution. In this paper, we propose an alternative quantum extension of CRW from the ensemble interpretation, named quantum random walk (QRW), where the walker has many unrelated coins, modeled as two-level systems, initially prepared in the same state. We calculate the walker's position distribu…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。