Metraipolis › archive › dc_de63b469dcd2
Gate-level Implementation and Resource Analysis of Lackadaisical Quantum Walk Search — arXiv:2608.17136
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.17136
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T15:38:39.937Z
- SHA-256 of the archived text
53bd8bc3bfcf3db15adab7c670fd9ed9044470b90d7a54dcda4e5ff5f7836bc9- Stable URL of this page
https://metraipolis.com/documento/dc_de63b469dcd2
How to cite
Gate-level Implementation and Resource Analysis of Lackadaisical Quantum Walk Search — arXiv:2608.17136 — arXiv (en), https://arxiv.org/abs/2608.17136 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_de63b469dcd2 (Metraipolis archive dc_de63b469dcd2, sha256 53bd8bc3bfcf3db15adab7c670fd9ed9044470b90d7a54dcda4e5ff5f7836bc9)
BibTeX
@misc{dcde63b469dcd2,
title = {Gate-level Implementation and Resource Analysis of Lackadaisical Quantum Walk Search — arXiv:2608.17136},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.17136},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_de63b469dcd2; sha256 53bd8bc3bfcf3db15adab7c670fd9ed9044470b90d7a54dcda4e5ff5f7836bc9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.17136. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Lackadaisical quantum walks (LQW) extend discrete-time quantum walks (DTQW) by introducing weighted self-loops, enabling improved spatial-search performance through controlled localization of the walker. Despite substantial theoretical progress, practical gate-level implementations suitable for quantum hardware remain largely unexplored, limiting evaluation under realistic architectural constraints, noise, and resource requirements. In this work, we present a gate-level implementation framework for lackadaisical quantum walk search. The proposed construction encodes the position and coin spaces into qubit registers, and realizes the walk dynamics through oracle, coin, and flip-flop shift operations. We validate the circuit by reproducing the expected search behavior for single and multiple marked vertices and by analyzing the effect of the self-loop weight on the success probability. We further evaluate the implementation under realistic noisy settings using superconducting hardware's noise models. Logical resource analysis shows that, for grids ranging from $8\times8$ to $64\times64$, the transpiled gate count increases from $3.63\times10^{5}$ to $4.38\times10^{6}$ and the circuit depth from $2.13\times10^{5}$ to $2.56\times10^{6}$. Finally, fault-tolerant resource estimates based on a surface-code model using the Microsoft Quantum Resource Estimator demonstrate the substantial space-time trade-off associated with magic-state production. The results establish a practical circuit-level pathway for implementing the LQW search and provide a basis for evaluating its performance.
Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-19 in cs.ET).
Categorie arXiv: Quantum Physics (quant-ph) ; Emerging Technologies (cs.ET).
Pagina del lavoro: https://arxiv.org/abs/2608.17136 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T15:38:20.238Z dalla pagina https://arxiv.org/catchup/cs.ET/2026-08-19?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).