JILA, University of Colorado and National Institute of Standards and Technology, and Department of Physics, University of Colorado, Boulder, CO 80309, USA.
Department of Computer Science, University of Maryland, College Park, MD 20742, USA.
Science. 2022 Aug 19;377(6608):885-889. doi: 10.1126/science.abo0608. Epub 2022 Aug 18.
Quantum walks provide a framework for designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a walker traverses while maintaining coherence. We do this by combining the fast, programmable control provided by optical tweezers with the scalable, homogeneous environment of an optical lattice. With these tools we study continuous-time quantum walks of single atoms on a square lattice and perform proof-of-principle demonstrations of spatial search with these walks. When scaled to more particles, the capabilities demonstrated can be extended to study a variety of problems in quantum information science, including performing more effective versions of spatial search using a larger graph with increased connectivity.
量子漫步为设计量子算法提供了一个直观且通用的框架。为了利用这些漫步的计算能力，重要的是能够在保持相干性的同时，可编程地修改漫步所经过的图。我们通过将光学镊子提供的快速、可编程控制与光学晶格的可扩展、均匀环境相结合来实现这一点。利用这些工具，我们研究了正方形晶格上单原子的连续时间量子漫步，并对这些漫步进行了空间搜索的原理验证演示。当扩展到更多的粒子时，所展示的能力可以扩展到研究量子信息科学中的各种问题，包括使用具有更高连通性的更大图来执行更有效的空间搜索版本。
