论文标题
关于域科学的量子算法的可伸缩性和资源估计的重要性
On the importance of scalability and resource estimation of quantum algorithms for domain sciences
论文作者
论文摘要
量子信息科学界已经看到了跨科学领域的新算法发展的激增。这些事态发展表明了计算和空间复杂性的多项式或更好的改进，从而激励了该领域的进一步研究。但是，尽管最近进步，许多作品未能就所需的算法可伸缩性或量子资源（例如，逻辑量子数，错误阈值等）提供定量估计，以实现备受追捧的“量子优势”。在本文中，我们讨论了几种量子算法，并激发了此类估计的重要性。例如，在简单的缩放假设下，我们近似于高能物理模拟算法的未来量子设备的计算期望以及与经典类似物的比较。我们断言，标准蜡烛是量子优势索赔所必需的。
The quantum information science community has seen a surge in new algorithmic developments across scientific domains. These developments have demonstrated polynomial or better improvements in computational and space complexity, incentivizing further research in the field. However, despite recent progress, many works fail to provide quantitative estimates on algorithmic scalability or quantum resources required -- e.g., number of logical qubits, error thresholds, etc. -- to realize the highly sought "quantum advantage." In this paper, we discuss several quantum algorithms and motivate the importance of such estimates. By example and under simple scaling assumptions, we approximate the computational expectations of a future quantum device for a high energy physics simulation algorithm and how it compares to its classical analog. We assert that a standard candle is necessary for claims of quantum advantage.
