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 ∼ 50 % reduction in average shot count compared to fixed-shot training, and ∼ 60 % 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 ∼ 30 % reduction in the total number of shots compared to the fixed-shot method with minimal degradation in accuracy and offers ∼ 70 % higher computational accuracy than tiered shot allocation methods.
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 ∼ 50 % reduction in average shot count compared to fixed-shot training, and ∼ 60 % 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 ∼ 30 % reduction in the total number of shots compared to the fixed-shot method with minimal degradation in accuracy and offers ∼ 70 % higher computational accuracy than tiered shot allocation methods.
The exponential runtime of quantum simulators on classical machines, along with long queue times and high costs associated with real quantum devices, presents significant challenges for the efficient optimization of Variational Quantum Algorithms (VQAs) such as the Variational Quantum Eigensolver (VQE), Quantum Approximate Optimization Algorithm (QAOA), and Quantum Neural Networks (QNNs). To address these limitations, we propose a novel approach, DyPP (Dynamic Parameter Prediction), which accelerates the convergence of VQAs by leveraging regular trends in the parameter weights to update parameters efficiently. We introduce two techniques for optimal prediction performance: Naive Prediction (NaP) and Adaptive Prediction (AdaP). Through extensive experimentation and training of multiple QNN models on various datasets, we demonstrate that DyPP achieves a speedup of approximately 2.25×compared to standard training methods, while also providing improved accuracy (up to 2.3% higher) and lower loss (up to 6.1% reduction) with minimal storage and computational overhead. We further evaluate DyPP’s effectiveness in VQE for molecular ground-state energy estimation and in QAOA for graph MaxCut. Our results show that, on average, DyPP leads to a speedup of up to 3.1× for VQE and 2.91× for QAOA compared to traditional optimization, while requiring up to 3.3× fewer shots (i.e., repeated circuit executions). Even in the presence of hardware noise, DyPP outperforms existing optimization techniques, delivering up to 3.33× speedup and requiring 2.5× fewer shots, thereby enhancing the efficiency of VQAs.
Variational Quantum Algorithms (VQAs) are a promising approach for practical applications like chemistry and materials science on near-term quantum computers as they typically reduce quantum resource requirements. However, in order to implement VQAs, an efficient classical optimization strategy is required. Here we present a new stochastic gradient descent method using an adaptive number of shots at each step, called the global Coupled Adaptive Number of Shots (gCANS) method, which improves on prior art in both the number of iterations as well as the number of shots required. These improvements reduce both the time and money required to run VQAs on current cloud platforms. We analytically prove that in a convex setting gCANS achieves geometric convergence to the optimum. Further, we numerically investigate the performance of gCANS on some chemical configuration problems. We also consider finding the ground state for an Ising model with different numbers of spins to examine the scaling of the method. We find that for these problems, gCANS compares favorably to all of the other optimizers we consider.
Efficient classical optimizers are crucial in practical implementations of Variational Quantum Algorithms (VQAs). In particular, to make Stochastic Gradient Descent (SGD) resource efficient, adaptive strategies have been proposed to determine the number of measurement shots used to estimate the gradient. However, existing strategies overlook the overhead that occurs in each iteration. In terms of wall-clock runtime, significant circuit-switching and communication latency can slow the optimization process when using a large number of iterations. In terms of economic cost when using cloud services, per-task prices can become significant. To address these issues, we present an adaptive strategy that balances the number of shots in each iteration to maximize expected gain per unit time or cost by explicitly taking into account the overhead. Our approach can be applied to not only to the simple SGD but also its variants, including Adam. Numerical simulations show that our adaptive shot strategy is actually efficient for Adam, outperforming many existing state-of-the-art adaptive shot optimizers. However, this is not the case for the simple SGD. When focusing on the number of shots as the resource, our adaptive-shots Adam with zero-overhead also outperforms existing optimizers.
Quantum Machine Learning (QML) has recently emerged as a rapidly growing domain as an intersection of Quantum Computing (QC) and Machine Learning (ML) fields. Hybrid quantum-classical models have demonstrated exponential speedups in various machine learning tasks compared to their classical counterparts. On one hand, training of QML models on real hardware remains a challenge due to long wait queue and the access cost. On the other hand, simulation-based training is not scalable to large QML models due to exponentially growing simulation time. Since the measurement operation converts quantum information to classical binary data, the quantum circuit is executed multiple times (called shots) to obtain the basis state probabilities or qubit expectation values. Higher number of shots worsen the training time of QML models on real hardware and the access cost. Higher number of shots also increase the simulation-based training time. In this paper, we propose shot optimization method for QML models at the expense of minimal impact on model performance. We use classification task as a test case for MNIST and FMNIST datasets using a hybrid quantum-classical QML model. First, we sweep the number of shots for short and full versions of the dataset. We observe that training the full version provides 5-6% higher testing accuracy than short version of dataset with up to 10X higher number of shots for training. Therefore, one can reduce the dataset size to accelerate the training time. Next, we propose adaptive shot allocation on short version dataset to optimize the number of shots over training epochs and evaluate the impact on classification accuracy. We use a (a) linear function where the number of shots reduce linearly with epochs, and (b) step function where the number of shots reduce in step with epochs. We note around 0.01 increase in loss and ~4% (1%) reduction in testing accuracy for reduction in shots by up to 100X (10X) for linear (step) shot function compared to conventional constant shot function for MNIST dataset, and 0.05 increase in loss and ~5-7% (5-7%) reduction in testing accuracy with similar reduction in shots using linear (step) shot function on FMNIST dataset. For comparison, we also use the proposed shot optimization methods to perform ground state energy estimation of different molecules and observe that step function gives the best and most stable ground state energy prediction at 1000X less number of shots.
Variational quantum algorithms (VQAs) hold significant promise for solving complex problems across diverse fields. However, their practical implementation on near-term quantum devices is severely hampered by the pervasive effects of quantum noise. Traditional quantum circuit compilation techniques are largely static, failing to account for the unique noise profiles inherent in individual quantum hardware. This paper introduces a novel adaptive quantum circuit compilation framework designed to mitigate these limitations. The core concept centers around dynamically adjusting the circuit layout and gate decomposition in real-time, leveraging measurements of the quantum hardware's noise characteristics to optimize both the accuracy and circuit depth of the compiled quantum circuit. This approach represents a critical step towards unlocking the full potential of VQAs by enabling them to effectively operate within the constraints of noisy quantum computers. The framework incorporates feedback loops for continuous refinement, adapting to evolving noise conditions. The methodology is described, focusing on the key components: noise profiling, adaptive gate decomposition, and circuit re-optimization. Simulation results demonstrate the effectiveness of the adaptive approach in reducing circuit depth and improving the fidelity of VQA computations compared to static compilation methods. This work lays the foundation for robust and efficient VQA execution on future quantum hardware.
Variational Quantum Algorithms (VQAs) are promising for near- and intermediate-term quantum computing, but their execution cost is substantial. Each task requires many iterations and numerous circuits per iteration, and real-world applications often involve multiple tasks, scaling with the precision needed to explore the application's energy landscape. This demands an enormous number of execution shots, making practical use prohibitively expensive. We observe that VQA costs can be significantly reduced by exploiting execution similarities across an application's tasks. Based on this insight, we propose TreeVQA, a tree-based execution framework that begins by executing tasks jointly and progressively branches only as their quantum executions diverge. Implemented as a VQA wrapper, TreeVQA integrates with typical VQA applications. Evaluations on scientific and combinatorial benchmarks show shot count reductions of 25.9× on average and over 100× for large-scale problems at the same target accuracy. The benefits grow further with increasing problem size and precision requirements.