Optimal Quantum Spatial Search with One-Dimensional Long-Range Interactions
Dylan Lewis, Asmae Benhemou, Natasha Feinstein, Leonardo Banchi, Sougato Bose · arXiv (Cornell University) · 2020
Continuous-time quantum walks can be used to solve the spatial search problem, which is an essential component for many quantum algorithms that run quadratically faster than their classical counterpart, in O(n) time for n entries. However, the capability of models found in nature is largely unexplored - e.g., in one dimension only nearest-neighbor Hamiltonians have been considered so far, for which the quadratic speedup does not exist. Here, we prove that optimal spatial search, namely with O(n) run time and high fidelity, is possible in one-dimensional spin chains with long-range interactions that decay as 1/rα with distance r. In particular, near unit fidelity is achieved for α≈1 and, in the limit n→∞, we find a continuous transition from a region where optimal spatial search does exist (α1.5). Numerically, we show that spatial search is robust to dephasing noise and that, for reasonable chain lengths, α≲1.2 should be sufficient to demonstrate optimal spatial search experimentally with near unit fidelity.