How Many Shots Does It Take? A Noise-Aware Quantum Resource Allocation Framework

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.

Source: arXiv:2607.24704v1 - http://arxiv.org/abs/2607.24704v1 PDF: https://arxiv.org/pdf/2607.24704v1 Original Link: http://arxiv.org/abs/2607.24704v1