Distribution-adaptive dynamic shot optimization for variational quantum algorithms

Variational quantum algorithms (VQAs) have attracted remarkable interest over the past few years because of their potential computational advantages on near-term quantum devices. They leverage a hybrid approach that integrates classical and quantum computing resources to solve high-dimensional problems that are challenging for classical approaches alone. In the training process of variational circuits, constructing an accurate probability distribution for each epoch is not always necessary, creating opportunities to reduce computational costs through shot reduction. However, existing shot allocation methods that capitalize on this potential often lack adaptive feedback or are tied to specific classical optimizers, which limits their applicability to common VQAs and broader optimization techniques. Our observations indicate that the information entropy of a quantum circuit’s output distribution exhibits an approximately exponential relationship with the number of shots needed to achieve a target Hellinger distance. In this work, we propose a distribution-adaptive dynamic shot (DDS) framework that efficiently adjusts the number of shots per iteration in VQAs using the entropy distribution from the prior training epoch. Our results demonstrate that the DDS framework sustains inference accuracy while achieving an <a:math xmlns:a="http://www.w3.org/1998/Math/MathML"> <a:mrow> <a:mo>∼</a:mo> <a:mn>50</a:mn> <a:mo>%</a:mo> </a:mrow> </a:math> reduction in average shot count compared to fixed-shot training, and <b:math xmlns:b="http://www.w3.org/1998/Math/MathML"> <b:mrow> <b:mo>∼</b:mo> <b:mn>60</b:mn> <b:mo>%</b:mo> </b:mrow> </b:math> higher accuracy than recently proposed tiered shot allocation methods. Furthermore, in noisy simulations that reflect the error rates of actual IBM quantum systems, DDS achieves an <c:math xmlns:c="http://www.w3.org/1998/Math/MathML"> <c:mo>∼</c:mo> <c:mn>30</c:mn> <c:mo>%</c:mo> </c:math> reduction in the total number of shots compared to the fixed-shot method with minimal degradation in accuracy and offers <d:math xmlns:d="http://www.w3.org/1998/Math/MathML"> <d:mrow> <d:mo>∼</d:mo> <d:mn>70</d:mn> <d:mo>%</d:mo> </d:mrow> </d:math> higher computational accuracy than tiered shot allocation methods.