Bosonic unstructured search: quantum enhancement without entanglement

Abstract:We consider unstructured search using multimode bosonic quantum systems under energy constraints. The task is to locate an unknown marked mode among $N$ possibilities using arbitrary control, subject to a time-averaged mean-boson-number budget $n_{\text{b}}\gg 1$. We analyze a continuous-time phase-shift oracle of strength $B_{0}$, with cost given by the total oracle time, and a discrete oracle with fixed phase $\phi_{0}$, with cost given by the number of queries. We give algorithms that identify the target with query complexity $O(\sqrt{N}/{n_{\text{b}}}B_{0})$ for continuous-time oracles or $O(\sqrt{N}/n_{\text{b}} |{\sin(\phi_{0}/{2})}|)$ for discrete oracles with $n_{\text{b}} |{\sin(\phi_{0}/{2})}|=O(1)$. In contrast, for discrete oracles with $n_{\text{b}} |{\sin(\phi_{0}/{2})}|=\Omega(1)$, we provide an algorithm using $O(\max\{1,\sqrt{N/n_{\text{b}}|{\sin(\phi_{0}/{2})}|}\})$ queries. We also prove matching lower bounds on the query complexity, showing that these algorithms are asymptotically optimal. Furthermore, we show that, in the absence of loss, non-Gaussianity is necessary to achieve the optimal joint query scaling in $N$ and $n_{\text{b}}$, but entanglement is not. Under uniform boson loss at rate $\gamma$, we prove a query lower bound of $\Omega ( \gamma N / n _{\text{b}} B_{0}^{2} )$, attained for $\gamma = \Omega(B_{0} \sqrt{n _{\text{b}}/N})$ using coherent-state probes. Finally, we propose experimental implementations using multipass optical microscopy or superconducting circuits as potential routes to speeding up imaging or device calibration with a low boson-number budget.

arXiv:2610.17163 [quant-ph]

(or arXiv:2610.17163v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2610.17163 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.