无需预设结构即可实现量子哈密顿量的海森堡极限精度学习
Ansatz-free Hamiltonian learning with Heisenberg-limited scaling
- 仅通过系统演化黑箱查询和最少数字控制,实现无假设的哈密顿量学习
- 首次在任意稀疏哈密顿量上达成海森堡极限精度,误差随时间平方根下降
- 对制备与测量误差鲁棒,适合复杂量子系统的真实场景验证
学习未知相互作用对量子信息处理、器件校准和量子传感至关重要。传统哈密顿量学习依赖局域性假设,但此假设在一般哈密顿量中不成立。此前方法均需高阶反多项式依赖于精度,无法突破标准量子极限,更难达到黄金标准的海森堡极限。本文提出一种无需预设交互结构的量子算法,仅使用系统实时演化黑箱查询与最小数字控制,即可实现任意稀疏哈密顿量的海森堡极限精度学习。该方法对状态制备与测量误差具有鲁棒性,提升实际可行性。数值实验验证了其在物理哈密顿量学习与模拟量子计算验证中的性能,并与当前最优海森堡极限方法对比。此外,我们揭示了总演化时间与量子控制间的基本权衡关系,揭示了任意学习算法中可调控性与演化时间复杂度的内在联系。这些成果为复杂量子系统中最小假设下的海森堡极限学习开辟新路径,有望推动新型基准测试与验证协议的发展。
原文摘要 · Abstract (English)
Learning the unknown interactions that govern a quantum system is crucial for quantum information processing, device benchmarking, and quantum sensing. The problem, known as Hamiltonian learning, is well understood under the assumption that interactions are local, but this assumption may not hold for arbitrary Hamiltonians. Previous methods all require high-order inverse polynomial dependency with precision, unable to surpass the standard quantum limit and reach the gold standard Heisenberg-limited scaling. Whether Heisenberg-limited Hamiltonian learning is possible without prior assumptions about the interaction structures, a challenge we term \emph{ansatz-free Hamiltonian learning}, remains an open question. In this work, we present a quantum algorithm to learn arbitrary sparse Hamiltonians without any structure constraints using only black-box queries of the system's real-time evolution and minimal digital controls to attain Heisenberg-limited scaling in estimation error. Our method is also resilient to state-preparation-and-measurement errors, enhancing its practical feasibility. We numerically demonstrate our ansatz-free protocol for learning physical Hamiltonians and validating analog quantum simulations, benchmarking our performance against the state-of-the-art Heisenberg-limited learning approach. Moreover, we establish a fundamental trade-off between total evolution time and quantum control on learning arbitrary interactions, revealing the intrinsic interplay between controllability and total evolution time complexity for any learning algorithm. These results pave the way for further exploration into Heisenberg-limited Hamiltonian learning in complex quantum systems under minimal assumptions, potentially enabling new benchmarking and verification protocols.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。