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

arXiv:2011.08767

Mapping a finite and an infinite Hadamard quantum walk onto a unique case of a random walk process

Arie Bar-Haim

Published Nov 17, 2020• 0 citations
arXivHTMLPDF

Abstract

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 model. The random walk model and its equivalence to a Hadamard walk can be extended for other cases, such as a finite chain with two reflecting points

DOI
10.48550/arxiv.2011.08767

Related papers

Mapping a Hadamard Quantum Walk to a Unique Case of a Birth and Death Process

Arie Bar-Haim

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 |0>, 1> are revealed. Thus, the new model has two unique properties: it reveals the probability distribution of the quantum states as a unitary system and preserves the population distribution of the random walker as a Markovian system.

arXiv:2104.04286•Apr 9, 2021•0 citations

Mapping quantum random walks onto a Markov chain by mapping a unitary transformation to a higher dimension of an irreducible matrix

Arie Bar-Haim

Here, a new two-dimensional process, discrete in time and space, that yields the results of both a random walk and a quantum random walk, is introduced. This model describes the population distribution of four coin states |1>,-|1>, |0> -|0> in space without interference, instead of two coin states |1>, |0> .For the case of no boundary conditions, the model is similar to a Markov chain with a stochastic matrix, i.e., it conserves the population distribution of the four coin states, and by using a proper transformation, yield probability distributions of the two quantum states |1>, |0> in space, similar to a unitary operator. Numerical results for a quantum random walk on infinite and finite lines are introduced.

arXiv:2006.11090•Jun 19, 2020•2 citations

Probability distributions for Markov chain based quantum walks

Radhakrishnan Balu, Chaobin Liu, Salvador Elías Venegas-Andraca

Abstract We analyze the probability distributions of the quantum walks induced from Markov chains by Szegedy (2004). The first part of this paper is devoted to the quantum walks induced from finite state Markov chains. It is shown that the probability distribution on the states of the underlying Markov chain is always convergent in the Cesaro sense. In particular, we deduce that the limiting distribution is uniform if the transition matrix is symmetric. In the case of a non-symmetric Markov chain, we exemplify that the limiting distribution of the quantum walk is not necessarily identical with the stationary distribution of the underlying irreducible Markov chain. The Szegedy scheme can be extended to infinite state Markov chains (random walks). In the second part, we formulate the quantum walk induced from a lazy random walk on the line. We then obtain the weak limit of the quantum walk. It is noted that the current quantum walk appears to spread faster than its counterpart-quantum walk on the line driven by the Grover coin discussed in literature. The paper closes with an outlook on possible future directions.

arXiv:1703.04131•Journal of Physics A Mathematical and Theoretical•Nov 10, 2017•14 citations

Quantum Markov chains

Stanley Gudder

A new approach to quantum Markov chains is presented. We first define a transition operation matrix (TOM) as a matrix whose entries are completely positive maps whose column sums form a quantum operation. A quantum Markov chain is defined to be a pair (G,E) where G is a directed graph and E=[Eij] is a TOM whose entry Eij labels the edge from vertex j to vertex i. We think of the vertices of G as sites that a quantum system can occupy and Eij is the transition operation from site j to site i in one time step. The discrete dynamics of the system is obtained by iterating the TOM E. We next consider a special type of TOM called a transition effect matrix. In this case, there are two types of dynamics, a state dynamics and an operator dynamics. Although these two types are not identical, they are statistically equivalent. We next give examples that illustrate various properties of quantum Markov chains. We conclude by showing that our formalism generalizes the usual framework for quantum random walks.

Journal of Mathematical Physics•Jul 1, 2008•106 citations

Symmetry of Distribution for the One-Dimensional Hadamard Walk

Norio Konno, Takao Namiki, Takahiro Soshi

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.

arXiv:quant-ph/0205065•Interdisciplinary Information Sciences•Jan 1, 2004•44 citations

Characterizing the Relationship Between Unitary Quantum Walks and Non-Homogeneous Random Walks

Matheus Guedes de Andrade, Franklin de Lima Marquezino, Daniel R. Figueiredo

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the relationship between quantum and random walks has been recently discussed in specific scenarios, this work establishes a formal equivalence between the two processes on arbitrary finite graphs and general conditions for shift and coin operators. It requires empowering random walks with time heterogeneity, where the transition probability of the walker is non-uniform and time dependent. The equivalence is obtained by equating the probability of measuring the quantum walk on a given node of the graph and the probability that the random walk is at that same node, for all nodes and time steps. The first result establishes procedure for a stochastic matrix sequence to induce a random walk that yields the exact same vertex probability distribution sequence of any given quantum walk, including the scenario with multiple interfering walkers. The second result establishes a similar procedure in the opposite direction. Given any random walk, a time-dependent quantum walk with the exact same vertex probability distribution is constructed. Interestingly, the matrices constructed by the first procedure allows for a different simulation approach for quantum walks where node samples respect neighbor locality and convergence is guaranteed by the law of large numbers, enabling efficient (polynomial-time) sampling of quantum graph trajectories. Furthermore, the complexity of constructing this sequence of matrices is discussed in the general case.

•Jun 29, 2021•0 citations
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 model. The random walk model and its equivalence to a Hadamard walk can be extended for other cases, such as a finite chain with two reflecting points
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 |0>, 1> are revealed. Thus, the new model has two unique properties: it reveals the probability distribution of the quantum states as a unitary system and preserves the population distribution of the random walker as a Markovian system.
Here, a new two-dimensional process, discrete in time and space, that yields the results of both a random walk and a quantum random walk, is introduced. This model describes the population distribution of four coin states |1>,-|1>, |0> -|0> in space without interference, instead of two coin states |1>, |0> .For the case of no boundary conditions, the model is similar to a Markov chain with a stochastic matrix, i.e., it conserves the population distribution of the four coin states, and by using a proper transformation, yield probability distributions of the two quantum states |1>, |0> in space, similar to a unitary operator. Numerical results for a quantum random walk on infinite and finite lines are introduced.
Abstract We analyze the probability distributions of the quantum walks induced from Markov chains by Szegedy (2004). The first part of this paper is devoted to the quantum walks induced from finite state Markov chains. It is shown that the probability distribution on the states of the underlying Markov chain is always convergent in the Cesaro sense. In particular, we deduce that the limiting distribution is uniform if the transition matrix is symmetric. In the case of a non-symmetric Markov chain, we exemplify that the limiting distribution of the quantum walk is not necessarily identical with the stationary distribution of the underlying irreducible Markov chain. The Szegedy scheme can be extended to infinite state Markov chains (random walks). In the second part, we formulate the quantum walk induced from a lazy random walk on the line. We then obtain the weak limit of the quantum walk. It is noted that the current quantum walk appears to spread faster than its counterpart-quantum walk on the line driven by the Grover coin discussed in literature. The paper closes with an outlook on possible future directions.
A new approach to quantum Markov chains is presented. We first define a transition operation matrix (TOM) as a matrix whose entries are completely positive maps whose column sums form a quantum operation. A quantum Markov chain is defined to be a pair (G,E) where G is a directed graph and E=[Eij] is a TOM whose entry Eij labels the edge from vertex j to vertex i. We think of the vertices of G as sites that a quantum system can occupy and Eij is the transition operation from site j to site i in one time step. The discrete dynamics of the system is obtained by iterating the TOM E. We next consider a special type of TOM called a transition effect matrix. In this case, there are two types of dynamics, a state dynamics and an operator dynamics. Although these two types are not identical, they are statistically equivalent. We next give examples that illustrate various properties of quantum Markov chains. We conclude by showing that our formalism generalizes the usual framework for quantum random walks.
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the relationship between quantum and random walks has been recently discussed in specific scenarios, this work establishes a formal equivalence between the two processes on arbitrary finite graphs and general conditions for shift and coin operators. It requires empowering random walks with time heterogeneity, where the transition probability of the walker is non-uniform and time dependent. The equivalence is obtained by equating the probability of measuring the quantum walk on a given node of the graph and the probability that the random walk is at that same node, for all nodes and time steps. The first result establishes procedure for a stochastic matrix sequence to induce a random walk that yields the exact same vertex probability distribution sequence of any given quantum walk, including the scenario with multiple interfering walkers. The second result establishes a similar procedure in the opposite direction. Given any random walk, a time-dependent quantum walk with the exact same vertex probability distribution is constructed. Interestingly, the matrices constructed by the first procedure allows for a different simulation approach for quantum walks where node samples respect neighbor locality and convergence is guaranteed by the law of large numbers, enabling efficient (polynomial-time) sampling of quantum graph trajectories. Furthermore, the complexity of constructing this sequence of matrices is discussed in the general case.