Dylan Lewis

Optimal Quantum Spatial Search with One-Dimensional Long-Range Interactions

2020 · arXiv (Cornell University)

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. …