发表机构
Chicago Quantum Institute and Pritzker School of Molecular Engineering, University of Chicago（芝加哥量子研究所和普里茨克分子工程学院，芝加哥大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
该研究针对单次量子参数学习的两个开放问题，构造了全局精度上界与成功概率保证，通过实例验证其可排除不可达精度、便捷表征学习方案性能，突破了传统局域参数估计的局限。
AI 中文摘要
量子计量学为各类传感任务的精度提供了量子增强的可能性。本文针对单次量子参数学习理论中的两个开放问题展开研究，突破了传统的通过重复测量进行局域参数估计的常规设置。第一个问题涉及学习精度的全局上界构造；第二个问题涉及参数学习成功概率的严格保证，即给定量子计量学任务的资源约束时，以某一精度学习参数的概率下界。我们为量子参数学习提供了严格、实用且全局的上界及成功概率保证。我们在两个实例中展示了其通用性：一是与玻色环境耦合的驱动量子比特的拉比频率学习，二是集体自旋哈密顿量学习问题。这些新的全局界和成功概率保证可用于排除无法实现的精度，并验证超出标准费舍尔信息分析或二元假设检验界所能达到的可实现精度；同时，还可在无需显式模拟开销的情况下，便捷地表征各类学习方案的性能。
英文摘要
Quantum metrology offers the possibility of quantum enhancements of the precision of various sensing tasks. In this manuscript, we tackle two open problems in the theory of single-shot quantum parameter learning, going beyond the usual setting of local parameter estimation via repeated measurements. The first concerns the construction of global upper bounds on the learning precision. The second concerns rigorous guarantees on the success probability of parameter learning, namely, lower bounds on the probability of learning a parameter with a certain precision, given the constraints on the resources used for the quantum metrology task. We provide rigorous, practical, and global upper bounds and success-probability guarantees for quantum parameter learning. Most importantly, we establish a fidelity-based learning guarantee for generic mixed-state models that can be viewed as the achievability-side analogue of the quantum Cramer-Rao bound. Whereas the latter provides a no-go constraint, based on the local curvature of the fidelities, our bound uses only pairwise fidelities between parameter-encoded states to certify that a prescribed precision is attainable with a guaranteed success probability. We demonstrate the versatility of the new bounds in a Rabi-frequency-learning example involving a driven qubit coupled to a bosonic environment and a collective-spin Hamiltonian learning problem. Together, the new global bounds and success-probability guarantees allow us to rule out unattainable precision and to certify attainable precision beyond what is possible via standard Fisher-information analysis or binary hypothesis testing bounds. They also allow one to tractably characterize the performance of various learning schemes, without the overhead of an explicit simulation.
Comments39 pages, 6 figures
