具有自发衰减量子比特的鲁棒量子搜索
Robust quantum searching with spontaneously decaying qubits
摘要：
我们提出了一个修改的标准单项目的量子搜索程序，从量子比特的自发衰变获得鲁棒性。这抑制了通常的种群振荡，使系统达到稳定状态，并使解的种群数量大大增加。对多达36个量子位进行了稳态的数值评估。在我们的分析中，状态空间的巨大尺寸是通过利用主方程中的对称性来处理的，该主方程将计算机资源的缩放从指数减少到多项式。基于这些结果，我们估计，一个无错误的解决方案，可以从稳定状态O（log log N）重复后，与近单位的概率。这使得整体缩放为O（sqrt{N} log log N），仅比理想量子情况略差。
英文摘要：
We present a modification of the standard single-item quantum search procedure that acquires robustness from spontaneous decay of the qubits. This damps the usual oscillation of populations, driving the system to a steady state with a strongly enhanced population of the solution. Numerical evaluation of the steady state was performed for up to 36 qubits. The huge size of the state space in our analysis is dealt with by exploiting a symmetry in the master equation that reduces the scaling of computer resources from exponential to polynomial. Based on these results we estimate that an error-free solution can be retrieved from the steady state after O(log log N) repetitions, with near-unit probability. This brings the overall scaling to O(sqrt{N} log log N), only slightly worse than for the ideal quantum case.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
