Lackadaisical discrete-time quantum walk on Johnson graph

Fangjie Peng, Meng Li and Xiaoming Sun

Physica A: Statistical Mechanics and its Applications, 2024, vol. 635, issue C

Abstract: Quantum walk is widely used in search problems, and it has an ideal acceleration effect compared with classical algorithm. Suppose there is a marked vertex w on Johnson graph J(n,k), we hope to find w using quantum walk. We adopt the coined quantum walk model, and we have proved that, for fixed order k, lackadaisical discrete-time quantum walk (DTQW) can find w with success probability 1−o(1), keeping a quadratic speedup. Before this paper, the best result of DTQW is that discrete-time quantum walk finds w with success probability 12−o(1). We improve the success probability to 1−o(1) by adding self-loops with proper weights and choose the appropriate oracle operator. Our result also matches the result of continuous-time quantum walk.

Keywords: Discrete-time quantum walk; Johnson graph; Quadratic speedup (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437124000037
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:635:y:2024:i:c:s0378437124000037

DOI: 10.1016/j.physa.2024.129495

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().