arXiv · 2009.13309
Comment to Spatial Search by Quantum Walk is Optimal for Almost all Graphs
Abstract
This comment is to correct the proof of optimality of quantum spatial search for Erdős-Rényi graphs presented in `Spatial Search by Quantum Walk is Optimal for Almost all Graphs' (https://doi.org/10.1103/PhysRevLett.116.100501). The authors claim that if $p\geq \frac{\log^{3/2}(n)}{n}$, then the CTQW-based search is optimal for almost all graphs. Below we point the issues found in the main paper, and propose corrections, which in fact improve the result to $p=ω(\log(n)/n)$ in case of transition rate $γ= 1/λ_1$. In the case of the proof for simplified transition rate $1/(np)$ we pointed a possible issue with applying perturbation theory.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ryszard Kukulski, Adam Glos. 2020-09-28. Comment to Spatial Search by Quantum Walk is Optimal for Almost all Graphs. https://arxiv.org/abs/2009.13309
Cite the original work for its findings. Save a collection to share your selection of sources.