Optimal Quantum Spatial Search With One-Dimensional Long-Range Interactions
PHYSICAL REVIEW LETTERS(2021)
摘要
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(root 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(root n) run time and high fidelity, is possible in one-dimensional spin chains with long-range interactions that decay as 1/r(a) with distance r. In particular, near unit fidelity is achieved for alpha approximate to 1 and, in the limit n -> infinity, we find a continuous transition from a region where optimal spatial search does exist (alpha < 1.5) to where it does not (alpha > 15). Numerically, we show that spatial search is robust to dephasing noise and that, for reasonable chain lengths, alpha less than or similar to 1.2 should be sufficient to demonstrate optimal spatial search experimentally with near unit fidelity.
更多查看译文
关键词
optimal quantum,spatial search,one-dimensional,long-range
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络