Optimal spatial searches with long-range tunneling
Emma C. King, Moritz Linnebacher, Peter P. Orth, Matteo Rizzi, Giovanna Morigi

TL;DR
This paper demonstrates that long-range interactions in quantum walks enable optimal quantum search in lower-dimensional lattices, expanding the potential for efficient quantum algorithms beyond traditional high-dimensional or all-connected systems.
Contribution
It establishes a precise relationship between long-range interaction decay rates and the effective dimension for optimal quantum search, showing how to achieve Grover's scaling in lower dimensions.
Findings
Optimal quantum search is achievable in lower dimensions with long-range interactions.
The dynamics can be mapped to short-range models with effective dimensions.
Long-range interactions enhance quantum search efficiency in practical platforms.
Abstract
A quantum walk on a lattice is a paradigm of a quantum search in a database. The database qubit strings are the lattice sites, qubit rotations are tunneling events, and the target site is tagged by an energy shift. For quantum walks on a continuous time, the walker diffuses across the lattice and the search ends when it localizes at the target site. The search time can exhibit Grover's optimal scaling with the lattice size , namely, , on an all-connected, complete lattice. For finite-range tunneling between sites, instead, Grover's optimal scaling is warranted when the lattice is a hypercube of dimensions. Here, we show that Grover's optimum can be reached in lower dimensions on lattices of long-range interacting particles, when the interaction strength scales algebraically with the distance as and . For the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Data Management and Algorithms · Game Theory and Applications
