AI 中文总结
研究量子算法执行所需shots数量，提出封闭形式解析表达式确定最佳shots数，还给出分配技术，相比当前做法减少shots约58%、能耗62%，与传统方法比总误差最多降73%。
AI 中文摘要
在量子计算机上执行任何算法都需要多次重复且成本高昂的执行（即shots）才能获得可靠结果。本文提出一个封闭形式的精确解析表达式来确定在量子计算机上可靠执行任何算法所需的最佳shots数量。还提出一种理论基础的技术，在量子电路的不同分区中分配固定的shots预算以最小化总误差。所提解析模型与当前做法相比，能将量子算法可靠执行相关的shots减少约58%，能耗最多降低62%。此外，所提不同分区的最佳shots分配技术与传统方法相比，总误差最多降低73%。
英文摘要
Any algorithm execution on quantum computers requires several repeated and costly executions (known as shots) to obtain reliable results. In this work, we propose a closed-form accurate analytical expression to determine optimal number of shots required for reliable execution of any algorithm on a quantum computer. We also present a theoretically grounded technique to distribute fixed shot budget across different partitions in a quantum circuit minimizing the total error. Our proposed analytical model helps to reduce the shots associated with reliable execution of quantum algorithms by about 58\% compared to current practice, in turn reducing the energy consumption by upto 62\%. Furthermore, our proposed optimal shot allocation technique across different partitions reduces total error by up to 73\% compared to conventional approaches.
CommentsAccepted in ACM/IEEE International Symposium on Low Power Electronics and Design (ISLPED '26)
