arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1506.04388quant-ph
收藏

非线性量子搜索

Nonlinear Quantum Search

Thomas G. Wong

摘要:

虽然量子机制是线性的,但仍然存在具有多个相互作用粒子的量子系统,其中单个粒子的有效evo由非线性方程控制。这包括玻色-爱因斯坦凝聚体,它由Gross-Pitaevskii方程(GPE)控制,GPE是一个三次非线性薛定谔方程(NLSE),项为propto $|ψ|^2ψ$。该方程的Evo在恒定时间内解决了非结构搜索问题,但代价是提高了时间测量精度。联合优化这些资源导致$N^{1/4}$的整体缩放,这是对Grover算法的$N^{1/2}$缩放的显著但并非不合理的改进。由于GPE有效地近似多粒子薛定谔方程,其中格罗弗的算法是最佳的,我们的结果导致一个量子信息理论的约束上的粒子数需要这个近似举行,asymp。GPE并不是唯一的$f(|ψ|^2)ψ$形式的非线性方程,它在实量子物理系统的演化方程中出现:五阶NLSE描述了具有散焦修正的非线性Kerr介质中的光传播,对数NLSE描述了特定条件下的玻色液体。用这种系统分析计算机产生了一些令人惊讶的结果;例如,当时间测量精度被包括在资源计费中时,当存在单个正确AN时搜索“数据库”可能比当存在多个正确AN时搜索更容易。这些结果导致这些有效的非线性理论所需的物理资源上的定量信息理论的界限,asymp。此外,强reg图,没有全局sym,是足够完整的quant搜索他们asymp行为像unstruct搜索。某些suff完全图保留了一些非线性的改进的运行时间和资源缩放,因此我们的非线性模拟定量计算方案即使在引入一些结构时也保留了其优点。

英文摘要:

Although quant mech is linear, there are nevertheless quant sys with multiple interacting particles in which the effective evo of a single particle is governed by a nonlinear eq. This includes Bose-Einstein condensates, which are gov by the Gross-Pitaevskii eq (GPE), which is a cubic nonlin Schrodinger eq (NLSE) with a term propto $|ψ|^2ψ$. Evo by this eq solves the unstruct search prob in const time, but at the novel expense of increasing the time-measurement precision. Jointly optimizing these resources results in an overall scaling of $N^{1/4}$, which is a significant, but not unreasonable, improvement over the $N^{1/2}$ scaling of Grover's algo. Since the GPE effectively approx the multi-particle Schrodinger eq, for which Grover's algo is optimal, our result leads to a quant info-theoretic bound on the num of particles needed for this approx to hold, asymp. The GPE is not the only nonlin of the form $f(|ψ|^2)ψ$ that arises in effective eqs for the evo of real quant phys sys, however: The cubic-quintic NLSE describes light propagation in nonlin Kerr media with defocusing corrections, and the log NLSE describes Bose liquids under certain cond. Analysis of comput with such sys yields some surprising results; e.g., when time-measurement precision is included in the resource accounting, searching a "database" when there is a single correct ans may be easier than searching when there are multiple correct ans. These results lead to quant info-theoretic bounds on the phys resources required for these effective nonlin theories to hold, asymp. Further, strongly reg graphs, which have no global sym, are sufficiently complete for quant search on them to asymp behave like unstruct search. Certain suff complete graphs retain the improved runtime and resource scalings for some nonlin, so our scheme for nonlin, analog quant comput retains its benefits even when some struct is introduced.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑