Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics

Exact transition operators for Markov and lattice Schrödinger processes constrained by a boundary

Joel Yellin

Published Feb 1, 1996• 0 citations
Publisher

Abstract

A closed form is given for a three-parameter family of transition matrices describing continuous-time nonsymmetric random walks on a $d=1$ semi-infinite lattice. The boundary conditions are general, allowing for an arbitrary mixture of reflection, trapping, and sojourn. Special cases give the quantum propagator for the half-lattice, and transition matrices for the random walk on the Bethe lattice and the single-server queue $\frac{\frac{M}{M}}{\frac{1}{\ensuremath{\infty}}}$.

DOI
10.1103/physreve.53.r1309

Related papers

Transitional probabilities for the four-state random walk on a lattice in the presence of partially reflecting boundaries

Ramakrishna Janaswamy

The four-state random walk (4RW) model, wherein the particle is endowed with two states of spin and two states of directional motion in each space coordinate, permits a stochastic solution of the Schrödinger equation (or the equivalent parabolic equation) without resorting to the usual analytical continuation in complex space of the particle trajectories. Analytical expressions are derived here for the various transitional probabilities in a 4RW by employing generating functions and eigenfunction expansions when the particle moves on a 1+1 space-time lattice with two-point boundary conditions. The most general case of dissimilar boundaries with partially reflecting boundary conditions is treated in this paper. The transitional probabilities are all expressed in terms of a finite summation involving trigonometric functions and/or Chebyshev polynomials of the second kind that are characteristics of diffusion and Schrödinger equations, respectively, in the 4RW model. Results for the special case of perfectly absorbing boundaries are compared to numerical values obtained by directly counting paths in the random walk simulations.

Journal of Mathematical Physics•May 1, 2009•1 citation

A path integral formula with applications to quantum random walks inZd

Wei-Shih Yang, Chaobin Liu, Kai Zhang

We consider general quantum random walks in a d -dimensional half-space. We first obtain a path integral formula for general quantum random walks in a d -dimensional space. Our path integral formula is valid for general quantum random walks on Cayley graphs as well. Then the path integral formula is applied to obtain the scaling limit of the exit distribution, the expectation of exit time and the asymptotic behaviour of the exit probabilities, for general quantum random walks in a half-space under some conditions on amplitude functions. The conditions are shown to be satisfied by both the Hadamard and Grover quantum random walks in two-dimensional half-spaces. For the two-dimensional case, we show that the critical exponent for the scaling limit of the hitting distribution is 1 as the lattice spacing tends to zero, i.e. the natural magnitude of the hitting position is of order O (1) if the lattice spacing is set to be 1/ n . We also show that the rate of convergence of the total hitting probability has lower bound n −2 and upper bound n −2+ for any > 0. For a quantum random walk with a fixed starting point, we show that the probability of hitting times at the hyperplane decays faster than that of the classical random walk. In both one and two dimensions, given the event of a hit, the conditional expectation of hitting times is finite, in contrast to being infinite for the classical case. In the one-dimensional case, we also obtain an exact order of the probability distribution of the hitting time at 0.

Journal of Physics A Mathematical and Theoretical•Jul 3, 2007•11 citations

Spacetime structures of continuous-time quantum walks

Oliver Mülken, A. Blumen

The propagation by continuous-time quantum walks (CTQWs) on one-dimensional lattices shows structures in the transition probabilities between different sites reminiscent of quantum carpets. For a system with periodic boundary conditions, we calculate the transition probabilities for a CTQW by diagonalizing the transfer matrix and by a Bloch function ansatz. Remarkably, the results obtained for the Bloch function ansatz can be related to results from (discrete) generalized coined quantum walks. Furthermore, we show that here the first revival time turns out to be larger than for quantum carpets.

arXiv:quant-ph/0502004•Physical Review E•Mar 22, 2005•65 citations

N-species stochastic models with boundaries and quadratic algebras

F C Alcaraz, S Dasmahapatra, V Rittenberg

Stationary probability distributions for stochastic processes on linear chains with closed or open ends are obtained using the matrix product ansatz. The matrices are representations of some quadratic algebras. The algebras and the types of representations considered depend on the boundary conditions. In the language of quantum chains we obtain the ground state of N -state quantum chains with free boundary conditions or with non-diagonal boundary terms at one or both ends. In contrast to problems involving the Bethe ansatz, we do not have a general framework for arbitrary N , which when specialized, gives the known results for N = 2; in fact, the N = 2 and N>2 cases appear to be very different.

arXiv:cond-mat/9705172•Journal of Physics A Mathematical and General•Jan 23, 1998•55 citations

One-dimensional continuous-time quantum Markov chains: qubit probabilities and measures

Manuel D. de la Iglesia, Carlos F. Lardizabal

Abstract Quantum Markov chains (QMCs) are positive maps on a trace-class space describing open quantum dynamics on graphs. Such objects have a statistical resemblance with classical random walks, while at the same time they allow for internal (quantum) degrees of freedom. In this work we study continuous-time QMCs on the integer line, half-line and finite segments, so that we are able to obtain exact probability calculations in terms of the associated matrix-valued orthogonal polynomials and measures. The methods employed here are applicable to a wide range of settings, but we will restrict ourselves to classes of examples for which the Lindblad generators are induced by a single positive map, and such that the Stieltjes transforms of the measures and their inverses can be calculated explicitly.

arXiv:2402.15878•Journal of Physics A Mathematical and Theoretical•Jun 25, 2024•2 citations

On aggregation-quantization permutability problem for discrete-time Markov chains

Adam Doliwa, Artur Siemaszko, Adam Zalewski

Given random walk on a graph, the corresponding discrete-time quantum walk can be constructed using the method proposed by Szegedy. On the other hand, given a partition of the set of states of a Markov chain, one can study the corresponding aggregated process. We extend the aggregation technique to the level of quantum Markov chains. We provide conditions under which application of these two operations - Szegedy's quantization and aggregation - give the same result. These consist of the strong lumpability of the underlying Markov chain supplemented by nonlinear relations, generalizing Kolmogorov's cycle condition, that account for the coefficients of both the original and the aggregated transition matrices. In particular, we show that the conditions are satisfied in the case of the random walk on graphs equipped with equitable partitions. We present several examples, which include the classical/quantum walks on Platonic solids. We discuss also relation of discrete-time classical/quantum walks on $N$-dimensional hypercube and the Ehrenfests urn model with $N$ particles. We apply our technique for of discrete-time walks on Cayley graphs of free groups. We also compare our results with those obtained using Cantero-Moral-Velazquez uniformization of unitary matrices.

quant-pharXiv:2603.14269•Mar 17, 2026•0 citations
A closed form is given for a three-parameter family of transition matrices describing continuous-time nonsymmetric random walks on a d=1d=1d=1 semi-infinite lattice. The boundary conditions are general, allowing for an arbitrary mixture of reflection, trapping, and sojourn. Special cases give the quantum propagator for the half-lattice, and transition matrices for the random walk on the Bethe lattice and the single-server queue MM1\ensuremath∞\frac{\frac{M}{M}}{\frac{1}{\ensuremath{\infty}}}\ensuremath∞1​MM​​.
The four-state random walk (4RW) model, wherein the particle is endowed with two states of spin and two states of directional motion in each space coordinate, permits a stochastic solution of the Schrödinger equation (or the equivalent parabolic equation) without resorting to the usual analytical continuation in complex space of the particle trajectories. Analytical expressions are derived here for the various transitional probabilities in a 4RW by employing generating functions and eigenfunction expansions when the particle moves on a 1+1 space-time lattice with two-point boundary conditions. The most general case of dissimilar boundaries with partially reflecting boundary conditions is treated in this paper. The transitional probabilities are all expressed in terms of a finite summation involving trigonometric functions and/or Chebyshev polynomials of the second kind that are characteristics of diffusion and Schrödinger equations, respectively, in the 4RW model. Results for the special case of perfectly absorbing boundaries are compared to numerical values obtained by directly counting paths in the random walk simulations.
We consider general quantum random walks in a d -dimensional half-space. We first obtain a path integral formula for general quantum random walks in a d -dimensional space. Our path integral formula is valid for general quantum random walks on Cayley graphs as well. Then the path integral formula is applied to obtain the scaling limit of the exit distribution, the expectation of exit time and the asymptotic behaviour of the exit probabilities, for general quantum random walks in a half-space under some conditions on amplitude functions. The conditions are shown to be satisfied by both the Hadamard and Grover quantum random walks in two-dimensional half-spaces. For the two-dimensional case, we show that the critical exponent for the scaling limit of the hitting distribution is 1 as the lattice spacing tends to zero, i.e. the natural magnitude of the hitting position is of order O (1) if the lattice spacing is set to be 1/ n . We also show that the rate of convergence of the total hitting probability has lower bound n −2 and upper bound n −2+ for any > 0. For a quantum random walk with a fixed starting point, we show that the probability of hitting times at the hyperplane decays faster than that of the classical random walk. In both one and two dimensions, given the event of a hit, the conditional expectation of hitting times is finite, in contrast to being infinite for the classical case. In the one-dimensional case, we also obtain an exact order of the probability distribution of the hitting time at 0.
The propagation by continuous-time quantum walks (CTQWs) on one-dimensional lattices shows structures in the transition probabilities between different sites reminiscent of quantum carpets. For a system with periodic boundary conditions, we calculate the transition probabilities for a CTQW by diagonalizing the transfer matrix and by a Bloch function ansatz. Remarkably, the results obtained for the Bloch function ansatz can be related to results from (discrete) generalized coined quantum walks. Furthermore, we show that here the first revival time turns out to be larger than for quantum carpets.
Stationary probability distributions for stochastic processes on linear chains with closed or open ends are obtained using the matrix product ansatz. The matrices are representations of some quadratic algebras. The algebras and the types of representations considered depend on the boundary conditions. In the language of quantum chains we obtain the ground state of N -state quantum chains with free boundary conditions or with non-diagonal boundary terms at one or both ends. In contrast to problems involving the Bethe ansatz, we do not have a general framework for arbitrary N , which when specialized, gives the known results for N = 2; in fact, the N = 2 and N>2 cases appear to be very different.
Abstract Quantum Markov chains (QMCs) are positive maps on a trace-class space describing open quantum dynamics on graphs. Such objects have a statistical resemblance with classical random walks, while at the same time they allow for internal (quantum) degrees of freedom. In this work we study continuous-time QMCs on the integer line, half-line and finite segments, so that we are able to obtain exact probability calculations in terms of the associated matrix-valued orthogonal polynomials and measures. The methods employed here are applicable to a wide range of settings, but we will restrict ourselves to classes of examples for which the Lindblad generators are induced by a single positive map, and such that the Stieltjes transforms of the measures and their inverses can be calculated explicitly.
Given random walk on a graph, the corresponding discrete-time quantum walk can be constructed using the method proposed by Szegedy. On the other hand, given a partition of the set of states of a Markov chain, one can study the corresponding aggregated process. We extend the aggregation technique to the level of quantum Markov chains. We provide conditions under which application of these two operations - Szegedy's quantization and aggregation - give the same result. These consist of the strong lumpability of the underlying Markov chain supplemented by nonlinear relations, generalizing Kolmogorov's cycle condition, that account for the coefficients of both the original and the aggregated transition matrices. In particular, we show that the conditions are satisfied in the case of the random walk on graphs equipped with equitable partitions. We present several examples, which include the classical/quantum walks on Platonic solids. We discuss also relation of discrete-time classical/quantum walks on NNN-dimensional hypercube and the Ehrenfests urn model with NNN particles. We apply our technique for of discrete-time walks on Cayley graphs of free groups. We also compare our results with those obtained using Cantero-Moral-Velazquez uniformization of unitary matrices.