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:2102.07207 · Physics Open

Revisiting one-dimensional discrete-time quantum walks with general coin

Mahesh N. Jayakody, Chandrakala Meena, Priodyuti Pradhan

Published Nov 10, 2023• 15 citations
arXivHTMLPDF

Abstract

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, constant in both space and time, and a localized initial state using numerical modeling. 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 provide an algorithm for the one-dimensional quantum walk driven by the general coin operator. The study on general coin operators also includes the popular coins – Hadamard, Grover, and Fourier.

DOI
10.1016/j.physo.2023.100189

Related papers

Quantum Walks on the Line with Phase Parameters

Marcos Villagra, Masaki Nakanishi, Shigeru Yamashita +1 more

In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step toward this objective, the following question is being addressed: Given a graph, what is the probability that a quantum walk arrives at a given vertex after some number of steps? This is a very natural question, and for random walks it can be answered by several different combinatorial arguments. For quantum walks this is a highly non-trivial task. Furthermore, this was only achieved before for one specific coin operator (Hadamard operator) for walks on the line. Even considering only walks on lines, generalizing these computations to a general SU(2) coin operator is a complex task. The main contribution is a closed-form formula for the amplitudes of the state of the walk (which includes the question above) for a general symmetric SU(2) operator for walks on the line. To this end, a coin operator with parameters that alters the phase of the state of the walk is defined. Then, closed-form solutions are computed by means of Fourier analysis and asymptotic approximation methods. We also present some basic properties of the walk which can be deducted using weak convergence theorems for quantum walks. In particular, the support of the induced probability distribution of the walk is calculated. Then, it is shown how changing the parameters in the coin operator affects the resulting probability distribution.

arXiv:1109.1866•IEICE Transactions on Information and Systems•Jan 1, 2012•4 citations

Directional quantum random walk induced by coherence

Jin-Fu Chen, Yu-Han Ma, Chang-Pu Sun

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.

arXiv:1907.12072•Frontiers of Physics•Jan 3, 2020•1 citation

The sojourn times of one dimensional discrete-time quantum walks

Shuiying Cai, Qingyu Huang, Yiwen Ye +2 more

Abstract In the existing literature, a sojourn time of a discrete-time quantum walk is not a random variable. To solve this problem, we redefine the sojourn time of a quantum walk where its coin evolution operator can be general. We first discuss a class of quantum walks governed by flip operators. We cumulatively calculate how much time a walker spends in the set of non-negative integers up to a fixed evolution time. Whether a walker makes a left or right evolution, we add up the staying times as long as it stays within the target set. We define a sojourn time as the total amount of the staying times. Compared with existing definitions, we show that this definition can satisfy the probability normalization. From this, we define a random variable about the sojourn time and discuss its probability distribution. We build a mathematical model to characterize a sojourn time that is embedded into a quantum walk. These results are also valid for a class of quantum walks governed by general coin operators. We also give a method for calculating the sojourn time and analyze the shape features of its probability distribution.

Laser Physics Letters•Aug 8, 2023•2 citations

A QUANTUM WALK WITH A DELOCALIZED INITIAL STATE: CONTRIBUTION FROM A COIN-FLIP OPERATOR

Takuya Machida

A unit evolution step of discrete-time quantum walks (QWs) is determined by both a coin-flip operator and a position-shift operator. The behavior of quantum walkers after many steps delicately depends on the coin-flip operator and an initial condition of the walk. To get the behavior, a lot of long-time limit distributions for the QWs starting with a localized initial state have been derived. In this paper, we compute limit distributions of a 2-state QW with a delocalized initial state, not a localized initial state, and discuss how the walker depends on the coin-flip operator. The initial state induced from the Fourier series expansion, which is called the (α, β) delocalized initial state in this paper, provides different limit density functions from the ones of the quantum walk with a localized initial state.

arXiv:1203.5396•International Journal of Quantum Information•Aug 1, 2013•7 citations

Randomizing Quantum Walk

Rashid Ahmad, Bibi, Safia, Uzma Sajjad

The evolution of a walker in standard "Discrete-time Quantum Walk (DTQW)" is determined by coin and shift unitary operators. The conditional shift operator shifts the position of the walker to right or left by unit step size while the direction of motion is specified by the coin operator. This scenario can be generalized by choosing the step size randomly at each step in some specific interval. For example, the value of the roll of a dice can be used to specify the step size after throwing the coin. Let us call such a quantum walk "Discrete-time Random Step Quantum Walk (DTRSQW)". A completely random probability distribution is obtained whenever the walker follows the DTRSQW. We have also analyzed two more types of quantum walks, the "Discrete-time Un-biased Quantum Walk (DTUBQW)" and the "Discrete-time Biased Quantum Walk (DTBQW)". In the first type, the step size is kept different than unit size but the same for left and right shifts, whereas in the second type left and right shifts can also be different. The probability distribution in DTUBQW is found to follow a certain rule. The standard deviation ($σ$) of DTRSQW is higher than DTQW and hence DTRSQW spreads faster. The $σ$ of DTUBQW shows sawtooth behavior with faster spread than DTQW for some specific values of rotation angles and steps.

arXiv:2003.00440•Mar 1, 2020•2 citations

Unveiling two-dimensional discrete quantum walks dynamics via dispersion relations

Sergio Cantero‐Chinchilla, A. Romanelli, Eugenio Roldán +1 more

The discrete, or coined, quantum walk (QW) [1] is a process originally introduced as the quantum counterpart of the classical random walk (RW). In both cases there is a walker and a coin: at every time step the coin is tossed and the walker moves depending on the toss output. Unlike the RW, in the QW the walker and coin are quantum in nature what allows the coherent superpositions right/left and head/tail happen.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•May 1, 2011•0 citations
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, constant in both space and time, and a localized initial state using numerical modeling. 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 provide an algorithm for the one-dimensional quantum walk driven by the general coin operator. The study on general coin operators also includes the popular coins – Hadamard, Grover, and Fourier.
In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step toward this objective, the following question is being addressed: Given a graph, what is the probability that a quantum walk arrives at a given vertex after some number of steps? This is a very natural question, and for random walks it can be answered by several different combinatorial arguments. For quantum walks this is a highly non-trivial task. Furthermore, this was only achieved before for one specific coin operator (Hadamard operator) for walks on the line. Even considering only walks on lines, generalizing these computations to a general SU(2) coin operator is a complex task. The main contribution is a closed-form formula for the amplitudes of the state of the walk (which includes the question above) for a general symmetric SU(2) operator for walks on the line. To this end, a coin operator with parameters that alters the phase of the state of the walk is defined. Then, closed-form solutions are computed by means of Fourier analysis and asymptotic approximation methods. We also present some basic properties of the walk which can be deducted using weak convergence theorems for quantum walks. In particular, the support of the induced probability distribution of the walk is calculated. Then, it is shown how changing the parameters in the coin operator affects the resulting probability distribution.
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.
Abstract In the existing literature, a sojourn time of a discrete-time quantum walk is not a random variable. To solve this problem, we redefine the sojourn time of a quantum walk where its coin evolution operator can be general. We first discuss a class of quantum walks governed by flip operators. We cumulatively calculate how much time a walker spends in the set of non-negative integers up to a fixed evolution time. Whether a walker makes a left or right evolution, we add up the staying times as long as it stays within the target set. We define a sojourn time as the total amount of the staying times. Compared with existing definitions, we show that this definition can satisfy the probability normalization. From this, we define a random variable about the sojourn time and discuss its probability distribution. We build a mathematical model to characterize a sojourn time that is embedded into a quantum walk. These results are also valid for a class of quantum walks governed by general coin operators. We also give a method for calculating the sojourn time and analyze the shape features of its probability distribution.
A unit evolution step of discrete-time quantum walks (QWs) is determined by both a coin-flip operator and a position-shift operator. The behavior of quantum walkers after many steps delicately depends on the coin-flip operator and an initial condition of the walk. To get the behavior, a lot of long-time limit distributions for the QWs starting with a localized initial state have been derived. In this paper, we compute limit distributions of a 2-state QW with a delocalized initial state, not a localized initial state, and discuss how the walker depends on the coin-flip operator. The initial state induced from the Fourier series expansion, which is called the (α, β) delocalized initial state in this paper, provides different limit density functions from the ones of the quantum walk with a localized initial state.
The evolution of a walker in standard "Discrete-time Quantum Walk (DTQW)" is determined by coin and shift unitary operators. The conditional shift operator shifts the position of the walker to right or left by unit step size while the direction of motion is specified by the coin operator. This scenario can be generalized by choosing the step size randomly at each step in some specific interval. For example, the value of the roll of a dice can be used to specify the step size after throwing the coin. Let us call such a quantum walk "Discrete-time Random Step Quantum Walk (DTRSQW)". A completely random probability distribution is obtained whenever the walker follows the DTRSQW. We have also analyzed two more types of quantum walks, the "Discrete-time Un-biased Quantum Walk (DTUBQW)" and the "Discrete-time Biased Quantum Walk (DTBQW)". In the first type, the step size is kept different than unit size but the same for left and right shifts, whereas in the second type left and right shifts can also be different. The probability distribution in DTUBQW is found to follow a certain rule. The standard deviation (σσσ) of DTRSQW is higher than DTQW and hence DTRSQW spreads faster. The σσσ of DTUBQW shows sawtooth behavior with faster spread than DTQW for some specific values of rotation angles and steps.