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:1412.6891 · Chinese Physics B

One-dimensional lazy quantum walks and occupancy rate

Dan Li, Michael Mc Gettrick, Weiwei Zhang, Ke-Jia Zhang

Published Apr 30, 2015• 15 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1674-1056/24/5/050305

Related papers

One-dimensional lazy quantum walks and occupancy rate

Li Dan, Michael Michael, M. C +3 more

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.

中国物理B：英文版•Jan 1, 2015•1 citation

One-dimensional lazy quantum walks and occupancy rate

Dan Li, Gettrick, Michael Mc, Weiwei Zhang +1 more

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.

•Sep 20, 2018•16 citations

One-dimensional discrete-time quantum walks with general coin

Mahesh N. Jayakody, Chandrakala Meena, Priodyuti Pradhan

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. 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 conducted on general coin operator also includes the popular coins -- Hadamard, Grover, and Fourier coins.

arXiv:2102.07207•Feb 14, 2021•1 citation

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

Mahesh N. Jayakody, Chandrakala Meena, Priodyuti Pradhan

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.

Physics Open•Nov 10, 2023•9 citations

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•5 citations

Quantum walks in higher dimensions

Troy D. Mackay, Stephen D. Bartlett, Leigh T. Stephenson +1 more

We analyse the quantum walk in higher spatial dimensions and compare classical and quantum spreading as a function of time. Tensor products of Hadamard transformations and the discrete Fourier transform arise as natural extensions of the 'quantum coin toss' in the one-dimensional walk simulation, and other illustrative transformations are also investigated. We find that entanglement between the dimensions serves to reduce the rate of spread of the quantum walk. The classical limit is obtained by introducing a random phase variable.

arXiv:quant-ph/0108004•Journal of Physics A Mathematical and General•Mar 15, 2002•255 citations
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.
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.
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.
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. 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 conducted on general coin operator also includes the popular coins -- Hadamard, Grover, and Fourier coins.
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.
We analyse the quantum walk in higher spatial dimensions and compare classical and quantum spreading as a function of time. Tensor products of Hadamard transformations and the discrete Fourier transform arise as natural extensions of the 'quantum coin toss' in the one-dimensional walk simulation, and other illustrative transformations are also investigated. We find that entanglement between the dimensions serves to reduce the rate of spread of the quantum walk. The classical limit is obtained by introducing a random phase variable.