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

• URL: http://arxiv.org/abs/2607.24704v1
• Date: Mon, 27 Jul 2026 17:45:47 GMT
• Title: How Many Shots Does It Take? A Noise-Aware Quantum Resource Allocation Framework
• Abstract summary: 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.<n>We also present a theoretically grounded technique to distribute fixed shot budget across different partitions in a quantum circuit.
• Score: 0.028675177318965035
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• How Many Shots Are Enough for a Quantum Circuit? [40.18088847775028]
  Quantum algorithms require repeated circuit executions, known as shots, to estimate output distributions accurately.<n>We address the shot optimisation problem in a black-box setting, where no assumptions are made about the structure of the quantum circuit or the noise model of the backend.<n>We introduce IncrementalExecution, a novel online framework that dynamically determines when to stop executing shots.
  arXiv  Detail & Related papers  (2026-06-15T17:02:51Z)
• Fast OTSU Thresholding Using Bisection Method [0.0]
  Otsu thresholding algorithm represents a fundamental technique in image segmentation.<n>This work presents an optimized implementation that exploits the unimodal characteristics of the between-class variance function.<n>Our approach reduces the computational complexity from O(L) to O(log L) evaluations while preserving segmentation accuracy.
  arXiv  Detail & Related papers  (2025-09-19T17:40:42Z)
• Decentralized Optimization on Compact Submanifolds by Quantized Riemannian Gradient Tracking [45.147301546565316]
  This paper considers the problem of decentralized optimization on compact submanifolds.<n>We propose an algorithm where agents update variables using quantized variables.<n>To the best of our knowledge, this is the first algorithm to achieve an $mathcalO (1/K)$ convergence rate in the presence of quantization.
  arXiv  Detail & Related papers  (2025-06-09T01:57:25Z)
• A Quantum Genetic Algorithm Framework for the MaxCut Problem [49.59986385400411]
  The proposed method introduces a Quantum Genetic Algorithm (QGA) using a Grover-based evolutionary framework and divide-and-conquer principles.<n>On complete graphs, the proposed method consistently achieves the true optimal MaxCut values, outperforming the Semidefinite Programming (SDP) approach.<n>On ErdHos-R'enyi random graphs, the QGA demonstrates competitive performance, achieving median solutions within 92-96% of the SDP results.
  arXiv  Detail & Related papers  (2025-01-02T05:06:16Z)
• Distribution-Adaptive Dynamic Shot Optimization for Variational Quantum Algorithms [11.357031710307709]
  Variational quantum algorithms (VQAs) have attracted remarkable interest because of their potential computational advantages.<n>We propose a distribution-adaptive shot (DDS) framework that efficiently adjusts the number of shots per iteration in VQAs.<n>Our results demonstrate that the framework sustains inference accuracy while achieving a 50% reduction in average shot count.
  arXiv  Detail & Related papers  (2024-12-23T11:28:44Z)
• High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization [0.8341988468339112]
  Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing.<n>We leverage search-based methods to first approximately diagonalize a unitary, then perform the inversion analytically.<n>Our approach improves both the implementation precision and run time of synthesis algorithms by orders of magnitude when evaluated on unitaries from real quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-31T12:10:32Z)
• FragQC: An Efficient Quantum Error Reduction Technique using Quantum Circuit Fragmentation [4.2754140179767415]
  We present it FragQC, a software tool that cuts a quantum circuit into sub-circuits when its error probability exceeds a certain threshold. We achieve an increase of fidelity by 14.83% compared to direct execution without cutting the circuit, and 8.45% over the state-of-the-art ILP-based method.
  arXiv  Detail & Related papers  (2023-09-30T17:38:31Z)
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization [41.94295877935867]
  We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm. Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors. We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2023-08-29T17:53:08Z)
• A novel framework for Shot number minimization in Quantum Variational Algorithms [0.0]
  Variational Quantum Algorithms (VQAs) have gained significant attention as a potential solution for various quantum computing applications. implementing these algorithms on quantum devices often necessitates a substantial number of measurements. This paper presents a generalized framework for optimization algorithms aiming to reduce the number of shot evaluations in VQAs.
  arXiv  Detail & Related papers  (2023-07-08T19:14:01Z)
• Cascaded variational quantum eigensolver algorithm [0.0]
  We present a cascaded variational quantum eigensolver algorithm that only requires the execution of a set of quantum circuits once rather than at every iteration. The ansatz form does not restrict the Fock space and provides full control over the trial state.
  arXiv  Detail & Related papers  (2023-03-27T14:21:01Z)
• Post-Training Quantization for Vision Transformer [85.57953732941101]
  We present an effective post-training quantization algorithm for reducing the memory storage and computational costs of vision transformers. We can obtain an 81.29% top-1 accuracy using DeiT-B model on ImageNet dataset with about 8-bit quantization.
  arXiv  Detail & Related papers  (2021-06-27T06:27:22Z)
• Effective and Fast: A Novel Sequential Single Path Search for Mixed-Precision Quantization [45.22093693422085]
  Mixed-precision quantization model can match different quantization bit-precisions according to the sensitivity of different layers to achieve great performance. It is a difficult problem to quickly determine the quantization bit-precision of each layer in deep neural networks according to some constraints. We propose a novel sequential single path search (SSPS) method for mixed-precision quantization.
  arXiv  Detail & Related papers  (2021-03-04T09:15:08Z)
• Fully Quantized Image Super-Resolution Networks [81.75002888152159]
  We propose a Fully Quantized image Super-Resolution framework (FQSR) to jointly optimize efficiency and accuracy. We apply our quantization scheme on multiple mainstream super-resolution architectures, including SRResNet, SRGAN and EDSR. Our FQSR using low bits quantization can achieve on par performance compared with the full-precision counterparts on five benchmark datasets.
  arXiv  Detail & Related papers  (2020-11-29T03:53:49Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.