arXiv:2610.17163
Bosonic unstructured search: quantum enhancement without entanglement
Yu-Xin Wang, Erfan Abbasgholinejad, Supratik Sarkar, Sharoon Austin, Andrew M. Childs, Alexey V. Gorshkov, Mohammad Hafezi
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 $φ_{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(φ_{0}/{2})}|)$ for discrete oracles with $n_{\text{b}} |{\sin(φ_{0}/{2})}|=O(1)$. In contrast, for discrete oracles with $n_{\text{b}} |{\sin(φ_{0}/{2})}|=Ω(1)$, we provide an algorithm using $O(\max\{1,\sqrt{N/n_{\text{b}}|{\sin(φ_{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 $γ$, we prove a query lower bound of $Ω( γN / n _{\text{b}} B_{0}^{2} )$, attained for $γ= Ω(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.
AI Summary
The paper studies identification of one marked mode among $N$ bosonic modes, where the mark applies a number-dependent phase shift. It allows arbitrary controls, ancillas and adaptive measurements, subject to a time-averaged total mean-boson-number budget $n_b\gg1$. Cost counts oracle interaction time or fixed-phase queries, not control overhead. For the continuous-time oracle $e^{-iB_0t\hat n_x}$ with uniform boson loss rate $\gamma$, it establishes the optimal scaling $T=\Theta(\max\{\sqrt N/(n_bB_0),N\gamma/(n_bB_0^2)\})$. Loss therefore changes the mode-number scaling once $\gamma$ exceeds order $B_0/\sqrt N$. Without loss, both a W-like superposition of multimode Fock states and a fully separable protocol using local vacuum–Fock superpositions attain the optimum. Strategies whose unconditional probe state remains Gaussian obey the stronger bound $T=\Omega(B_0^{-1}\min\{\sqrt{N/n_b},N/n_b\})$, with matching constructions. Coherent probes attain the general lossy bound when $\gamma=\Omega(B_0\sqrt{n_b/N})$. For fixed-phase queries, writing $q=n_b|\sin(\phi_0/2)|$, the optimal query count is $\Theta(\max\{1,\sqrt N/\min(q,\sqrt q)\})$, distinguishing discrete queries from freely adjustable interrogation times. The lower bounds compare distinguishability between oracle trajectories using positivity and mean-energy constraints; Gaussian bounds use photon-number moment inequalities, while the loss proof uses a split-environment dilation. Optical and superconducting-circuit implementations are proposed, not demonstrated. Practical limitations include nonlinear-control requirements, architecture-dependent parallelization overhead and loss sensitivity. The Gaussian exclusion does not cover arbitrary outcome-dependent feedforward, and the lossy lower bound assumes finite instantaneous second photon-number moments.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.