You're viewing papers too quickly. Please wait a moment.<br>This helps keep the archive available for everyone.

Quick Navigation

Topics

Quantum Algorithms

One dimensional lazy quantum walks and occupancy rate

arXiv
Authors: Dan Li, Michael Mc Gettrick, Wei-Wei Zhang, Ke-Jia Zhang

Year

2014

Paper ID

45764

Status

Preprint

Abstract Read

~2 min

Abstract Words

152

Citations

N/A

Abstract

Lazy quantum walks were presented by Andrew M. Childs to prove that the continuous-time quantum walk is a limit of the discrete-time quantum walk [Commun.Math.Phys.294,581-603(2010)]. In this paper, we discuss properties of lazy quantum walks. Our analysis shows that lazy quantum walks have O\(tn\) order of the n-th moment of the corresponding probability distribution, which is the same as that for normal quantum walks. Also, the lazy quantum walk with DFT (Discrete Fourier Transform) 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 lazy quantum walks have a higher occupancy rate than other walks such as normal quantum walks, classical walks and lazy classical walks.

Why This Paper Matters

  • It adds a 2014 reference point for readers tracking recent quantum research.
  • Lazy quantum walks were presented by Andrew M.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #45764 #69983 Spectral Leakage and Masking Ef... #69982 Dimensionality Reduction of QAO... #69981 A Hybrid Quantum-Classical Appr... #69980 Complexity Inequalities for Qua...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.