One-dimensional lazy quantum walks and occupancy rate

In this paper, we discuss the properties of lazy quantum walks. Our analysis shows that the 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. The lazy quantum walk with a discrete Fourier transform(DFT) coin operator has a similar probability distribution concentrated interval to that of the normal Hadamard quantum walk. Most importantly, we introduce the concepts of occupancy number and occupancy rate to measure the extent to which the walk has a(relatively) high probability at every position in its range. We conclude that the lazy quantum walks have a higher occupancy rate than other walks such as normal quantum walks, classical walks, and lazy classical walks.     

Recurrence and Pólya number of quantum walks

We analyze the recurrence probability (Pólya number) for d-dimensional unbiased quantum walks. A sufficient condition for a quantum walk to be recurrent is derived. As a by-product we find a simple criterion for localization of quantum walks. In contrast with classical walks, where the Pólya number is characteristic for the given dimension, the recurrence probability of a quantum walk depends in general on the topology of the walk, choice of the coin and the initial state. This allows us to change the character of the quantum walk from recurrent to transient by altering the initial state.     

One-dimensional quantum walks with a position-dependent coin

We investigate the evolution of a discrete-time one-dimensional quantum walk driven by a position-dependent coin. The rotation angle, which depends upon the position of a quantum particle, parameterizes the coin operator. For different values of the rotation angle, we observe that such a coin leads to a variety of probability distributions, e.g. localized, periodic, classicallike, semi-classical-like, and quantum-like. Further, we study the Shannon entropy associated with position and the coin space of a quantum particle, and compare them with the case of the position-independent coin. Our results show that the entropy is smaller for most values of the rotation angle as compared to the case of the position-independent coin. We also study the effect of entanglement on the behavior of probability distribution and Shannon entropy by considering a quantum walk with two identical position-dependent entangled coins. We observe that in general, a wave function becomes more localized as compared to the case of the positionindependent coin and hence the corresponding Shannon entropy is lower. Our results show that a position-dependent coin can be used as a controlling tool of quantum walks.     

Discrete-time quantum walks on one-dimensional lattices

In this paper, we study discrete-time quantum walks on one-dimensional lattices. We find that the coherent dynamics depends on the initial states and coin parameters. For infinite size of lattices, we derive an explicit expression for the return probability, which shows scaling behavior P(0, t) ~ t ^-1 and does not depends on the initial states of the walk. In the long-time limit, the probability distribution shows various patterns, depending on the initial states, coin parameters and the lattice size. The time-averaged probability mixes to the limiting probability distribution in linear time, i.e., the mixing time M _ε is a linear function of N (size of the lattices) for large values of thresholds ϵ. Finally, we introduce another kind of quantum walk on infinite or even-numbered size of lattices, and show that by the method of mathematical induction, the walk is equivalent to the traditional quantum walk with symmetrical initial state and coin parameter.     

基于相位匹配的量子行走搜索算法及电路实现

量子行走是经典随机行走在量子力学框架下的对应, 理论上可以用来解决一类无序数据库的搜索问题. 因为携带信息的量子态的扩散速度与经典相比有二次方式的增长, 所以量子行走优于经典随机行走, 量子行走的特性值得加以利用. 量子行走作为一种新发现的物理现象的数学描述, 引发了一种新的思维方式, 孕育了一种新的理论计算模型. 最新研究表明, 量子行走本身也是一种通用计算模型, 可被视为设计量子算法的高级工具, 因此受到部分计算机理论科学领域学者的关注和研究. 对于多数问题求解方案的量子算法的设计, 理论上可以只在量子行走模型下进行考虑. 基于Grover算法的相位匹配条件, 本文提出了一个新的基于量子行走的搜索算法. 理论演算表明: 一般情况下本算法的时间复杂度与Grover算法相同, 但是当搜索的目标数目多于总数的1/3时, 本算法搜索成功的概率要大于Grover算法. 本文不但利用Grover算法中相位匹配条件构造了一个新的量子行走搜索算法, 而且在本研究室原有的量子电路设计研究成果的基础上给出了该算法的量子电路表述.     

逾渗分立时间量子行走的传输及纠缠特性

在一维分立时间量子行走中,通过静态和动态两种方式随机地断开连接边引入无序效应,研究了静态逾渗和动态逾渗对量子行走传输特性以及位置自由度和硬币自由之间纠缠的影响.随着演化时间的增加,静态逾渗会使得量子行走从弹道传输转变为安德森局域化,而动态逾渗则会使之转变为经典扩散.理想情况下,量子纠缠在较短的时间内就达到一个常数值E_0.静态逾渗量子行走的纠缠减小,并随着时间做无规振荡,而动态逾渗量子行走的纠缠则会随着时间光滑地增加,并在某一时间超过理想情况下的常数值,表现出动态逾渗增强量子纠缠的特性.     

Quantum walk under coherence non-generating channels

We investigate the probability distribution of the quantum walk under coherence non-generating channels. We definea model called generalized classical walk with memory. Under certain conditions, generalized classical random walk withmemory can degrade into classical random walk and classical random walk with memory. Based on its various spreadingspeed, the model may be a useful tool for building algorithms. Furthermore, the model may be useful for measuring thequantumness of quantum walk. The probability distributions of quantum walks are generalized classical random walkswith memory under a class of coherence non-generating channels. Therefore, we can simulate classical random walkand classical random walk with memory by coherence non-generating channels. Also, we find that for another class ofcoherence non-generating channels, the probability distributions are influenced by the coherence in the initial state of thecoin. Nevertheless, the influence degrades as the number of steps increases. Our results could be helpful to explore therelationship between coherence and quantum walk.     

Brun-Type Formalism for Decoherence in Two-Dimensional Quantum Walks

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.     

A quantum walk in phase space with resonator-assisted double quantum dots

We implement a quantum walk in phase space with a new mechanism based on the superconducting resonator-assisted double quantum dots.By analyzing the hybrid system,we obtain the necessary factors implementing a quantum walk in phase space:the walker,coin,coin flipping and conditional phase shift.The coin flipping is implemented by adding a driving field to the resonator.The interaction between the quantum dots and resonator is used to implement conditional phase shift.Furthermore,we show that with different driving fields the quantum walk in phase space exhibits a ballistic behavior over 25 steps and numerically analyze the factors influencing the spreading of the walker in phase space.     

Quantum walks with an anisotropic coin II: scattering theory

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.

     

Non-Markovian decoherent quantum walks

Quantum walks act in obviously different ways from their classical counterparts, but decoherence will lessen and close this gap between them. To understand this process, it is necessary to investigate the evolution of quantum walks under different decoherence situations. In this article, we study a non-Markovian decoherent quantum walk on a line. In a short time regime, the behavior of the walk deviates from both ideal quantum walks and classical random walks. The position variance as a measure of the quantum walk collapses and revives for a short time, and tends to have a linear relation with time. That is, the walker's behavior shows a diffusive spread over a long time limit, which is caused by non-Markovian dephasing affecting the quantum correlations between the quantum walker and his coin. We also study both quantum discord and measurement-induced disturbance as measures of the quantum correlations, and observe both collapse and revival in the short time regime, and the tendency to be zero in the long time limit. Therefore, quantum walks with non-Markovian decoherence tend to have diffusive spreading behavior over long time limits, while in the short time regime they oscillate between ballistic and diffusive spreading behavior, and the quantum correlation collapses and revives due to the memory effect.     

One-Dimensional Three-State Quantum Walk with Single-Point Phase Defects

In this paper, we study a three-state quantum walk with a phase defect at a designated position. The coin operator is a parametrization of the eigenvectors of the Grover matrix. We numerically investigate the properties of the proposed model via the position probability distribution, the position standard deviation, and the time-averaged probability at the designated position. It is shown that the localization effect can be governed by the phase defect’s position and strength, coin parameter and initial state.     

基于散射量子行走的完全图上结构异常搜索算法

完全图K_N 上某个顶点连接到图G将破坏其对称性. 为加速定位这类结构异常, 基于散射量子行走模型设计搜索算法, 首先给出了算法酉算子的定义, 在此基础上利用完全图的对称性, 将算法的搜索空间限定为一个低维的坍缩图空间. 以G为一个顶点的情况为例, 利用硬币量子行走模型上的研究结论简化了坍缩图空间中酉算子的计算, 并借助矩阵扰动理论分析算法演化过程. 针对星图S_N 上结构异常的研究表明, 以星图中心节点为界将整个图分为左右两个部分, 当且仅当两部分在N→∞时具有相同的特征值, 搜索算法可以获得量子加速. 本文说明星图上的分析方法和结论可以推广至完全图的坍缩图上. 基于此, 本文证明无论完全图连接的图G结构如何, 搜索算法均可在O(√N) 时间内定位到目标顶点, 成功概率为1-O(1√N), 即量子行走搜索该类异常与经典搜索相比有二次加速.     

State transfer on two-fold Cayley trees via quantum walks

Perfect state transfer(PST)has great significance due to its applications in quantum information processing and quantum computation.The main problem we study in this paper is to determine whether the two-fold Cayley tree,an extension of the Cayley tree,admits perfect state transfer between two roots using quantum walks.We show that PST can be achieved by means of the so-called nonrepeating quantum walk[Phys.Rev.A 89042332(2014)]within time steps that are the distance between the two roots;while both the continuous-time quantum walk and the typical discrete-time quantum walk with Grover coin approaches fail.Our results suggest that in some cases the dynamics of a discrete-time quantum walk may be much richer than that of the continuous-time quantum walk.     

Quantum phase transitions in a frustration-free spin chain based on modified Motzkin walks

Area law violations for entanglement entropy in the form of a square root has recently been studied for one-dimensional frustration-free quantum systems based on the Motzkin walks and their variations. Here, we further modify the Motzkin walks using the elements of a symmetric inverse semigroup as basis states on each step of the walk. This change alters the number of paths allowed in the Motzkin walks and by introducing an appropriate term in the Hamiltonian with a tunable parameter we show that we can jump from a state that violates the area law logarithmically to a state that obeys the area law providing an example of quantum phase transition in a one-dimensional system.     

Two Quantum Coins Sharing a Walker

For classical random walks, changing or not changing coins makes a trivial influence on the random-walk behaviors. In this paper, we investigate the quantum walk where a walker’s movement is controlled by two initially independent coins alternately partially or fully after each step. We observe that there exist complicated inter-coin correlations in the quantum walk. Specifically, we study the correlations of two coins by tracing out the walker, and analyze classical, general, and quantum correlations between two coins in terms of classical mutual information, quantum mutual information, and measurement-induced disturbance. Our analysis shows different quantum features from that in classical random walks.

     

Return Probability of the Fibonacci Quantum Walk

In this paper the return probability of the one-dimensional discrete-time quantum walk is studied. We derive probabilistic formulas for the return probability related to the quantum walk governed by the Fibonacci coin.