论文标题

量子计算是绿色吗?能源效率量子优势的估计值

Is quantum computing green? An estimate for an energy-efficiency quantum advantage

论文作者

Jaschke, Daniel, Montangero, Simone

论文摘要

量子优势阈值确定量子处理单元(QPU)何时在算法复杂性方面相对于经典计算硬件更有效。基于两个$ - $之间的能量效率的比较,“绿色”量子优势阈值$ - $ - 在量子和经典硬件之间的比较中起着基本作用。确实,它的特征将可以更好地决定节能策略,例如用于在混合量子古典算法中分配工作量。在这里,我们表明绿色量子优势阈值至关重要地取决于(i)实验量子门的质量以及(ii)QPU中产生的纠缠。实际上,对于需要适度纠缠的NISQ硬件和算法,经典的张量网络仿真在最终状态忠诚度上比量子计算更能更节省。我们在算法和硬件平台方面计算了一些范式示例的绿色量子优势阈值,并识别具有幂律两分之一值$ - $ $ laws offentim $α\ lyssim 1 $ - $ $ $ - 作为绿色量子优势的绿色量子theShold $ - $ $ - $ - $ -

The quantum advantage threshold determines when a quantum processing unit (QPU) is more efficient with respect to classical computing hardware in terms of algorithmic complexity. The "green" quantum advantage threshold $-$ based on a comparison of energetic efficiency between the two $-$ is going to play a fundamental role in the comparison between quantum and classical hardware. Indeed, its characterization would enable better decisions on energy-saving strategies, e.g. for distributing the workload in hybrid quantum-classical algorithms. Here, we show that the green quantum advantage threshold crucially depends on (i) the quality of the experimental quantum gates and (ii) the entanglement generated in the QPU. Indeed, for NISQ hardware and algorithms requiring a moderate amount of entanglement, a classical tensor network emulation can be more energy-efficient at equal final state fidelity than quantum computation. We compute the green quantum advantage threshold for a few paradigmatic examples in terms of algorithms and hardware platforms, and identify algorithms with a power-law decay of singular values of bipartitions $-$ with power-law exponent $α\lesssim 1$ $-$ as the green quantum advantage threshold in the near future.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源