Localization and recurrence of a quantum walk in a periodic potential on a line

We present a numerical study of a model of quantum walk in a periodic potential on a line. We take the simple view that different potentials have different affects on the way in which the coin state of the walker is changed. For simplicity and definiteness, we assume that the walker＇s coin state is unaffected at sites without the potential, and rotated in an unbiased way according to the Hadamard matrix at sites with the potential. This is the simplest and most natural model of a quantum walk in a periodic potential with two coins. Six generic cases of such quantum walks are studied numerically. It is found that, of the six cases, four cases display significant localization effect where the walker is confined in the neighborhood of the origin for a sufficiently long time. Associated with such a localization effect is the recurrence of the probability of the walker returning to the neighborhood of the origin.     

Classical random walk with memory versus quantum walk on a one-dimensional infinite chain

Quantum walk is a very useful tool for building quantum algorithms due to the faster spreading of probability distributions as compared to a classical random walk. Comparing the spreading of the probability distributions of a quantum walk with that of a mnemonic classical random walk on a one-dimensional infinite chain, we find that the classical random walk could have a faster spreading than that of the quantum walk conditioned on a finite number of walking steps. Quantum walk surpasses classical random walk with memory in spreading speed when the number of steps is large enough. However, in such a situation, quantum walk would seriously suffer from decoherence. Therefore, classical walk with memory may have some advantages in practical applications.     

Limitations of discrete-time quantum walk on a one-dimensional infinite chain

How well can we manipulate the state of a particle via a discrete-time quantum walk? We show that the discrete-time quantum walk on a one-dimensional infinite chain with coin operators that are independent of the position can only realize product operators of the form $e^{i\xi }A?{\mathbb{1}}_p$, which cannot change the position state of the walker. We present a scheme to construct all possible realizations of all the product operators of the form $e^{i\xi }A?{\mathbb{1}}_p$. When the coin operators are dependent on the position, we show that the translation operators on the position can not be realized via a DTQW with coin operators that are either the identity operator $\mathbb{1}$ or the Pauli operator ${\sigma }_x$.     

Two-site quantum random walk

We study the measure theory of a two-site quantum random walk. The truncated decoherence functional defines a quantum measure μ _n on the space of n-paths, and the μ _n in turn induce a quantum measure μ on the cylinder sets within the space Ω of untruncated paths. Although μ cannot be extended to a continuous quantum measure on the full σ-algebra generated by the cylinder sets, an important question is whether it can be extended to sufficiently many physically relevant subsets of Ω in a systematic way. We begin an investigation of this problem by showing that μ can be extended to a quantum measure on a “quadratic algebra” of subsets of Ω that properly contains the cylinder sets. We also present a new characterization of the quantum integral on the n-path space.     

Scattering quantum random walk

Random processes are of interest not only from the theoretical point of view but also for practical use in algorithms for investigating large combinatorial structures. The theory of quantum computing requires implementation of classical algorithms using quantum-mechanical devices, and random walk is an obvious candidate. We present a model for quantum random walk that is based on an interferometric analogy, can be easily implemented, and is a generalization of a former model of quantum random walk proposed by Aharonov and colleagues.     

Stopping time of a one-dimensional bounded quantum walk

The stopping time of a one-dimensional bounded classical random walk(RW) is defined as the number of steps taken by a random walker to arrive at a fixed boundary for the first time.A quantum walk(QW) is a non-trivial generalization of RW,and has attracted a great deal of interest from researchers working in quantum physics and quantum information.In this paper,we develop a method to calculate the stopping time for a one-dimensional QW.Using our method,we further compare the properties of stopping time for QW and RW.We find that the mean value of the stopping time is the same for both of these problems.However,for short times,the probability for a walker performing a QW to arrive at the boundary is larger than that for a RW.This means that,although the mean stopping time of a quantum and classical walker are the same,the quantum walker has a greater probability of arriving at the boundary earlier than the classical walker.     

Controllable coupling and quantum correlation dynamics of two double quantum dots coupled via a transmission line resonator

We propose a theoretical scheme to generate a controllable and switchable coupling between two double-quantum-dot (DQD) spin qubits by using a transmission line resonator (TLR) as a bus system. We study dynamical behaviors of quantum correlations described by entanglement correlation (EC) and discord correlation (DC) between two DQD spin qubits when the two spin qubits and the TLR are initially prepared in X-type quantum states and a coherent state, respectively. We demonstrate that in the EC death regions there exist DC stationary states in which the stable DC amplification or degradation can be generated during the dynamical evolution. It is shown that these DC stationary states can be controlled by initial-state parameters, the coupling, and detuning between qubits and the TLR. We reveal the full synchronization and anti-synchronization phenomena in the EC and DC time evolution, and show that the EC and DC synchronization and anti-synchronization depends on the initial-state parameters of the two DQD spin qubits. It is shown that the initial quantum correlation may be suppressed completely when the evolution time approaches to the infinity in the presence of dissipation. These results shed new light on dynamics of quantum correlations.     

Quasiperiodic route to chaotic dynamics of internet transport protocols

We show that the dynamics of transmission control protocol (TCP) may often be chaotic via a quasiperiodic route consisting of more than two independent frequencies, by employing a commonly used ns-2 network simulator. To capture the essence of the additive increase and multiplicative decrease mechanism of TCP congestion control, and to qualitatively describe why and when chaos may occur in TCP dynamics, we develop a 1D discrete map. The relevance of these chaotic transport dynamics to real Internet connections is discussed.     

Edge states in a two-dimensional quantum walk with disorder

We investigate the effect of spatial disorder on the edge states localized at the interface between two topologically different regions. Rotation disorder can localize the quantum walk if it is strong enough to change the topology, otherwise the edge state is protected. Nonlinear spatial disorder, dependent on the walker’s state, attracts the walk to the interface even for very large coupling, preserving the ballistic transport characteristic of the clean regime.     

Two models of quantum random walk

We present an overview of two models of quantum random walk. In the first model, the discrete quantum random walk, we present the explicit solution for the recurring amplitude of the quantum random walk on a one-dimensional lattice. We also introduce a new method of solving the problem of random walk in the most general case and use it to derive the hitting amplitude for quantum random walk on the hypercube. The second is a special model based on a local interaction between neighboring spin-1/2 particles on a one-dimensional lattice. We present explicit results for the relevant quantities and obtain an upper bound on the speed of convergence to limiting probability distribution.     

星图上的散射量子行走搜索算法

量子行走是一种典型的量子计算模型, 近年来开始受到量子计算理论研究者们的广泛关注. 本文首先证明了在星图上硬币量子行走与散射量子行走的酉等价关系, 之后提出了一个在星图上的散射量子行走搜索算法. 该算法的时间复杂度与Grover算法相同, 但是当搜索的目标数目多于总数的1/3时搜索成功概率大于Grover算法.     

Random walk versus random line

We consider random walks X_n in Z₊, obeying a detailed balance condition, with a weak drift towards the origin when X_n↗∞. We reconsider the equivalence in law between a random walk bridge and a 1+1 dimensional Solid-On-Solid bridge with a corresponding Hamiltonian. Phase diagrams are discussed in terms of recurrence versus wetting. A drift of the random walk yields a Solid-On-Solid potential with an attractive well at the origin and a repulsive tail at infinity, showing complete wetting for δ≤1 and critical partial wetting for δ>1.     

A short walk through quantum optomechanics

This paper gives a brief review of the basic physics of quantum optomechanics and provides an overview of some of its recent developments and current areas of focus. It first outlines the basic theory of cavity optomechanical cooling and gives a brief status report of the experimental state‐of‐the‐art. It then turns to the deep quantum regime of operation of optomechanical oscillators and covers selected aspects of quantum state preparation, control and characterization, including mechanical squeezing and pulsed optomechanics. This is followed by a discussion of the “bottom‐up” approach that exploits ultracold atomic samples instead of nanoscale systems. It concludes with an outlook that concentrates largely on the functionalization of quantum optomechanical systems and their promise in metrology applications.     

Fractional recurrence in discrete-time quantum walk

Quantum recurrence theorem holds for quantum systems with discrete energy eigenvalues and fails to hold in general for systems with continuous energy. We show that during quantum walk process dominated by interference of amplitude corresponding to different paths fail to satisfy the complete quantum recurrence theorem. Due to the revival of the fractional wave packet, a fractional recurrence characterized using quantum Pólya number can be seen.     

Random turn walk on a half line with creation of particles at the origin

We consider a version of random motion of hard core particles on the semi-lattice 1,2,3,… , where in each time instant one of three possible events occurs, viz., (a) a randomly chosen particle hops to a free neighboring site, (b) a particle is created at the origin (namely, at site 1) provided that site 1 is free and (c) a particle is eliminated at the origin (provided that the site 1 is occupied). Relations to the BKP equation are explained. Namely, the tau functions of two different BKP hierarchies provide generating functions respectively (I) for transition weights between different particle configurations and (II) for an important object: a normalization function which plays the role of the statistical sum for our non-equilibrium system. For time t→∞ we obtain the asymptotic configuration of particles obtained from the initial empty state (the state without particles).     

Random walk on a random walk

The authors investigate the random walk of a particle on a one-dimensional chain which has been constructed by a random-walk procedure. Exact expressions are given for the mean-square displacement and the fourth moment after n steps. The probability density after n steps is derived in the saddle-point approximation, for large n. These quantities have also been studied by numerical simulation. The extension to continuous time has been made where the particle jumps according to a Poisson process. The exact solution for the self-correlation function has been obtained in the Fourier and Laplace domain. The resulting frequency-dependent diffusion coefficient and incoherent dynamical structure factor have been discussed. The model of random walk on a random walk is applied to self-diffusion in the concentrated one-dimensional lattice gas where the correct asymptotic behavior is found.     

Simulation of euclidean quantum field theories by a random walk process

A new Monte Carlo method for euclidean lattice field theory is introduced by writing the Boltzmann distribution e^?s as a solution of a diffusion type equation and constructing the associated random walk process. It is practically tested for a quantum mechanical model and a non-compact version of lattice QCD. It is explained where the main interest in this algorithm lies: the diffusion process coming from an action that can be generalized to include non-conservative forces. This possibility is exploited in our QCD version to implement gauge fixing without Faddeev-Popov ghosts.     

Two-particle bosonic-fermionic quantum walk via integrated photonics

Quantum walk represents one of the most promising resources for the simulation of physical quantum systems, and has also emerged as an alternative to the standard circuit model for quantum computing. Here we investigate how the particle statistics, either bosonic or fermionic, influences a two-particle discrete quantum walk. Such an experiment has been realized by exploiting polarization entanglement to simulate the bunching-antibunching feature of noninteracting bosons and fermions. To this scope a novel three-dimensional geometry for the waveguide circuit is introduced, which allows accurate polarization independent behavior, maintaining remarkable control on both phase and balancement.     

Directional quantum random walk induced by coherence

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 non-binomial 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 distribution in QRW for different initial coin states with the coin operator chosen as Hadamard matrix. In one-dimensional case, the walker's position is the asymmetric binomial distribution. We further demonstrate that in QRW, coherence leads the walker to perform directional movement. For an initially decoherenced coin state, the walker's position distribution is exactly the same as that of CRW. Moreover, we study QRW in 2D lattice, where the coherence plays a more diversified role in the walker's position distribution.     

Finding tree symmetries using continuous-time quantum walk

Quantum walk, the quantum counterpart of random walk, is an important model and widely studied to develop new quantum algorithms. This paper studies the relationship between the continuous-time quantum walk and the symmetry of a graph, especially that of a tree. Firstly, we prove in mathematics that the symmetry of a graph is highly related to quantum walk. Secondly, we propose an algorithm based on the continuous-time quantum walk to compute the symmetry of a tree. Our algorithm has better time complexity O(N3) than the current best algorithm. Finally, through testing three types of 10024 trees, we find that the symmetry of a tree can be found with an extremely high efficiency with the help of the continuous-time quantum walk.