Reproduce “Gate-level Implementation and Resource Analysis of Lackadaisical Quantum Walk Search” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Amit Saha, Debanjan Kola, Nishanka Das, Amlan Chakrabarti
This work presents a gate-level implementation and comprehensive resource analysis for lackadaisical quantum walk (LQW) search on 2D periodic grids. The study quantifies the logical and physical resource costs for realizing LQWs on quantum hardware, highlighting the challenges for practical deployment.
Key insights
- Logical resource analysis revealed that gate counts and circuit depth rapidly increase with grid size, primarily driven by complex multi-controlled operations within the oracle and flip-flop shift operators.
- Noisy simulations demonstrated that realistic noise substantially reduces marked-state success probability, and common noise mitigation techniques offer limited effectiveness for the deep LQW circuits.
- Fault-tolerant implementation of LQW search, even for modest grid sizes, demands substantial physical qubits and runtime due to non-Clifford operations and error correction overhead, indicating a significant space-time trade-off.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.