arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新，休息一下吧，周末愉快~~
arXiv 2404.08053quant-phcond-mat.stat-mechcond-mat.str-el
收藏

利用量子临界动力学对数百量子比特以上的数字量子模拟进行基准测试

Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics

Alexander Miessen, Daniel J. Egger, Ivano Tavernelli, Guglielmo Mazzola

备注：
11 pages, 4 pages appendix, 10 figures
发表信息：
PRX Quantum 5 (4), 040320 (2024)
阅读 PDF
arXiv 页面 ↗HTML 原文 ↗

AI总结：

该研究利用多体量子临界动力学的普适标度律，在最高133量子比特硬件上基准测试数字量子模拟与误差缓解技术，并给出可靠控制边界及优化应用的最佳工作点。

摘要：

大型多体量子系统的实时模拟是一项艰巨任务，可能只有借助真正的量子计算平台才能实现。目前，量子硬件所拥有的量子比特数量已足以使经典仿真变得极具挑战性。这一条件是追求所谓量子优势所必需的，但也使结果验证变得非常困难。在本文中，我们转换视角，利用关于多体量子临界动力学的已知理论结果，对最高达133个量子比特的量子硬件及各种误差缓解技术进行基准测试。具体而言，我们在含时横场Ising哈密顿量的哈密顿量模拟中，依据已知的普适标度律开展基准测试。仅结合基本的误差缓解与抑制方法，我们的研究表明，在噪声占据主导之前，可在最高28的双量子比特门深度下实现可靠控制，其中双量子比特门数量最多为1396个。这些结果可迁移至哈密顿量模拟、变分算法、优化或量子机器学习等应用。我们以用于优化的数字化量子退火为例对此进行了演示，并在一个133格点优化问题上，依据电路深度和时间步长确定了一个最佳工作点。

英文摘要：

The real-time simulation of large many-body quantum systems is a formidable task, that may only be achievable with a genuine quantum computational platform. Currently, quantum hardware with a number of qubits sufficient to make classical emulation challenging is available. This condition is necessary for the pursuit of a so-called quantum advantage, but it also makes verifying the results very difficult. In this manuscript, we flip the perspective and utilize known theoretical results about many-body quantum critical dynamics to benchmark quantum hardware and various error mitigation techniques on up to 133 qubits. In particular, we benchmark against known universal scaling laws in the Hamiltonian simulation of a time-dependent transverse field Ising Hamiltonian. Incorporating only basic error mitigation and suppression methods, our study shows reliable control up to a two-qubit gate depth of 28, featuring a maximum of 1396 two-qubit gates, before noise becomes prevalent. These results are transferable to applications such as Hamiltonian simulation, variational algorithms, optimization, or quantum machine learning. We demonstrate this on the example of digitized quantum annealing for optimization and identify an optimal working point in terms of both circuit depth and time step on a 133-site optimization problem.

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

↑