利用Grover算法的实验性量子计算增强传感
Experimental quantum-computing-enhanced sensing using Grover's algorithm
- Cornell University（康奈尔大学）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
实验证明利用Grover算法增强量子传感，可在宽带宽下以少量硬件超越传统基线，显著减少所需信号量，实现计量学优势。
AI中文摘要：
量子传感与量子计算的结合，以提供超越传统量子传感的增强，最近已成为量子计算的一个有前景的潜在应用，该应用无需大规模或容错硬件即可带来优势。在本工作中，我们报告了一项近期理论提案的实验演示，该提案旨在重新利用Grover搜索算法来提高在宽检测带宽内检测未知频率信号的能力。我们的实验基于一个由单个超导量子比特耦合到单个超导腔体组成的系统，突显了实现该协议所需的硬件要求较为适中。我们发现，对于检测带宽大于10 MHz的情况，基于Grover的传感在我们的实验平台上能够超越自然的非Grover基线，其优势在超过该盈亏平衡点后随带宽经验性地超线性增长。使用基于Grover的协议，在较大检测带宽和较高期望检测精度的选择下，为做出准确检测决策所需感知的信号量减少了10倍以上。我们的结果提供了原理验证，表明基于Grover的量子计算传感可以在近期硬件中实现，并且尽管协议复杂度增加，仍能提供远超盈亏平衡的计量学优势。
英文摘要：
The combination of quantum sensing with quantum computing to provide an enhancement over conventional quantum sensing has recently emerged as a promising potential application of quantum computing that could give advantages without needing large-scale or fault-tolerant hardware. In this work, we report an experimental demonstration of a recent theoretical proposal to repurpose Grover's search algorithm to improve the ability to detect signals with unknown frequency within a large detection bandwidth. Our experiments were based on a system comprising a single superconducting qubit coupled to a single superconducting cavity, highlighting the modest hardware requirements for realizing the protocol. We found that Grover-based sensing was able to outperform the natural non-Grover baseline for our experimental platform for detection bandwidths $>$10~MHz, with an advantage that empirically grew superlinearly with the bandwidth beyond that break-even point. The use of the Grover-based protocol reduced the amount of signal that needed to be sensed to make an accurate detection decision by more than 10$\times$ for choices of larger detection bandwidth and higher desired detection accuracy. Our results provide a proof-of-principle validation that Grover-based quantum computational sensing can be realized in near-term hardware and provide a metrological advantage well beyond break-even in spite of the additional protocol complexity.
